## Find i’th Index character in a binary string obtained after n iterations

Given a decimal number m, convert it into a binary string and apply n iterations, in each iteration 0 becomes “01” and 1 becomes “10”.… Read More »

Given a decimal number m, convert it into a binary string and apply n iterations, in each iteration 0 becomes “01” and 1 becomes “10”.… Read More »

Morse code is a method of transmitting text information as a series of on-off tones, lights, or clicks that can be directly understood by a… Read More »

A Polybius Square is a table that allows someone to convert letters into numbers. To make the encryption little harder, this table can be randomized… Read More »

Like Fibonacci word, a Tribonacci word. is a specific sequence of digits. The Tribonacci word is formed by repeated concatenation in the same way that… Read More »

Given a string S, we have to find minimum characters that we can remove to make any permutation of the string S a palindrome. In… Read More »

Partition given string in such manner that i’th substring is sum of (i-1)’th and (i-2)’nd substring. Examples: Input : “11235813” Output : [“1”, “1”, “2”,… Read More »

Given a sorted array of strings which is interspersed with empty strings, write a method to find the location of a given string. Examples: Input… Read More »

Given a large number as string s and an integer k which denotes the number of breakpoints we must put in the number k <=… Read More »

Given a sentence str. The problem is to remove all the palindromic words from the given sentence. Examples: Input : str = “Text contains malayalam… Read More »

Infix : An expression is called the Infix expression if the operator appears in between the operands in the expression. Simply of the form (operand1… Read More »

Prefix : An expression is called the prefix expression if the operator appears in the expression before the operands. Simply of the form (operator operand1… Read More »

String is an important topic from GATE exam point of view. We will discuss key points on strings as well different types of questions based… Read More »

Postfix: An expression is called the postfix expression if the operator appears in the expression after the operands. Simply of the form (operand1 operand2 operator).… Read More »

Given a string, convert the string to palindrome without any modifications like adding a character, removing a character, replacing a character etc. Examples: Input :… Read More »

Given a string s, find length of the longest prefix which is also suffix. The prefix and suffix should not overlap. Examples: Input : aabcdaabc… Read More »