Back to Topics
String
43 questions in this topic
| # | Status | Problem | Difficulty | Marks | Save | Notes | Revision |
|---|---|---|---|---|---|---|---|
| 1 |
Reverse a String
|
Easy | 0 | ||||
| 2 |
Check whether a String is Palindrome or not
|
Easy | 0 | ||||
| 3 |
Find Duplicate characters in a string
|
Easy | 0 | ||||
| 4 |
Why strings are immutable in Java?
|
Medium | 0 | ||||
| 5 |
Write a Code to check whether one string is a rotation of another
|
Medium | 0 | ||||
| 6 |
Write a Program to check whether a string is a valid shuffle of two strings or not
|
Medium | 0 | ||||
| 7 |
Count and Say problem
|
Medium | 0 | ||||
| 8 |
Write a program to find the longest Palindrome in a string.[ Longest palindromic Substring]
|
Easy | 0 | ||||
| 9 |
Find Longest Recurring Subsequence in String
|
Medium | 0 | ||||
| 10 |
Print all Subsequences of a string.
|
Medium | 0 | ||||
| 11 |
Print all the permutations of the given string
|
Medium | 0 | ||||
| 12 |
Split the Binary string into two substring with equal 0’s and 1’s
|
Medium | 0 | ||||
| 13 |
Word Wrap Problem [VERY IMP].
|
Medium | 0 | ||||
| 14 |
EDIT Distance [Very Imp]
|
Hard | 0 | ||||
| 15 |
Find next greater number with same set of digits. [Very Very IMP]
|
Easy | 0 | ||||
| 16 |
Balanced Parenthesis problem.[Imp]
|
Easy | 0 | ||||
| 17 |
Word break Problem[ Very Imp]
|
Hard | 0 | ||||
| 18 |
Rabin Karp Algo
|
Hard | 0 | ||||
| 19 |
KMP Algo
|
Hard | 0 | ||||
| 20 |
Convert a Sentence into its equivalent mobile numeric keypad sequence.
|
Medium | 0 | ||||
| 21 |
Minimum number of bracket reversals needed to make an expression balanced.
|
Medium | 0 | ||||
| 22 |
Count All Palindromic Subsequence in a given String.
|
Medium | 0 | ||||
| 23 |
Count of number of given string in 2D character array
|
Medium | 0 | ||||
| 24 |
Search a Word in a 2D Grid of characters.
|
Medium | 0 | ||||
| 25 |
Boyer Moore Algorithm for Pattern Searching.
|
Hard | 0 | ||||
| 26 |
Converting Roman Numerals to Decimal
|
Medium | 0 | ||||
| 27 |
Longest Common Prefix
|
Medium | 0 | ||||
| 28 |
Number of flips to make binary string alternate
|
Medium | 0 | ||||
| 29 |
Find the first repeated word in string.
|
Medium | 0 | ||||
| 30 |
Minimum number of swaps for bracket balancing.
|
Medium | 0 | ||||
| 31 |
Find the longest common subsequence between two strings.
|
Medium | 0 | ||||
| 32 |
Program to generate all possible valid IP addresses from given string.
|
Medium | 0 | ||||
| 33 |
Write a program to find the smallest window that contains all characters of string itself.
|
Medium | 0 | ||||
| 34 |
Rearrange characters in a string such that no two adjacent are same
|
Medium | 0 | ||||
| 35 |
Minimum characters to be added at front to make string palindrome
|
Easy | 0 | ||||
| 36 |
Given a sequence of words, print all anagrams together
|
Medium | 0 | ||||
| 37 |
Find the smallest window in a string containing all characters of another string
|
Medium | 0 | ||||
| 38 |
Recursively remove all adjacent duplicates
|
Easy | 0 | ||||
| 39 |
String matching where one string contains wildcard characters
|
Medium | 0 | ||||
| 40 |
Function to find Number of customers who could not get a computer
|
Medium | 0 | ||||
| 41 |
Transform One String to Another using Minimum Number of Given Operation
|
Medium | 0 | ||||
| 42 |
Check if two given strings are isomorphic to each other
|
Medium | 0 | ||||
| 43 |
Recursively print all sentences that can be formed from list of word lists
|
Medium | 0 |