DSA & Algorithms
38 articles in this topic
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.
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.
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.
Big-O Complexity of Python Operations: What list, dict and set Really Cost
A compact guide to the real cost of everyday Python container operations, with one duplicate-detection example that shows how a list can turn linear work into quadratic work.
MERN Stack Project Tutorial: Build an Exam-Prep App with Auth, CRUD, and Deployment
Build PrepTrack as a small but complete MERN project, with a protected answer flow, server-owned scoring, and a deployment you can explain in an interview.
Linked List Problems in Java: Reversal, Cycle Detection, and the Interview Classics Traced
Trace the pointers behind in-place reversal and Floyd's cycle algorithm, then reuse the same habits for other linked list interview problems.
HashMap and HashSet Problems in Java: Two Sum, Frequency Counting, and Deduplication Patterns
Learn when a hash lookup replaces a nested scan, then apply one reusable Java toolkit to pairs, counts, first-unique values, and duplicate detection.
Recursion in C: Stack Frames, a Hand-Tracing Method and Solved GATE Questions
Trace recursive C programs without guessing. Follow factorial returns, prints on descent and unwind, Fibonacci call counts, and maximum stack depth.
Planar Graphs and Euler's Formula for GATE: Planarity Checks, Matching and Vertex Covers Solved
Use Euler's formula and the correct planar edge bound on K4, K5 and K3,3. Then connect maximum matching to minimum vertex cover in a solved bipartite graph.
Linked List Questions for GATE: Pointer-Manipulation Patterns Solved Step by Step
Trace prev, curr and next through a complete reversal, then reuse the same discipline for middle-finding, cycle detection and safe deletion.
Left Recursion Elimination and Left Factoring for GATE: Grammar Transformation Drills
Transform immediate and indirect left recursion without losing epsilon, then left-factor a dangling-else grammar. Each change is traced and counted.
Basic Blocks, Flow Graphs and DAG Construction for GATE: Code Optimization Numericals
Partition three-address code by the leader rules, draw its control-flow graph, and construct a basic-block DAG without losing shared expressions or edges.