LeetCode Problems for DSA II Year III Sem
• Arrays & Strings (5 Problems)
1. #1 – Two Sum
Find two numbers that add up to a target.
2. #26 – Remove Duplicates from Sorted Array
Modify array in-place to remove duplicates.
3. #53 – Maximum Subarray
Find the contiguous subarray with maximum sum.
4. #125 – Valid Palindrome
Check if a string is a palindrome (ignore cases & symbols).
5. #344 – Reverse String
Reverse a character array in-place.
• Linked List (10 Problems)
6. #21 – Merge Two Sorted Lists
Merge two sorted linked lists.
7. #83 – Remove Duplicates from Sorted List
Remove duplicates from a sorted linked list.
8. #141 – Linked List Cycle
Detect if a cycle exists.
9. #206 – Reverse Linked List
Reverse a singly linked list.
10. #203 – Remove Linked List Elements
Remove nodes with a specific value.
11. #234 – Palindrome Linked List
Check if a linked list is palindrome.
12. #160 – Intersection of Two Linked Lists
Find intersection node.
13. #876 – Middle of the Linked List
Find the middle node.
14. #237 – Delete Node in a Linked List
Delete a node (given access to it).
15. #1290 – Convert Binary Number in a Linked List to Integer
Convert binary list to decimal.
• Stack & Queue (5 Problems)
16. #20 – Valid Parentheses
Check if parentheses are balanced.
17. #232 – Implement Queue using Stacks
Build a queue using stacks.
18. #225 – Implement Stack using Queues
Build a stack using queues.
19. #155 – Min Stack
Design a stack that supports getMin().
20. #933 – Number of Recent Calls
Count recent requests using queue logic.
• Trees & Graphs (5 Problems)
21. #104 – Maximum Depth of Binary Tree
Find tree depth.
22. #100 – Same Tree
Check if two trees are identical.
23. #226 – Invert Binary Tree
Mirror a binary tree.
24. #101 – Symmetric Tree
Check if tree is symmetric.
25. #733 – Flood Fill
Perform flood fill on a grid (graph traversal concept).