Python 100 Problem Roadmap
Basics (10 problems)
Covers loops, conditionals, math, and strings.
1. Sum of digits of a number
2. Reverse a number
3. Check if a number is palindrome
4. Check if a string is palindrome
5. Factorial of a number
6. Fibonacci series up to n terms
7. Count vowels in a string
8. Find the largest of three numbers
9. Prime number check
10. Armstrong number check
Lists & Strings (15 problems)
You’ll practice slicing, searching, and simple algorithms.
11. Find the second largest number in a list
12. Remove duplicates from a list
13. Find the frequency of each element in a list
14. Rotate a list by k steps
15. Check if two strings are anagrams
16. Find first non-repeating character in a string
17. Count words in a sentence
18. Reverse words in a sentence
19. Find the longest word in a sentence
20. Sort a list without using sort()
21. Merge two sorted lists
22. Find common elements in two lists
23. Find missing number in a range list
24. Flatten a nested list
25. Generate all substrings of a string
Dictionaries & Sets (10 problems)
Helps you think in terms of hashing and key-value.
26. Word frequency counter from a paragraph
27. Find most common element in a list using dictionary
28. Remove duplicates using set
29. Check if two sets are disjoint
30. Find union, intersection, difference of sets
31. Group anagrams using dictionary
32. Create a dictionary from two lists
33. Invert a dictionary (swap keys & values)
34. Find first repeating element in a list
35. Check subset and superset relations
Functions & Recursion (10 problems)
36. GCD of two numbers (Euclidean algorithm)
37. Power of a number using recursion
38. Sum of digits using recursion
39. Generate permutations of a string
40. Generate subsets of a list
41. Tower of Hanoi
42. Binary search (recursive)
43. Nth Fibonacci (recursive)
44. Factorial (recursive)
45. Check if string is palindrome (recursive)
Important Algorithms (15 problems)
46. Linear search
47. Binary search (iterative)
48. Bubble sort
49. Insertion sort
50. Selection sort
51. Merge sort
52. Quick sort
53. Find maximum subarray sum (Kadane’s algorithm)
54. Find majority element (Boyer-Moore)
55. Count inversions in an array
56. Check balanced parentheses
57. Implement stack using list
58. Implement queue using list
59. Implement priority queue
60. Evaluate postfix expression
Object-Oriented Programming (15 problems)
61. Create a class for Student with attributes & methods
62. Implement a BankAccount class (deposit, withdraw)
63. Class for Rectangle (area, perimeter)
64. Inheritance: Shape → Circle & Rectangle
65. Polymorphism with animals (dog, cat, etc.)
66. Encapsulation example (private attributes)
67. Operator overloading (__add__)
68. Method overriding
69. Class variables vs instance variables
70. Class method and static method examples
71. Abstract class example
72. Multiple inheritance demo
73. Create a simple calculator class
74. Library management class (add book, issue book)
75. Employee hierarchy (Manager, Developer, Intern)
File Handling & Exceptions (5 problems)
76. Count lines, words, characters in a file
77. Copy contents from one file to another
78. Find most common word in a file
79. Handle division by zero exception
80. Create a log file for error handling
Advanced (15 problems)
81. JSON read & write
82. CSV file read & write
83. Regular expression: validate email
84. Regular expression: validate password strength
85. Regex: extract all phone numbers from text
86. Lambda functions with map, filter, reduce
87. List comprehension problems (generate squares, primes, etc.)
88. Decorator function example
89. Generator function example
90. Implement iterator class
91. Working with datetime module (days between dates)
92. Web scraping simple page (using requests + BeautifulSoup)
93. API call with requests (GitHub, weather, etc.)
94. Simple SQLite database CRUD
95. Sorting dictionary by values
96. Threading example (two tasks simultaneously)
Mini Projects (Final 4 problems)
97. Simple To-Do list (console-based)
98. Contact book (add, search, delete contacts)
99. Sudoku solver (backtracking)
100. Tic Tac Toe (2 players in console)
After solving these 100 problems, you’ll be comfortable with every core aspect:
• Basics, logic building
• Data structures (list, dict, set, stack, queue)
• Algorithms & recursion
• OOP (very strong)
• File handling, regex, JSON, DB
• Mini projects (real-world touch)
Would you like me to create a daily 10-problem practice plan (like Day 1 → basics, Day
2 → strings…) so you can stay consistent instead of feeling overwhelmed by the big list?
