DSA Learning Journey

Structured problem-solving practice in C++, organized by topic and pattern. Each solution includes intuition, approach, complexity analysis, and edge cases.

Language: C++ Source: 100xSchool Bootcamp + Codeforces + LeetCode Profile: Codeforces — rajankumar656

---

Topics

#	Topic	Problems	Status
01	C++ Basics	—	✅ Covered
02	Loops	—	✅ Covered
03	Patterns	—	✅ Covered
04	Functions	—	✅ Covered
05	Arrays	—	✅ Covered
06	2D Arrays	—	✅ Covered
07	Strings	—	✅ Covered
08	Sorting	—	✅ Covered
09	Sets & Maps	—	✅ Covered
10	Two Pointers	—	🔄 Practicing
11	Sliding Window	—	🔄 Practicing
12	Binary Search	—	✅ Cleared
13	Bit Manipulation	5	✅ Active
14	Recursion	9	✅ Active

Problem count updates as solutions are added. Topics 01–09 covered in class — solutions being migrated.

---

Solution Format

Each problem file includes:

# Problem Name

**Source:** Codeforces / LeetCode
**Difficulty:** Easy / Medium / Hard
**Pattern:** [Topic]

## Intuition
Why this approach works.

## Approach
Step-by-step solution logic.

## Complexity
- Time: O(?)
- Space: O(?)

## Edge Cases
- List of edge cases considered.

---

Progress

• 200+ problems solved across Codeforces group contests and practice
• Topics actively practicing: Sliding Window, Two Pointers, Recursion, Bit Manipulation
• Weekly: 5–10 new problems during active study, 2/week maintenance

---

About

Built by Rajan Kumar — Cloud & DevOps Engineer (in training), Toronto. Part of the 100xSchool DSA Bootcamp.