50 Python-Focused LeetCode Problems
These 50 LeetCode problems cover essential Python topics: loops, strings, regex, collections,
functions, modules, OOP, iterators, and error handling. Difficulty split: 20 Easy, 20 Medium,
10 Hard.
1. Two Sum (Easy)
[Link]
2. Valid Anagram (Easy)
[Link]
3. Fizz Buzz (Easy)
[Link]
4. Reverse String (Easy)
[Link]
5. Ransom Note (Easy)
[Link]
6. Move Zeroes (Easy)
[Link]
7. Contains Duplicate (Easy)
[Link]
8. Valid Parentheses (Easy)
[Link]
9. Implement strStr() (Easy)
[Link]
10. Intersection of Two Arrays II (Easy)
[Link]
11. Single Number (Easy)
[Link]
12. Palindrome Number (Easy)
[Link]
13. Merge Two Sorted Lists (Easy)
[Link]
14. Best Time to Buy and Sell Stock (Easy)
[Link]
15. Remove Duplicates from Sorted Array (Easy)
[Link]
16. Climbing Stairs (Easy)
[Link]
17. Maximum Subarray (Easy)
[Link]
18. Plus One (Easy)
[Link]
19. Linked List Cycle (Easy)
[Link]
20. Binary Search (Easy)
[Link]
21. 3Sum (Medium)
[Link]
22. Group Anagrams (Medium)
[Link]
23. Top K Frequent Elements (Medium)
[Link]
24. Longest Substring Without Repeating Characters (Medium)
[Link]
25. Rotate Array (Medium)
[Link]
26. Product of Array Except Self (Medium)
[Link]
27. Subarray Sum Equals K (Medium)
[Link]
28. Find All Anagrams in a String (Medium)
[Link]
29. Longest Palindromic Substring (Medium)
[Link]
30. Add Two Numbers (Medium)
[Link]
31. Container With Most Water (Medium)
[Link]
32. Search in Rotated Sorted Array (Medium)
[Link]
33. Combination Sum (Medium)
[Link]
34. Set Matrix Zeroes (Medium)
[Link]
35. Word Break (Medium)
[Link]
36. Kth Largest Element in an Array (Medium)
[Link]
37. Find Peak Element (Medium)
[Link]
38. Spiral Matrix (Medium)
[Link]
39. Permutations (Medium)
[Link]
40. Letter Combinations of a Phone Number (Medium)
[Link]
41. Regular Expression Matching (Hard)
[Link]
42. Median of Two Sorted Arrays (Hard)
[Link]
43. Merge k Sorted Lists (Hard)
[Link]
44. Trapping Rain Water (Hard)
[Link]
45. Word Ladder (Hard)
[Link]
46. Sudoku Solver (Hard)
[Link]
47. Serialize and Deserialize Binary Tree (Hard)
[Link]
48. Minimum Window Substring (Hard)
[Link]
49. LFU Cache (Hard)
[Link]
50. N-Queens (Hard)
[Link]