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 Verification
- Counting Smaller Integers in a Sorted Matrix
- Finding Minimum and Maximum Values in Diagonal of a Matrix
- Find Row Containing Target in Sorted Matrix
- Unit 2: Array Manipulation Techniques
- Reverse an Array In-Place
- Anti-Clockwise Array Rotation
- Shuffle Array by Moving K-th Element
- Reversing Array in Groups of Size K
- Array Reordering: Shuffling Quarters to the Middle
- Unit 3: Advanced String Manipulation in JavaScript
- Finding Common Characters in Strings
- Longest Common Suffix in Array of Strings
- Finding the Longest Repeated Substring in a String
- Finding the Largest Common Prefix in a Set of Strings
- Efficient Longest Common Prefix Retrieval
- Find the Most Common Substring in a String
- Unit 4: Advanced Array Manipulation in JavaScript
- Merging Two Sorted Arrays
- Removing Common Elements from Two Sorted Arrays
- Merging Sorted Arrays in Descending Order with Unique Elements
- Merging n Sorted Arrays
- Unit 5: Simple Sorting Algorithms in JavaScript
- Selection Sort Implementation
- Implementing Insertion Sort
- Merge Sort Implementation Task
- Sorting with QuickSort