Practical learning · 9 projects
Data Structures and Algorithms (DSA) for interviews: projects and labs
Learn by doing: labs for each module, a project for each level, a capstone and a project exam. Every step is checked, and your work stays on this device.
Beginner
- Lab1.5 h · 4 stepsLab: searching a kirana price listLook up items in a kirana shop's price list two ways, count how many checks each way makes, and see Big-O with your own numbers. Then catch double-scanned items in O(n) with a set.Not started
- Lab1.5 h · 4 stepsLab: a mall's footfall dashboard in JavaScriptA mall in Pune counts visitors at its gates every hour. Answer the operations team's questions fast: visitors between any two hours (prefix sums), staff needed each hour from overlapping shifts (a difference array) and the best stretch of days against last year (Kadane).Not started
- Lab1.5 h · 4 stepsLab: cleaning a day of UPI paymentsA tiffin service gets UPI payment alerts all day, and some arrive twice. Find the repeated UTRs with a set, total each customer without double counting, match two payments to an amount with two pointers, and spot bursts of payments with a sliding window.Not started
- Lab2 h · 5 stepsLab: stacks, queues and linked lists for a train-booking siteBuild four small tools for a train-booking website: a bracket checker for GST invoice templates (a stack), back and forward buttons (two stacks), a waitlist that confirms in order (a queue), and a train's coaches as a linked list that you reverse and split at the middle.Not started
- Project4 h · 6 stepsProject: an order desk for a cloud kitchen (JavaScript)Build the order desk for a Hyderabad cloud kitchen in JavaScript: drop repeated orders, count dishes, queue orders for the kitchen, find the busiest stretch of minutes, warn how long until a busier minute, and merge two riders' delivery times. Every function is O(n) or close to it.Not started
Expert
- Project7 h · 7 stepsProject: a Delhi Metro journey plannerBuild the engine behind a metro app on a simplified Delhi Metro map: the graph, the route with the fewest stops (BFS), the fastest route (Dijkstra), how many separate networks remain when links close (union-find), a station search box (a trie), change from a ticket machine (DP) and "did you mean" for typos (edit distance).Not started
- Capstone12 h · 10 stepsCapstone: a mini IRCTC journey and booking engineBuild the engine of a small train-booking site on a simplified Indian rail network: a station search box, the fewest-change and the fastest or cheapest journeys, region checks when routes close, a coach with confirmed berths and a waitlist, berths free between two stations, the most booked routes, seating groups together, and one function that plans a trip from what a passenger types.Not started
- Project exam1.5 h · 7 tasksProject exam: a timed coding roundIn 90 minutes, solve seven problems like a campus placement online test: hashing, a stack, a sliding window, a binary search tree, binary search on the answer, topological sort and dynamic programming. Every problem is checked with normal cases, edge cases and a large input.Not taken