DSA Bootcamp 2.0
DSA Bootcamp 2.0 was a comprehensive 3-day session designed to help students master essential data structures and algorithms. Organized by the CodeChef MIT-ADT Chapter, it featured live demos, real-world coding problems, and peer-to-peer mentorship from senior club members.
With over 130 enthusiastic participants, the sessions built a solid foundation for those preparing for placements and competitive programming.
Topics Covered (With Explanations & References)
- Time & Space Complexity: Big O, Omega, Theta analysis. [Learn More]
- Arrays & Strings: Traversal, sliding window, two pointers. [Learn More]
- Linked Lists: Single, double, circular, reversal. [Learn More]
- Stacks & Queues: Using arrays/linked lists, applications. [Learn More]
- Recursion & Backtracking: Combinations, subsets, sudoku solver. [Learn More]
- Sorting Algorithms: Merge, Quick, Heap sort. [Learn More]
- Binary Search: Standard problems and variations. [Learn More]
- Trees: Binary Trees, BST, traversal techniques. [Learn More]
- Graphs: BFS, DFS, adjacency list, shortest path. [Learn More]
- Dynamic Programming: Tabulation, memoization techniques. [Learn More]
- Greedy Algorithms: Activity selection, coin change. [Learn More]
- Practice Problems: From LeetCode, CodeChef, and HackerRank. [Practice]
Speakers & Mentors
- Swarnadeep Barik - Vice President, taught Linked Lists, Trees & DP.
- Nikhil Parbat - Technical Lead, handled Graphs, Stacks & Queues.
- Kartikeyan Anand - President, taught Sorting, Searching & Complexity Analysis.
- Reet Kaur Nahal - Secretary, taught Recursion & Backtracking.
- Guest Mentor: Abhay Babbar (SDE @ Lattice Semi) gave a session on competitive problem-solving with Greedy & DP.
Photo Gallery
Photos from the bootcamp will be added here soon.
The event concluded with a coding contest and leaderboard presentation. Participants earned certificates and prizes for top scores!
DSA Bootcamp 2.0 was a perfect blend of theory and practice—enhancing logical thinking and building problem-solving habits.