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
- Lesson 1: Simple Matrix Practice
- Identifying a Toeplitz Matrix
- Counting Numbers Less than Target in Sorted Matrix
- Finding Minimum and Maximum in Diagonal of a Matrix
- Find Target Value in Sorted Matrix Row
- Lesson 2: Advanced Array Manipulation Techniques
- In-Place Array Reversal
- Anti-clockwise Rotation of Array in Python
- Shuffling Array Elements
- Reversing Array in Groups of Size K
- Array Reordering: Shuffling Quarters to the Middle in Python
- Lesson 3: Advanced String Manipulation in Python
- String Intersection in Python
- Longest Common Suffix in Array of Strings
- Finding the Longest Repeated Substring in a String
- Finding the largest common prefix in a List of Strings
- Efficient Longest Common Prefix Retrieval
- Finding the Most Common Substring in a String
- Lesson 4: Advanced List Manipulation in Python
- Merging Two Sorted Lists in Python
- Merging Sorted Lists into a Unique, Descending Order List
- Removing Common Elements from Two Sorted Lists
- Merging Multiple Sorted Lists in Python
- Lesson 5: Implementing Simple Sorting Algorithms
- Implementing Selection Sort in Python
- Implementing Insertion Sort Algorithm in Python
- Implementing Merge Sort Algorithm in Python
- Implement QuickSort Algorithm in Python without Built-in Functions