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: Simple Matrix Practice
- Toeplitz Matrix
- Count Less Than in Sorted Matrix
- Secondary Diagonal Min and Max
- Finding the Row in a Sorted Matrix
- Unit 2: Advanced Array Manipulation
- In-Place Array Reversal
- Anti-Clockwise Array Rotation
- Every K-th Element Shuffling
- Reverse Array in Groups of K
- Rearrange Array Quarters
- Unit 3: String Manipulation in Kotlin
- Common Characters in Sequence
- Longest Common Suffix
- Longest Repeated Substring Pattern
- Largest Common Prefix
- Efficient Longest Common Prefix
- Finding the Most Common Substring
- Unit 4: Advanced List Manipulation
- Merging Two Sorted Arrays
- Merging Sorted Arrays into Unique Descending Order
- Removing Common Elements from Sorted Arrays
- Merging N Sorted Lists
- Unit 5: Simple Sorting Algorithms
- Selection Sort Implementation
- Insertion Sort
- Merge Sort Implementation
- Implementing the QuickSort Algorithm