
Already know some of this? A 2-minute test skips the lessons you know.
Take the placement testA free 9-lesson course built from CodeHelp - by Babbar's 1h 53m of YouTube video. 2 days at 90 minutes a day, with study notes and a quiz in every lesson. A 2-minute placement test skips what you already know.
Taught by CodeHelp - by Babbar on YouTube. Videos play in YouTube's own player, so the creator keeps every view.
Visualize how character arrays are stored in memory with contiguous blocks, and explain the role of the null character (ASCII 0) as a string terminator for input and output operations.
Reverse a character array in place by swapping characters from start and end indices moving inward, achieving O(n) time and O(1) space complexity.
Determine if a string is a palindrome by comparing characters from both ends moving inward, returning true only if all corresponding pairs match.
Solve the LeetCode Valid Palindrome problem by filtering alphanumeric characters, converting to lowercase via ASCII arithmetic, and applying the two-pointer comparison.
Count frequencies of each lowercase letter using a 26-element integer array indexed by ch-'a', then find the character with the maximum count in O(n) time and O(1) space.
Check if any permutation of pattern string s1 exists in s2 using a fixed-size 26-element frequency array and a sliding window of length s1.size() over s2.
Compress a string by replacing consecutive duplicate characters with the character followed by its count (omitting count for singles), converting multi-digit counts into individual digits, and returning the new length in-place.