Graph
A Graph is a non-linear data structure consisting of nodes and edges. The nodes are sometimes also referred to as vertices and the edges are lines or arcs that connect any two nodes in the graph. More formally a Graph can be defined as, A Graph consisting of a finite set of vertices(or nodes) and a set of edges that connect a pair of nodes.
Apart from definitions there are other important topics on Graph that you must prepare/revise before the technical Coding round, such as:
Some important Graph Algorithm:
Along with these, below are a list of must-do problems on Graph for this DSA Crash Course:
Question | Practice |
---|---|
BFS of Graph | Link |
DFS of Graph | Link |
Number of Provinces | Link |
Find the number of islands | Link |
Detect cycle in an undirected graph | Link |
Topological Sort | Link |
Course Schedule | Link |
Bipartite Graph | Link |
Rotten Oranges | Link |
Flood Fill Algorithm | Link |
Apart from these, there are other interview questions on Array that you should know about.
Top Interview Coding Question
DSA Crash Course | Revision Checklist with Interview Guide
Prepare for your upcoming interview with confidence using our comprehensive DSA Revision Checklist Crash Course. This DSA Crash Course not only helps you brush up on key DSA topics but also includes valuable insights for acing technical interviews. Elevate your technical skills and enhance your interview performance with this essential DSA Crash Course.
This comprehensive resource offers a meticulous review of crucial Data Structures and Algorithms concepts, serving as the perfect pre-interview refresher. From fundamental data structures to advanced algorithms, this DSA Revision Checklist ensures you’re well-prepared for the technical challenges that lie ahead.
Below are the topics we will be covering in this article:
Table of Content
- 1. Array
- 2. String
- 3. LinkedList
- 4. Stack
- 5. Queue
- 6. Tree
- 7. Binary Search Tree
- 8. Graph
- 9. Trie
- 10. Heap
- 11. Hash
- 12. Recursion
- 13. Backtracking
- 14. Dynamic Programming
- 15. Greedy Algorithms
- 16. Sorting and Searching
- 17. Pattern Searching
- 18. Divide and Conquer Algorithms
- 19. Number Theory
- 20. Bit Manipulation