Back to Topics
String
Your Progress
Progress
0%
Total Problems
43
Completed
0
Status | Problem | Bookmark | Notes | Actions |
---|---|---|---|---|
Reverse a String | ||||
Check whether a String is Palindrome or not | ||||
Find Duplicate characters in a string | ||||
Why strings are immutable in Java? | ||||
Write a Code to check whether one string is a rotation of another | ||||
Write a Program to check whether a string is a valid shuffle of two strings or not | ||||
Count and Say problem | ||||
Write a program to find the longest Palindrome in a string.[ Longest palindromic Substring] | ||||
Find Longest Recurring Subsequence in String | ||||
Print all Subsequences of a string. | ||||
Print all the permutations of the given string | ||||
Split the Binary string into two substring with equal 0’s and 1’s | ||||
Word Wrap Problem [VERY IMP]. | ||||
EDIT Distance [Very Imp] | ||||
Find next greater number with same set of digits. [Very Very IMP] | ||||
Balanced Parenthesis problem.[Imp] | ||||
Word break Problem[ Very Imp] | ||||
Rabin Karp Algo | ||||
KMP Algo | ||||
Convert a Sentence into its equivalent mobile numeric keypad sequence. | ||||
Minimum number of bracket reversals needed to make an expression balanced. | ||||
Count All Palindromic Subsequence in a given String. | ||||
Count of number of given string in 2D character array | ||||
Search a Word in a 2D Grid of characters. | ||||
Boyer Moore Algorithm for Pattern Searching. | ||||
Converting Roman Numerals to Decimal | ||||
Longest Common Prefix | ||||
Number of flips to make binary string alternate | ||||
Find the first repeated word in string. | ||||
Minimum number of swaps for bracket balancing. | ||||
Find the longest common subsequence between two strings. | ||||
Program to generate all possible valid IP addresses from given string. | ||||
Write a program to find the smallest window that contains all characters of string itself. | ||||
Rearrange characters in a string such that no two adjacent are same | ||||
Minimum characters to be added at front to make string palindrome | ||||
Given a sequence of words, print all anagrams together | ||||
Find the smallest window in a string containing all characters of another string | ||||
Recursively remove all adjacent duplicates | ||||
String matching where one string contains wildcard characters | ||||
Function to find Number of customers who could not get a computer | ||||
Transform One String to Another using Minimum Number of Given Operation | ||||
Check if two given strings are isomorphic to each other | ||||
Recursively print all sentences that can be formed from list of word lists |