A string is traditionally a sequence of characters, either as a literal constant or as some kind of variable. The latter may allow its elements to be mutated and the length changed, or it may be fixed (after creation).

A string is generally understood as a data type and is often implemented as an array of bytes (or words) that stores a sequence of elements, typically characters. String datatypes have historically allocated one byte per character. In C, the length of a string can be stored implicitly by using a special terminating character; often this is the null character (NUL), which has all bits zero.

Below is the list of commonly asked string interview questions –

- Check if given string is a rotated palindrome or not

- Longest Palindromic Substring (Non-DP Space Optimized Solution)

- Check if repeated subsequence is present in the string or not

- Check if strings can be derived from each other by circularly rotating them

- Check if given set of moves is circular or not

- Convert given number into corresponding excel column name

- Determine if two strings are anagram or not

- Find all binary strings that can be formed from given wildcard pattern

- Find all interleavings of given strings

- Isomorphic Strings

- Find all possible palindromic substrings in a string

- Find all possible combinations of words formed from mobile keypad

- Find all possible combinations by replacing given digits with characters of the corresponding list

- Find all words from given list that follows same order of characters as given pattern

- Find first k non-repeating characters in a string in single traversal

- Group anagrams together from given list of words

- Introduction to Pattern Matching

- Inplace remove all occurrences of ‘AB’ and ‘C’ from the string

- Longest even length palidromic sum substring

- Print string in zig-zag form in k rows

- Reverse given text without reversing the individual words

- Run Length Encoding (RLE) data compression algorithm

- Validate an IP address

- Find the longest substring of given string containing k distinct characters

- Find all palindromic permutations of a string

- Find all substrings of a string that are permutation of a given string

- Find the longest substring of given string containing all distinct characters

- Find all Permutations of a given string

- Iterative Approach to find Permutations of a String in C++ and Java

- Find all lexicographically next permutations of a string sorted in ascending order

- Generate all Permutations of a String in Java | Recursive & Iterative

- Find all Lexicographic Permutations of a String

- Find Lexicographically minimal string rotation

- Find all strings of given length containing balanced parentheses

- Find all N-digit binary numbers with k-bits set where k ranges from 1 to N

- Generate binary numbers between 1 to N

- Find all combinations of non-overlapping substrings of a string

- Find all N-digit binary numbers having more 1’s than 0’s for any prefix

- Find all N-digit numbers with given sum of digits

- Find all N-digit strictly increasing numbers (Bottom-Up and Top-Down Approach)

- Calculate rank of given string among all its lexicographically sorted permutations

- Combinations of words formed by replacing given numbers with corresponding alphabets

- Check if given sentence is syntactically correct or not

- Word Break Problem

- Wildcard Pattern Matching

- Count number of times a pattern appears in given string as a subsequence

- The Levenshtein distance (Edit distance) problem

- Longest Common Subsequence | Introduction & LCS Length

- Longest Common Subsequence | Space optimized version

- Longest Common Subsequence of K-sequences

- Longest Common Subsequence | Finding all LCS

- Longest Repeated Subsequence problem

- Longest Palindromic Subsequence using Dynamic Programming

- Find minimum cuts needed for palindromic partition of a string

- Longest Common Substring problem

- Shortest Common Supersequence | Introduction & SCS Length

- Shortest Common Supersequence | Finding all SCS

- Shortest Common Supersequence | Using LCS

- Implement Diff Utility

- Find all N-digit binary numbers with equal sum of bits in its two halves

- Check if given string is interleaving of two other given strings

- Difference between Subarray, Subsequence and Subset

- std::next_permutation | Overview & Implementation in C++

- std::prev_permutation | Overview & Implementation in C++

- Implementation of KMP Algorithm in C, C++ and Java

- Reverse String without using Recursion

- Reverse given string using Recursion

- Reverse a String in Java in 10 different ways

- Determine if a given string is palindrome or not

**Thank you for being with us. 🙂**

## Leave a Reply