Coding & Skills
391 articles in this topic
Hashing and collision resolution: hash functions, chaining and open addressing
Hashing and collision resolution explained: hash functions, load factor, separate chaining, and open addressing with linear, quadratic and double hashing.
Updated 16 Jul 20266 min readDSA & Algorithms
Stacks and queues: operations, applications and the exam angle
Stacks and queues explained: LIFO vs FIFO, array and linked implementations, a worked postfix evaluation, and the circular-queue full and empty conditions.
Updated 16 Jul 20266 min readDSA & Algorithms
Graph Theory: Euler and Hamiltonian Paths, Coloring and Connectivity
Graph theory for GATE CS: degree and handshaking, Euler vs Hamiltonian paths, planarity and Euler's formula, chromatic number, trees and spanning trees.
Updated 15 Jul 20266 min readDSA & Algorithms
Dynamic Programming Explained: optimal substructure and a worked knapsack
Dynamic programming explained: optimal substructure, overlapping subproblems, memoization vs tabulation, and a fully worked 0/1 knapsack DP table example.
Updated 14 Jul 20265 min readDSA & Algorithms
Sorting Algorithms Compared: complexity, stability, and the n log n lower bound
Sorting algorithms compared: bubble, insertion, selection, merge, quick and heap sort with best, average and worst time, stability, and the n log n bound.
Updated 14 Jul 20266 min read255 viewsDSA & Algorithms
Graph Algorithms: BFS, DFS, and shortest paths worked out
Graph algorithms explained: adjacency matrix vs list, BFS and DFS traversal order, edge classification, topological sort, and Dijkstra shortest paths.
Updated 26 Jul 20265 min read50 viewsDSA & Algorithms
Binary trees and binary search trees: traversals, operations, and the exam angle
Binary trees and binary search trees: terminology, all four traversals worked on a tree, BST insert, search and delete, balance, plus the exam angle.
Updated 25 Jul 20266 min readDSA & Algorithms