How to Use This List

• These questions are divided by topic.
• Practice 1–2 problems daily.
• Use the links to open them directly on LeetCode.

🔹 Arrays (8 Questions)

1. Two Sum – Find indices of two numbers that add up to a target.
2. Remove Duplicates from Sorted Array – Work with sorted arrays.
3. Best Time to Buy and Sell Stock – Learn single pass logic.
4. Move Zeroes – Rearranging elements in-place.
5. Maximum Subarray – Understand Kadane’s Algorithm.
6. Find the Duplicate Number – Asked in Capgemini & Wipro.
7. Merge Sorted Array – Combine two sorted arrays.
8. Majority Element – Simple frequency-based logic.

🔹 Strings (6 Questions)

1. Valid Anagram – Sort or use hashmaps.
2. Valid Palindrome – Clean and compare strings.
3. Longest Common Prefix – Basic string matching.
4. Implement strStr() – Asked in TCS Ninja.
5. Reverse String – Two-pointer technique.
6. First Unique Character in a String – Learn frequency-based scanning.

🔹 Searching and Sorting (4 Questions)

1. Binary Search – Basic search logic.
2. Search Insert Position – Easy variation of binary search.
3. Sort Colors – 3-pointer Dutch Flag problem.
4. Intersection of Two Arrays – Use sets effectively.

🔹 Recursion and Backtracking (3 Questions)

1. Fibonacci Number – Recursion basics.
2. Climbing Stairs – Common in Wipro.
3. Subsets – Learn how backtracking works.

🔹 Hashing and Maps (3 Questions)

1. Two Sum – Again, shows use of hashmaps.
2. Group Anagrams – Work with map of lists.
3. Isomorphic Strings – Track mapping between characters.

🔹 Math and Logic (3 Questions)

1. Power of Two – Bitwise or loop-based logic.
2. Add Digits – Basic loop question.
3. Happy Number – Asked in Capgemini coding round.

🔹 Miscellaneous (3 Questions)

1. Valid Parentheses – Stack-based matching.
2. Merge Two Sorted Lists – Learn linked list basics.
3. Linked List Cycle – Fast-slow pointer method.

Final Tips

• Don’t try to solve all 30 in one go.

Understand the logic, not just the syntax.