Object Oriented Programming

GATE

Data Structures

Data Structures in Python

Power BI

Data Science

Django

Data Structure and Algorithm

Python

Recursion

Arrays

Searching

Sorting

String

Linked List

Data Structures in C

Maths

Strings

C++ Tricks

System Design

Theory of Computation

Computer Organization and Architecture

Operating System

Engineering Mathematics

Database

Digital Logic

Computer Networks

GATE 2022

Java

GeeksforGeeks School

Hashing

Competitive Programming

Problem of the Day

School

HTML

Javascript

Bootstrap

Web Development

Android

Microsoft Office

Machine Learning

Resume Builder

Miscellaneous

Gblog

TechTips

React

Advanced JavaScript

DSA Self Paced

CS-subjects

Data Structures and Algorithms

Operating Systems

C Language

DBMS

Basics of CPP

Data Structures ( Basics )

Object Oriented Design

Dynamic Programming

Data Interpretation and Logical Reasoning

Algorithms

Core Java

RESTful APIs

Spring Basics

CPP-Tricks

Basics of Java

Aptitude

GATE YT

Flutter

Application Development

Blockchain

GFG SDE Sheet

SDE Sheet

Deep Learning

Go Programming

Placement

C++ Programs

Data Visualisation

DevOps

Docker

Queue

Matrix

Trie

Stack

Graph

Tree

Magic Numbers

Divide and Conquer

React Native

React JS

Interview-Questions

Advanced Java

cloud-computing

income tax

Artificial Intelligence

Programming Languages

Computer Graphics

Cyber Security

Project Management

DSA / Placements

GATE Prep

Data Analytics / Data Science

Development

Cloud / DevOps

All Courses

Courses

ML & Data Science

Interview Corner

CS Subjects

School Learning

Software and Tools

Tutorials

Google Build with AI

Practice Coding Problems

Connect 1:1 with Experts

Practice

Apply Now!

Post Jobs

Jobs Updates

Jobs

The task is to convert a non-negative integer into its English representation according to the International Number System. The solution uses two approaches: breaking the number into groups of three digits and mapping key numeric values to English words. The program efficiently converts numbers to words, handling large numbers like billions and millions. For more details, check out the full article: <a href="https://www.geeksforgeeks.org/convert-number-to-words/">Program to convert a given number to words</a>.

Program to convert a given number to words

The task is to find the length of the longest proper prefix which is also a suffix. The solution uses a naive approach by comparing each proper prefix with suffix and the KMP algorithm for efficient processing. The program returns the length of the longest prefix that is also a suffix for the given string. For more details, check out the full article: <a href="https://www.geeksforgeeks.org/longest-prefix-also-suffix/">Longest prefix which is also suffix</a>.

Longest prefix which is also suffix

The task is to find the minimum number of times string s1 has to be repeated such that string s2 becomes a substring of the repeated string. The solution uses both a naive approach and the KMP algorithm to achieve this efficiently. The program returns the minimum repetition count or -1 if no solution exists. For more details, check out the full article: <a href="https://www.geeksforgeeks.org/minimum-number-of-times-a-has-to-be-repeated-such-that-b-is-a-substring-of-it/">Minimum Repetitions of s1 such that s2 is a substring of it</a>.

Minimum number of times A has to be repeated such that B is a substring of it

The task is to check if a sentence is a palindrome by removing non-alphanumeric characters and converting uppercase letters to lowercase. The solution involves comparing the original and reversed strings or using a two-pointer approach to efficiently check for palindrome properties. This Java program provides an optimal solution with time complexity of O(n). For more details, check out the full article: <a href="https://www.geeksforgeeks.org/sentence-palindrome-palindrome-removing-spaces-dots-etc/">Sentence Palindrome</a>.

Palindrome Sentence

The task is to match words in a list based on a given CamelCase pattern, where the pattern consists of uppercase characters only. The program checks if each word contains the uppercase characters of the pattern in sequence. A two-pointer approach is used to efficiently match characters. Words that match the pattern are stored in the result list. This Java program provides an optimal solution with a time complexity of O(n*len). For more details, check out the full article: <a href="https://www.geeksforgeeks.org/camelcase-pattern-matching/">CamelCase Pattern Matching</a>.

CamelCase Pattern Matching

The task is to print numbers from 1 to n with substitutions: "Fizz" for multiples of 3, "Buzz" for multiples of 5, and "FizzBuzz" for multiples of both. The article explores different approaches to solve this, including checking each integer individually, string concatenation, and using hash maps for multiple divisors. It provides detailed Java code examples for each method and their time and space complexities. Learn how to efficiently implement the FizzBuzz problem in Java. This approach ensures optimal performance for different input sizes. For more details, check out the full article: <a href="https://www.geeksforgeeks.org/fizz-buzz-implementation/">Fizz Buzz</a>.

Fizz Buzz

The task is to check whether one string is a rotation of another. The article explores different methods to solve this problem, including generating all rotations, using the KMP algorithm, and utilizing built-in methods for string matching. It discusses the time and space complexities of each approach, providing code examples in Java. The article covers both optimal and alternate solutions for detecting string rotations efficiently. Learn how to check for string rotations using various techniques to improve performance. For more details, check out the full article: <a href="https://www.geeksforgeeks.org/a-program-to-check-if-strings-are-rotations-of-each-other/">Check if Strings Are Rotations of Each Other</a>.

String Rotations of each other

To find the minimum number of characters to be added at the front of a string to make it a palindrome, we can use two approaches. The first approach checks all prefixes to find the longest palindromic prefix. The second approach utilizes the KMP algorithm's LPS array to efficiently find the longest palindromic prefix by concatenating the original string with its reverse. The result is the length of the input string minus the length of the longest palindromic prefix. For more details, check out the full article: <a href="https://www.geeksforgeeks.org/minimum-characters-added-front-make-string-palindrome/">Minimum Characters to Add at Front for Palindrome</a>.

Minimum Characters to Add for Palindrome

To find all indices of occurrences of a pattern within a text, we can use the Knuth-Morris-Pratt (KMP) algorithm. KMP efficiently searches the pattern in the given text by utilizing a Longest Prefix Suffix (LPS) array. The LPS array helps avoid redundant comparisons, ensuring faster pattern matching. The KMP algorithm preprocesses the pattern and then performs the search in linear time. This approach improves performance compared to naive pattern searching methods. For more details, check out the full article: <a href="https://www.geeksforgeeks.org/kmp-algorithm-for-pattern-searching/">KMP Algorithm for Pattern Searching</a>.

KMP Algorithm for Pattern Searching

To find the first non-repeating character in a string, you can use different approaches. A naive solution involves two nested loops, checking each character's frequency. A more efficient method uses a frequency array with two traversals of the string. Alternatively, a single traversal can be used by storing character indices and marking repeats. If no non-repeating character is found, return '$'. These methods ensure optimal performance for the problem. For more details, check out the full article: <a href="https://www.geeksforgeeks.org/given-a-string-find-its-first-non-repeating-character/">Find first non-repeating character of given string</a>.

Find first non-repeating character of given string

To check if two strings are anagrams, you can sort both strings and compare them. Alternatively, use a hash map to store character frequencies or a frequency array for lowercase characters. If the frequency counts match, the strings are anagrams. These approaches ensure efficient checking of anagram status. The time complexity for these methods varies but is optimal for practical use. For more details, check out the full article: <a href="https://www.geeksforgeeks.org/check-whether-two-strings-are-anagram-of-each-other/">Check if two Strings are Anagrams of each other</a>.

How to Check if Two Strings are Anagrams

To add two binary strings, start by trimming leading zeros. Then, perform bit-by-bit addition from the last characters of both strings. If the sum exceeds 1, store the carry for the next bit. After processing all digits, prepend '1' if there is an additional carry. Finally, return the result as a string with no leading zeros. For more details, check out the full article: <a href="https://www.geeksforgeeks.org/program-to-add-two-binary-strings/">Add two binary strings</a>.

Add two binary strings

Practice Problems

JavaScript

Linux