Advanced String-based Interview Techniques

Date created
15/11/2024

This course covers complex string manipulation challenges encountered in coding interviews. Topics include Longest Substring Without Repeating Characters, Regular Expression Matching, Palindrome Partitioning, KMP and Rabin Karp Algorithms, String Compression, and more, designed to sharpen problem-solving skills for advanced interview scenarios.

What you will learn

Exploring the Longest Substring Without Repeating Characters
Decoding Regular Expression Matching
String Compression
Palindrome Partitioning
Understanding Longest Common Subsequence
Understanding the Edit Distance Problem
Anagram Grouping
Understanding the KMP Pattern Matching Algorithm
Understanding the Z Algorithm for String Matching
Understanding the Rabin Karp Algorithm
Understanding String Rotation
Substring Search with Wildcards
Trapping Rainwater Using Strings
Understanding Lexicographical Order of Strings in Depth
Exploring Palindromic Substrings Count
Reversing Words in a String
Minimum Window Substring
Understanding String Interleaving
Finding All Permutations of a String
Smallest Substring Containing All Characters of Another String