Scribd
Upload
22 views

String Interview Topics

Uploaded by

Ayushi Singh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
22 views

String Interview Topics

Uploaded by

Ayushi Singh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

String Interview Topics

 Basic Level

 Reverse a string (Iterative and Recursive).


 Check if a string is a palindrome.
 Count vowels and consonants in a string.
 Find the frequency of characters.
 Convert string case (uppercase, lowercase).

 Intermediate Level

 Remove duplicates from a string.


 Find the first non-repeating character.
 Longest common prefix among strings in an array.
 Rotate a string by k characters.
 Check if two strings are anagrams.

 Advanced Level

 Find the longest palindromic substring.


 Longest substring without repeating characters.
 String compression (e.g., "aaabb" → "a3b2").
 Minimum window substring containing all characters of another string.
 Permutations of a string.

 Pattern Matching

 Check if a string contains a given substring.


 Implement strStr() function.
 Find all occurrences of a pattern using the KMP algorithm.

 Specialized Operations

 Count and print all substrings.


 Split a string based on delimiters.
 Validate strings for balanced parentheses or tags.
 Find and replace substrings.

 Numeric/String Combination

 Add two large numbers as strings.


 Multiply two numbers represented as strings.
 Decode strings (e.g., "3[a]2[bc]" → "aaabcbc"`).
 Optimization Problems

 Longest repeating character replacement.


 Edit distance between two strings.
 Group anagrams together.

 Miscellaneous

 Check if a string can be rearranged to form a palindrome.


 Count palindromic substrings in a string.
 Implement basic string parser (e.g., JSON-like format).

You might also like