## Find the last remaining Character in the Binary String according to the given conditions

Given a binary string str consisting of only 0’s and 1’s. The following two operations can be performed on it: One digit can delete another… Read More »

- Check duplicates in a stream of strings
- Minimum number of substrings the given string can be splitted into that satisfy the given conditions
- Minimum cost to convert str1 to str2 with the given operations
- Modulo of a large Binary String
- Count number of binary strings such that there is no substring of length greater than or equal to 3 with all 1's
- Print characters in decreasing order of frequency
- Minimum number of additons to make the string balanced
- Minimum characters that are to be inserted such that no three consecutive characters are same
- Minimum length String with Sum of the alphabetical values of the characters equal to N
- Check whether two strings can be made equal by copying their characters with the adjacent ones
- Extract all integers from the given string in Java
- Count of matchsticks required to represent the given number
- C Program to concatenate two strings without using strcat
- Program to implement FLAMES game
- C program to print the length of a String using %n format specifier

Given a binary string str consisting of only 0’s and 1’s. The following two operations can be performed on it: One digit can delete another… Read More »

Given a non-negative number N, the task is to convert the number by deleting some digits of the number, such that the sum of the… Read More »

Given a string S and an array of indices A[], the task is to reverse the substrings of the given String according to the given… Read More »

Given a string S consisting of opening parentheses, closing parentheses and integers, the task is to print Yes if, in this string, the integers correctly… Read More »

Given a String S, a character array ch[], a number N and a replacing character, the task is to replace every Nth occurence of each… Read More »

Given an array of strings arr[] of the same length, the task is to find the longest palindromic string that can be made using the… Read More »

Given a string consisting of only lowercase English alphabets. The task is to count the total number of alphabetically smaller characters on the right side… Read More »

Given a string consisting of characters a and b, check if the string starts and ends with the same character or not. If it does,… Read More »

Prerequisite: Deterministic Finite Automata Given a string str consists of characters ‘a’ & ‘b’. The task is to check whether string str starts and ends… Read More »

Given a number N, the task is to convert every digit of the number into words. Examples: Input: N = 1234 Output: One Two Three… Read More »

Given a list of strings, the task is to find the sum of all LCP (Longest Common Prefix) of maximum length by selecting any two… Read More »

Given an array of strings arr[], for every string in the array, print all possible combinations of strings that can be concatenated to make that… Read More »

Given a binary string str of length N and an integer K, the task is to find the minimum number of steps required to move… Read More »

DFA or Deterministic Finite Automata is a finite state machine which accepts a string(under some specific condition) if it reaches a final state, otherwise rejects… Read More »

Given a Linked List which represents a sentence S such that each node represents a letter, the task is to reverse the sentence without reversing… Read More »