Complete A2Z Reference for DSA Concepts Last Updated : 23 Jul, 2025 Comments Improve Suggest changes Like Article Like Report The A to Z DSA Concepts encompasses an array of fundamental techniques in Data Structures and Algorithms. From "Array" to "Zigzag Traversal," these concepts equip programmers with essential tools to solve a wide range of challenges. Navigating through "Graphs," "Sorting Algorithms," "Dynamic Programming," and more, these concepts are the cornerstones of efficient coding and problem-solving. By mastering these concepts, programmers gain the ability to optimize code, craft elegant solutions, and tackle complex problems with confidence. In this post, we have curated and maintained a complete reference of DSA Concepts in alphabetical order from A to Z. Let us look into them one by one. 0-9 ◦ A ◦ B ◦ C ◦ D ◦ E ◦ F ◦ G ◦ H ◦ I ◦ J ◦ K ◦ L ◦ M ◦ N ◦ O ◦ P ◦ Q ◦ R ◦ S ◦ T ◦ U ◦ V ◦ W ◦ X ◦ Y ◦ Z DSA Concepts # 0/1 Knapsack 4 Queens 8 Queens A Array A* algorithm Adaptive and non-adaptive searching algorithm Advanced data structures Algorithm Angular Sweep AVL Tree B B-tree Backtracking Balanced binary tree Bellman-ford-algorithm Binary Search Binary Tree Binary Search Tree Binary Heap Bit manipulation Boyer-moore-algorithm Booth's multiplication algorithm Breadth-First Search (BFS) Bucket sort C Circular Array Circular Linked list Circular Queue Complete Binary tree Complete guide on Complexity analysis Convex Hull D Depth-First Search (DFS) Divide and Conquer Dijkstra's Algorithm Doubly Linked list Dynamic Arrays Dynamic Programming Dynamic Segment Tree E Exponential Search Expression Trees Extended Binary Trees External Sorting F Factorial of a number Fenwick Tree Floyd Warshall Algorithm Fibonacci Heap Full binary tree G Graphs Greedy Algorithms H Hash Table Hash Map Huffman Coding I Inorder Traversal Insertion sort Interval Tree Inversion Count Invert Binary tree J Jump Search Jagged arrays JASON array K Kadane's algorithm KMP algorithm Kruskal's Algorithm L Lazy Propagation in Segment Tree Linear Search Linked List Longest Common Subsequence LRU Cache M Merge Sort Matrix Chain multiplication Minimum Spanning Tree Multidimensional Arrays N N-ary Tree N-Queens Network Flow O Order Statistics Overlapping Subproblems P Postorder traversal-of-binary-tree/ Preorder traversal-of-binary-tree/ Priority Queue Prim's Algorithm Q Quick Sort Queue Quadtree R Rabin-Karp Algorithm Radix Sort Recursion Red-Black Tree Rubik's cube algorithm S Segment Tree Selection Sort Shortest Path Algorithms Singly linked list Sorting Algorithms Sparse Arrays Stack Strings Subset sum problem Sudoku problem T Topological Sorting Tree Traversal Trie Two pointer algorithm Two dimensional Segment tree Types of asymptotic notations in complexity analysis U Union-Find (Disjoint Set) V Vertex Cover W Warshall's Algorithm Weighted Graphs X XOR Linked List XOR trees Y Y shaped pattern Z Z-algorithm Zigzag Traversal Comment More infoAdvertise with us Next Article Strongly Connected Component meaning in DSA R RishabhPrabhu Follow Improve Article Tags : DSA Similar Reads Strongly Connected Component meaning in DSA Strongly Connected Component (SCC) is a concept in graph theory, specifically in directed graphs. A subgraph of a directed graph is considered to be an SCC if and only if for every pair of vertices A and B, there exists a path from A to B and a path from B to A. Example of Strongly Connected Compone 2 min read Connected component definition & meaning in DSA Connected component in an undirected graph refers to a group of vertices that are connected to each other through edges, but not connected to other vertices outside the group. For example in the graph shown below, {0, 1, 2} form a connected component and {3, 4} form another connected component. Exam 1 min read Number Theory for DSA & Competitive Programming What is Number Theory?Number theory is a branch of pure mathematics that deals with the properties and relationships of numbers, particularly integers. It explores the fundamental nature of numbers and their mathematical structures. Number theory has been studied for centuries and has deep connectio 3 min read Complete Roadmap To Learn DSA Mastering DSA enables developers to write optimized code that performs well even with large datasets. The very first step in the journey is the selection of a complete roadmap. This guide provides a structured path, starting from basic concepts to advanced topics. It offers practical steps, resource 5 min read Basic Coding Problems in DSA for Beginners For any beginner looking to strengthen their skills in Data structures and algorithms (DSA), we have brought to you a collection of basic coding problems. These carefully selected problems will provide a solid foundation in fundamental concepts, helping beginners enhance their logical thinking and p 2 min read 25 Interesting DSA Terms/Concepts Every Programmer Should Know Data Structures and Algorithms (DSA) form the backbone of computer science, playing a pivotal role in efficient problem-solving and software development. Here are 25 interesting Data Structures and Algorithms (DSA) terms/concepts that every programmer should know. Understanding these concepts is cru 7 min read Like