A practical C++ problem-solving journey focused on logic, functions, arrays, patterns, algorithms, and real console applications.
Overview โข Problems โข Projects โข Skills
This repository contains 50 C++ problem-solving exercises organized into separate folders, with alternative approaches preserved in separate source files whenever available.
The goal is simple: practice the problem, compare solutions, understand the logic, and build stronger C++ fundamentals.
| ๐ Repository | Details |
|---|---|
| ๐งฉ Problems | 50 |
| ๐ป Language | C++ |
| ๐ Alternative solutions | Preserved separately |
| ๐ฎ External projects | 2 |
| ๐ Organization | One folder per problem |
| Section | Focus | Link |
|---|---|---|
| ๐งฉ Problems 01โ10 | Numbers, digits, frequency, basic logic | Explore |
| ๐ข Problems 11โ20 | Palindrome, patterns, passwords, random values | Explore |
| ๐งฎ Problems 21โ30 | Arrays, random data, copying, aggregation | Explore |
| ๐ง Problems 31โ40 | Shuffling, searching, dynamic array practice | Explore |
| ๐ Problems 41โ50 | Array checks and custom math functions | Explore |
| ๐ฎ Projects | Complete console applications | Explore |
Every problem has its own folder. โถ View Code opens the main solution directly.
| # | Problem | Main concept | Solutions | ๐ |
|---|---|---|---|---|
| 01 | Multiplication Table From 1 To 10 | Nested loops / formatted output | 3 | โถ View Code |
| 02 | Print Prime Numbers From 1 To N | Prime checking / loops | 1 | โถ View Code |
| 03 | Perfect Number Check | Divisors / summation | 2 | โถ View Code |
| 04 | Print Perfect Numbers From 1 To N | Reusable functions / loops | 2 | โถ View Code |
| 05 | Print Digits In Reverse Order | Digit extraction | 1 | โถ View Code |
| 06 | Sum Of Digits | % 10 / / 10 |
2 | โถ View Code |
| 07 | Reverse Number | Number reversal | 3 | โถ View Code |
| 08 | Digit Frequency | Counting digits | 1 | โถ View Code |
| 09 | All Digits Frequency | Frequency counting | 1 | โถ View Code |
| 10 | Reverse Number Then Print Digits | Reversal + traversal | 1 | โถ View Code |
| # | Problem | Main concept | Solutions | ๐ |
|---|---|---|---|---|
| 11 | Palindrome Number | Reversal / comparison | 3 | โถ View Code |
| 12 | Inverted Number Pattern | Nested loops / patterns | 1 | โถ View Code |
| 13 | Inverted Number Pattern With Letters | ASCII / nested loops | 1 | โถ View Code |
| 14 | Inverted Letter Pattern | Character patterns | 1 | โถ View Code |
| 15 | Letter Pattern | ASCII / patterns | 1 | โถ View Code |
| 16 | Print Words From AAA To ZZZ | Nested loops / combinations | 2 | โถ View Code |
| 17 | Password Guessing | Brute force / loops | 1 | โถ View Code |
| 18 | Encrypt And Decrypt Text | String manipulation / ASCII | 1 | โถ View Code |
| 19 | Random Number From 1 To 10 | Random number generation | 1 | โถ View Code |
| 20 | Random Character | Random character generation | 1 | โถ View Code |
| # | Problem | Main concept | Solutions | ๐ |
|---|---|---|---|---|
| 21 | Generate Keys | Random generation / strings | 2 | โถ View Code |
| 22 | Count Number Of Occurrences In Array | Array searching / counting | 1 | โถ View Code |
| 23 | Fill Array With Random Numbers | Random arrays | 1 | โถ View Code |
| 24 | Maximum Number In Array | Array traversal | 1 | โถ View Code |
| 25 | Minimum Number In Array | Array traversal | 1 | โถ View Code |
| 26 | Sum Of Array Elements | Accumulation | 1 | โถ View Code |
| 27 | Array Average | Sum / division | 1 | โถ View Code |
| 28 | Copy Array | Array copying | 1 | โถ View Code |
| 29 | Copy Only Prime Numbers | Filtering arrays | 1 | โถ View Code |
| 30 | Sum Of Two Arrays | Parallel array processing | 1 | โถ View Code |
| # | Problem | Main concept | Solutions | ๐ |
|---|---|---|---|---|
| 31 | Shuffle Array | Randomization / swapping | 1 | โถ View Code |
| 32 | Copy Array In Reverse Order | Reverse traversal | 1 | โถ View Code |
| 33 | Generate Keys And Store Them In Array | Strings / arrays | 1 | โถ View Code |
| 34 | Search For Number In Array | Linear search | 1 | โถ View Code |
| 35 | Search For Number โ Boolean Check | Boolean helper functions | 1 | โถ View Code |
| 36 | Input User Numbers In Array | User input / arrays | 2 | โถ View Code |
| 37 | Copy Array Using AddArrayElement | Reusable array helper | 2 | โถ View Code |
| 38 | Copy Odd Numbers To A New Array | Filtering / odd numbers | 2 | โถ View Code |
| 39 | Copy Prime Numbers To A New Array | Filtering / prime numbers | 2 | โถ View Code |
| 40 | Copy Distinct Numbers To Array | Duplicate detection | 3 | โถ View Code |
| # | Problem | Main concept | Solutions | ๐ |
|---|---|---|---|---|
| 41 | Palindrome Array | Symmetry / array comparison | 2 | โถ View Code |
| 42 | Count Odd Numbers In Array | Filtering / counting | 1 | โถ View Code |
| 43 | Count Even Numbers In Array | Filtering / counting | 1 | โถ View Code |
| 44 | Count Positive Numbers In Array | Conditions / counting | 2 | โถ View Code |
| 45 | Count Negative Numbers In Array | Conditions / counting | 1 | โถ View Code |
| 46 | Custom ABS Function | Functions / math | 1 | โถ View Code |
| 47 | Custom Round Function | Floating-point logic | 1 | โถ View Code |
| 48 | Custom Floor Function | Floating-point logic | 1 | โถ View Code |
| 49 | Custom Ceil Function | Floating-point logic | 1 | โถ View Code |
| 50 | Custom Sqrt Function | Math / pow() |
1 | โถ View Code |
These projects live in their own dedicated GitHub repositories rather than inside this problem-solving repository.
| # | Project | Focus | ๐ |
|---|---|---|---|
| 01 | ๐ชจ๐โ๏ธ Rock Paper Scissors Game | Game logic, enums, structs, random choices, rounds, result tracking | โถ Open Project |
| 02 | ๐งฎ Math Quiz Game | Random questions, difficulty levels, operations, scoring, game flow | โถ Open Project |
| โ Functions | โ Loops | โ Arrays | โ Strings |
| โ Enums | โ Structs | โ Random Numbers | โ ASCII |
| โ Searching | โ Filtering | โ Array Manipulation | โ Math Functions |
Algorithms_and_Problem-Solving_level_2/
โ
โโโ Problem-01-.../
โ โโโ My-Solution.cpp
โ โโโ Doctor-Solution.cpp
โ
โโโ Problem-02-.../
โ โโโ Solution-01.cpp
โ
โโโ ...
โ
โโโ Problem-50-Custom-Sqrt-Function/
โ โโโ Solution-01.cpp
โ
โโโ README.md
When a problem has more than one approach, the solutions remain separated, for example:
My-Solution.cppDoctor-Solution.cppAlternative-Solution.cppSolution-01.cpp
This makes it easy to compare approaches without overwriting the original solution.
All organized folders and files use clean - separators instead of spaces or unnecessary special characters. This keeps paths simple for GitHub, terminals, and IDEs.
Understand โ Solve โ Compare โ Practice โ Refactor
The repository is organized so you can solve each problem yourself first, then open the available alternatives and compare the logic and structure.
๐ Learn โข ๐ป Practice โข ๐ง Solve โข ๐ Build