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 in Java
- Toeplitz Matrix Validator Task
- Counting Smaller Integers in a Sorted Matrix
- Finding Min and Max on the Secondary Diagonal
- Finding the Row Containing the Target in a Sorted Matrix
- Lesson 2: Advanced Array Manipulation Techniques
- Reverse an Array In-Place
- Anti-Clockwise Array Rotation
- Shuffle Array Based on Interval
- Reversing Array in Groups
- Rearrange Array Quarters
- Lesson 3: Introduction to String Manipulation in Java
- String Intersection in Order
- Longest Common Suffix Finder
- Detect Longest Repeated Substring
- Finding the Largest Common Prefix in an Array of Strings
- Efficient Longest Common Prefix in Java
- Finding the Most Common Substring
- Lesson 4: Advanced ArrayList Manipulation in Java
- Merging Two Sorted Lists
- Merge and Sort Two Lists in Descending Order While Removing Duplicates
- Remove Common Elements from Two Sorted Lists
- Merge Multiple Sorted Lists in Java
- Lesson 5: Simple Sorting Algorithms with Java
- Selection Sort Implementation in Java
- Insertion Sort Implementation
- Implement Merge Sort in Java
- QuickSort Implementation in Java
