This course focuses on classic coding questions commonly asked in technical interviews. You will practice implementing algorithms for problems such as searching in a matrix, rotating an array, and finding the longest common prefix. Master these algorithms to strengthen your coding skills and excel in technical interviews.
Overview
Syllabus
- Unit 1: Advanced Array Transformations
- Reverse Array In-Place
- Anti-Clockwise Array Rotation
- Shuffle Every K-th Element in Array
- Reverse Array in Groups
- Rearrange Array Halves for Optimization
- Unit 2: Array Combination and Comparison
- Merging Two Sorted Arrays
- Merging Two Unique Sorted Lists in Descending Order
- Removing Common Elements from Two Sorted Lists
- Merge Multiple Sorted Arrays
- Unit 3: Foundations of Matrix Manipulation
- Check for Toeplitz Matrix
- Counting Integers in a Sorted Matrix
- Find Min and Max on Secondary Diagonal
- Find Row with Target in Sorted Matrix
- Unit 4: Advanced String Manipulation Techniques
- Common Character Sequence
- Longest Common Suffix
- Repeated Substring Checker
- Largest Common Prefix
- Finding the Longest Common Prefix Efficiently
- Most Common Substring Finder
- Unit 5: Sorting Algorithms in Practice
- Implementing Selection Sort
- Insertion Sort Algorithm
- Implementing Merge Sort
- QuickSort Algorithm from Scratch