.png)
DSA Examples: A-Z Guide
This A-Z guide provides a quick-reference overview of essential Data Structures and Algorithms concepts, each with a short explanation to help you navigate the subject.
| Term | Brief Explanation |
|---|---|
| Array | A fixed-size, contiguous collection of elements accessed by index. |
| BFS (Breadth First Search) | Graph traversal exploring neighbors level by level using a queue. |
| Complexity (Big-O) | A notation to describe how an algorithm's time/space scales with input size. |
| DFS (Depth First Search) | Graph traversal exploring as deep as possible before backtracking. |
| Edge | A connection between two vertices in a graph. |
| Fibonacci Sequence | A classic recursion/DP example where each number is the sum of the two before it. |
| Graph | A set of vertices connected by edges. |
| Hashing | Mapping data to fixed-size values (hashes) for fast lookup. |
| Insertion Sort | A simple sorting algorithm that builds the sorted array one item at a time. |
| Junction (Fork) in Recursion | A branching point where recursive calls split, as in divide-and-conquer. |
| Knapsack Problem | An optimization problem to maximize value under a weight constraint. |
| Linked List | A sequence of nodes where each node points to the next. |
| Merge Sort | A stable, divide-and-conquer sorting algorithm running in O(n log n). |
| Node | A basic unit in trees, graphs, and linked lists holding data and references. |
| Optimal Substructure | A property where a problem's optimal solution is built from optimal solutions of subproblems. |
| Priority Queue | An abstract data type where elements are served based on priority. |
| Queue | A FIFO linear structure. |
| Recursion | A function calling itself to solve smaller instances of a problem. |
| Stack | A LIFO linear structure. |
| Tree | A hierarchical structure with a root and child nodes, no cycles. |
| Union-Find (Disjoint Set) | A structure to track a partition of elements into disjoint sets. |
| Vertex | A node in a graph. |
| Weighted Graph | A graph where edges carry numeric weights/costs. |
| XOR Trick | Using the XOR operator to solve problems like finding a unique element. |
| Yield (Generators) | A way to produce values lazily, often used in traversal algorithms. |
| Zero-One BFS | A variant of BFS used for graphs with edge weights of only 0 or 1. |
Ready to master Data Structures & Algorithms?
Learn DSA hands-on with mentor-led sessions, real interview practice, and placement support.