1. Basics of Arrays
- Concept: Understanding what arrays are, how they are stored, and basic operations like insertion, deletion, and traversal.
- Two-Dimensional Arrays: Learning about how 2D arrays are stored and accessed.
-
Traversal Problems:
- Wave Form Traversal: LeetCode Problem - Diagonal Traverse
- Spiral Form Traversal: LeetCode Problem - Spiral Matrix
2. Basics of Strings
- Concept: Understanding how strings are stored in memory and basic string operations.
-
Basic Problems:
- Reverse a String: LeetCode Problem - Reverse String
- Check if a String is a Palindrome: LeetCode Problem - Valid Palindrome
- Remove Vowels from a String: LeetCode Problem - Remove Vowels from a String
- Practice Link: LeetCode - Strings Problems
3. Sorting Algorithms
- Selection Sort: LeetCode Discussion on Selection Sort
- Bubble Sort: LeetCode Discussion on Bubble Sort
- Insertion Sort: LeetCode Problem - Insertion Sort List
- Practice Link: LeetCode - Sorting Problems
4. Time and Space Complexity
- Learning about the analysis of algorithms in terms of time and space complexity.
5. Algorithms on Arrays
- Binary Search: LeetCode Problem - Binary Search
-
Dutch National Flag Algorithm:
- Sort 0s and 1s: LeetCode Problem - Sort Colors (0s and 1s variation)
- Sort 0s, 1s, and 2s: LeetCode Problem - Sort Colors
-
Two Pointers Technique:
- Pair Sum: LeetCode Problem - Two Sum
- Triplet Sum: LeetCode Problem - 3Sum
- Sliding Window Algorithm: LeetCode Problem - Minimum Size Subarray Sum
- Kadane's Algorithm: LeetCode Problem - Maximum Subarray
6. Applications on Arrays
- Overlapping Intervals: LeetCode Problem - Merge Intervals
- Second Largest Element in an Array: LeetCode Problem - Kth Largest Element in an Array
- Minimum Number of Platforms: LeetCode Problem - Minimum Number of Platforms (Discussion and Custom Problems)
7. Applications on Multi-Dimensional Arrays
- Search in Row-Wise and Column-Wise Sorted Matrix: LeetCode Problem - Search a 2D Matrix II
- In-place Rotate Matrix by 90 Degrees: LeetCode Problem - Rotate Image
- Matrix Median: LeetCode Discussion - Matrix Median
- Other Questions: LeetCode - 2D Arrays Problems
8. Applications on Strings
- Longest Substring Without Repeating Characters (Sliding Window): LeetCode Problem - Longest Substring Without Repeating Characters
- Anagram Difference (Hashmap): LeetCode Problem - Minimum Number of Steps to Make Two Strings Anagram
- Shortest Substring with All Characters (Two Pointers): LeetCode Problem - Minimum Window Substring
- Minimum Operations to Make Strings Equal (Hashmap): LeetCode Problem - Minimum Operations to Make Array Equal
- Other Questions: LeetCode - String Problems
This roadmap now provides a path to mastering arrays and strings using LeetCode problems, which are widely recognized for interview preparation.
Top comments (0)