String Hashing Interview Patterns
6 min read Why String Hashing? Naive string comparison is O(L) per comparison where L is the string length. String hashing converts a […] Read article
6 min read Why String Hashing? Naive string comparison is O(L) per comparison where L is the string length. String hashing converts a […] Read article
9 min read Dynamic Programming on Strings Interview Patterns String DP problems share a common structure: a 2D table where one dimension indexes Read article
9 min read Strings appear in roughly 25-30% of coding interviews. Unlike arrays or trees, string problems have a concentrated set of patterns Read article
5 min read Parse a Boolean String Value: Truthy/Falsy Conventions Across Languages “Parse a string into a boolean value” sounds trivial — just Read article
6 min read Print All Permutations of a String: Recursion, Backtracking, and Iterative Heap’s Algorithm Generating all permutations of a string is a Read article
2 min read Write a function to find the longest palindrome in a string. 2026 Update: Longest Palindrome — Character Frequency Approach There Read article
5 min read Remove a Character from a String: In-Place, Two-Pointer, and Stream Variants Removing characters from a string is a foundational interview Read article
7 min read Longest Palindromic Substring: Expand Around Center, DP, and Manacher’s Algorithm Finding the longest palindromic substring of a string is one Read article
3 min read A typical programming interview question is “reverse a string, in place”. if you understand pointers, the solution is simple. even Read article
4 min read Problem: write the definition for this function without using any built-in functions. if pStr is null, return 0. if pStr Read article
3 min read Problem: this year on October 2, 2001, the date in MMDDYYYY format will be a palindrome (same forwards as backwards).10/02/2001when Read article
5 min read 100 fogcreek programmers are lined up in a row by an assassin. the assassin puts red and blue hats on them. Read article
3 min read A mad bomber is out on the job, making bombs. he has two fuses (pieces of string) of varying thickness Read article
7 min read this is a classic problem which i have heard many times before. this is the “harder” of the two problems, Read article
2 min read A man has a gold chain with 7 links. he needs the service of a laborer for 7 days at Read article