DSA & Algorithms
59 articles in this topic
Minimum Spanning Trees: Kruskal, Prim, Cut Property, and Worked Examples for GATE CS
Build MST intuition from first principles, trace Kruskal and Prim on the same graph, count tied MSTs, and avoid common GATE CS traps.
Updated 18 Sep 20266 min readDSA & Algorithms
Greedy Algorithms for GATE CS: Concepts, Worked Examples, and Where Greedy Fails
Learn when a greedy choice is provably correct, trace Kruskal step by step, and use numeric counterexamples to see why the same idea fails for coin change and 0/1 knapsack.
Updated 16 Sep 20266 min readDSA & Algorithms
Dynamic Programming in Algorithms: Complete Guide with Worked Examples for GATE and Interviews
Stop memorising DP solutions. Learn how to define states and recurrences, fill a complete 0/1 knapsack table, trace chosen items, and avoid common GATE and interview mistakes.
Updated 15 Sep 20265 min readDSA & Algorithms
Algorithm Analysis: Asymptotic Notation, Recurrences and Worked Examples for GATE CS
Build algorithm-analysis skill from first principles: count operations, compare growth rates, solve recurrences and understand amortized cost through checked examples.
Updated 13 Sep 20266 min readDSA & Algorithms
Advanced Algorithms for GATE CS: Greedy, DP and Graph Techniques with Worked Examples
Learn how to choose among greedy, dynamic programming, divide and conquer, and shortest-path algorithms. Worked MST, knapsack and recurrence examples make each decision concrete.
Updated 12 Sep 20266 min readDSA & Algorithms
Algorithms for GATE CS: Syllabus Areas, Weightage and How to Prepare
Understand what GATE CS Algorithms covers, how to judge its changing weightage, and how to prepare complexity, paradigms and graph algorithms in a useful order.
Updated 10 Sep 20264 min read55 viewsDSA & Algorithms
Circular Queue and Deque for GATE: The Full-Empty Condition Settled with a Worked Trace
Trace a size-5 circular queue through enqueue, dequeue, wraparound and rejection, then separate its pointer rules from the operations of a deque.
Updated 9 Sep 20266 min readDSA & Algorithms
Degree Sequences and Graph Isomorphism for GATE: Handshake Lemma and Havel-Hakimi Drills
Use the Handshake Lemma and Havel-Hakimi mechanically, then learn why matching degree sequences cannot by themselves prove graph isomorphism.
Updated 7 Sep 20266 min readDSA & Algorithms
Counting Spanning Trees for GATE: Cayley's Formula and Deletion-Contraction, Worked
Learn when Cayley's formula applies, how deletion-contraction handles a non-complete graph, and how a Laplacian cofactor checks the answer.
Updated 6 Sep 20266 min readDSA & Algorithms
MERN Stack Resume Projects: 5 Ideas That Get Shortlisted, With Feature Checklists
Choose one credible MERN project, give it production-style features, and present it with the live demo, README and interview answers recruiters can verify.
4 Sep 20265 min readDSA & Algorithms
MERN Stack Interview Questions: Full-Stack Scenarios Freshers Face in 2026
Prepare the connected MERN scenarios fresher interviews use, from React hooks and Express middleware to MongoDB modelling and a complete request trace.
Updated 3 Sep 20266 min readDSA & Algorithms
DSA in Python: heapq, collections and bisect for Coding Tests
Learn which Python built-in fits heaps, frequency maps, queues and sorted searches, with traced outputs and the complexity details hidden tests expose.
Updated 1 Sep 20265 min readDSA & Algorithms