DSA-TRAINING

KO | EN

gitlite — search

#javascript #python #hacktoberfest #react #ai #typescript #llm #go #golang #android #machine-learning #rust #deep-learning #linux

★ 24 Open GitHub ↗

No description available.

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

# TrailX DSA Training

I am creating this repository for the TrailX DSA Training program, where I am training 30 students in Data Structures and Algorithms using C++.

This is a 45-day training program, with 4 hours of class each day. I will document the code I write during the sessions here so students can revise the concepts, practice the examples, and track the complete learning journey day by day.

## Repository Purpose

- Document all programs I write during the training.
- Maintain day-wise C++ examples for students.
- Help students revise and practice after each class.
- Build a complete 45-day record of the TrailX DSA Training program.

## Current Folder Structure

| Folder | Topics covered |
| --- | --- |
| [Day1](Day1) | Input/output, arithmetic operators, assignment operators, relational operators, logical operators, unary operators |
| [Day2](Day2) | Conditions, loops, switch, jump statements, number programs |
| [Day3](Day3) | Functions, function prototype, call by value/reference, pointers, number programs |
| [Day4](Day4) | Arrays, linear search, reverse array, max element, strings |
| [Day5](Day5) | Recursion, factorial, Fibonacci, string reversal, character frequency |
| [Day6](Day6) | Classes, constructors, encapsulation, getters/setters, `this` pointer |
| [Day7](Day7) | Inheritance, constructors, destructors, `this` pointer |
| [Day8](Day8) | Abstraction, polymorphism, protected members, runtime and compile-time polymorphism |
| [Day9](Day9) | Practice programs |
| [day10](day10) | STL `vector` and `pair` |
| [day13](day13) | STL containers: `vector`, `list`, `queue`, `stack`, `set`, `priority_queue`, `deque` |
| [day14](day14) | STL associative containers: `set`, `multiset`, `map`, `multimap`, `unordered_set`, `unordered_map`, and sorting |
| [day15](day15) | Hashing basics, frequency arrays, array size limits, and time complexity estimation |
| [day16](day16) | Integer and character hashing using arrays, ASCII indexing, `map`, and `unordered_map` |
| [day17](day17) | Searching algorithms: linear search and binary search on arrays/vectors |
| [day18](day18) | Sorting algorithms: bubble sort and selection sort |
| [day19](day19) | Insertion sort and recursion revision to understand merge sort recursion |
| [day20](day20) | Divide-and-conquer sorting algorithms: merge sort and quick sort |
| Day21 | Topic explanation and concept discussion only; no code added |
| Day22 | Topic explanation and revision session only; no code added |
| [day23](day23) | Array practice: largest, second largest, smallest, and second smallest elements |
| [day24](day24) | Array practice: check if an array is sorted and remove duplicates using `set` |
| [day25](day25) | Array practice: optimal duplicate removal from a sorted array and left rotation by one |
| [day26](day26) | Array rotation by K places: brute-force approach, reversal approach, and right rotation |
| [day27](day27) | Array practice: move zeroes to the end using brute-force and optimal approaches |
| [day28](day28) | Array practice: subarray generation and Two Sum using brute-force and hash map approaches |
| [day29](day29) | Maximum subarray sum using brute-force, better, and Kadane's algorithm approaches |
| [day30](day30) | Sort Colors problem using counting and Dutch National Flag approaches |
| [day31](day31) | Majority Element problem using brute-force, hash map, and Moore's Voting Algorithm approaches |
| [day32](day32) | Binary search on sorted arrays and search insert position |
| [day33](day33) | Find first and last position of an element in a sorted array using brute-force and binary search |

More folders will be added as the 45-day training progresses.

## How Students Should Use This Repo

1. Open the folder for the day you want to revise.
2. Read the code and understand the logic.
3. Compile and run the program on your system.
4. Modify the code with your own inputs and variations.
5. Practice similar problems without looking at the solution first.

## Build And Run

Install a C++ compiler such as `g++` through MinGW, WSL, or another C++ development environment.

Compile and run a single file:

```powershell
g++ -std=c++17 -O2 -Wall Day1/arithmetic.cpp -o arithmetic.exe
.\arithmetic.exe
```

Another example:

```powershell
g++ -std=c++17 -O2 -Wall Day3/palindrome.cpp -o palindrome.exe
.\palindrome.exe
```

## Course Summary

- Program: TrailX DSA Training
- Duration: 45 days
- Daily class time: 4 hours
- Students: 30
- Language used: C++
- Focus: C++ fundamentals, problem solving, data structures, algorithms, and STL

DSA-TRAINING

Explore Similar Repositories

Was this content helpful?

Recent Feedback

Download README