c++ week 1

 

🗓️ C++ Learning Routine (4 Weeks)

✅ Week 1: Core C++ Syntax + Basics

📘 Focus: Get comfortable with the language.

🧠 Topics (1 per day):

  1. Input/output (cin, cout), variables, data types.

  2. Conditionals (if, else, switch).

  3. Loops (for, while, do-while).

  4. Functions, function arguments, return values.

  5. Arrays & Strings (basic operations).

  6. Pointers & references (just basics for now).

  7. Practice day (write mini programs).

✍️ Mini-Exercises:

  • Check if a number is even/odd.

  • Sum of first n natural numbers.

  • Count digits of a number.

  • Reverse an array.

  • Check if a string is a palindrome.

✅ Week 2: Intermediate Concepts + STL Intro

📘 Focus: Learn efficient tools you'll use daily on Codeforces.

🧠 Topics:

  1. Functions with arrays.

  2. String operations (length, substr, sort, etc.).

  3. Vectors (push_back, sort, size, etc.).

  4. Pairs & tuples.

  5. Maps (map, unordered_map), frequency counting.

  6. Sets (set, unordered_set) for uniqueness.

  7. Practice day (solve problems using vector, map, etc.)

✍️ Mini-Exercises:

  • Frequency of characters in a string.

  • Find max/min in a vector.

  • Check for duplicates using a set.

  • Sort strings by length.

  • Count unique elements in an array.

✅ Week 3: Problem Solving Patterns

📘 Focus: Learn common techniques used in CP.

🧠 Topics:

  1. Brute force & nested loops.

  2. Prefix sum & counting.

  3. Binary Search (lower_bound, upper_bound).

  4. Two pointers technique.

  5. Bit manipulation basics (&, |, ^, <<, >>).

  6. STL algorithms (sort, count, accumulate, reverse).

  7. Practice day (combine topics).

✍️ Practice:

  • Count subarrays with a sum less than X.

  • Find first occurrence of X using binary search.

  • Check if a string has all unique characters.

  • Toggle bits of a number.

✅ Week 4: Templates for CP + Efficiency

📘 Focus: Write fast code & understand constraints.

🧠 Topics:

  1. Fast I/O in C++ (ios::sync_with_stdio(false); cin.tie(0);).

  2. Writing clean functions, macros, typedefs.

  3. Time and space complexity analysis.

  4. Competitive programming template.

  5. Debugging tips (cerr, assert, dry runs).

  6. Reading editorials and using hints.

  7. Simulated contest day.

🧪 Daily Routine (2 Hours Suggested)

TimeActivity
15 minReview yesterday’s topic.
45 minLearn today’s topic + write small code samples.
60 minSolve 2–3 Codeforces problems using the topic learned.

Comments

Post a Comment

Popular posts from this blog

Phy 129 - WM, CT-03

  Statement : For position ( x x x ) and momentum ( p p p ), the uncertainty principle is: Δ x ⋅ Δ p ≥ ℏ 2 \Delta x \cdot \Delta p \geq \frac{\hbar}{2} Δ x ⋅ Δ p ≥ 2 ℏ ​ where Δ x \Delta x Δ x is the uncertainty in position, Δ p \Delta p Δ p is the uncertainty in momentum, and ℏ ≈ 1.05 × 1 0 − 34   J \cdotp s \hbar \approx 1.05 \times 10^{-34} \, \text{J·s} ℏ ≈ 1.05 × 1 0 − 34 J \cdotp s . Similarly, for energy ( E E E ) and time ( t t t ): Δ E ⋅ Δ t ≥ ℏ 2 \Delta E \cdot \Delta t \geq \frac{\hbar}{2} Δ E ⋅ Δ t ≥ 2 ℏ ​ . #Learning -2 p = γ m v p = \gamma m v p = γm v , where: m m m is the rest mass of the particle, v v v is the velocity of the particle, γ \gamma γ is the Lorentz factor, given by γ = 1 1 − v 2 c 2 \gamma = \frac{1}{\sqrt{1 - \frac{v^2}{c^2}}} ; A wave group: a wave group corresponds to a moving particle and is formed by the superposition of multiple harmonic waves with different frequencies, wave numbers, and amplitudes.\ Wave Function Ψ ( x ) \Psi(x)...
Read more
Copy of Jujutsu Kaisen 2D Game UI Design Request                                                                                                                                                                ...
Read more

Online 3 CSE 102; Array Resources.

 Problems and their solution: Practice Problems on “Array” (MOODLE) Problem 1: Floor, Ceil within an array              A[] = {96, 21, 58, 34, 46} Number Floor Ceil 15 -1 21 21 21 21 30 21 34 96 96 96 98 96 -1 Solution: Sort them, then find floor and ceil from the array. Use selection sort: void selectionSort(int arr[], int n) {     int i, j, minIndex, temp;     for (i = 0; i < n - 1; i++) {         minIndex = i;         // Find the index of the smallest element in the remaining array         for (j = i + 1; j < n; j++) {             if (arr[j] < arr[minIndex])                 minIndex = j;         }         // Swap the found minimum element with the first element         if (minIndex != i) {    ...
Read more