7️⃣5️⃣ Data Structures and Algorithms (DSA) questions
You should be able to master all these in coming days through the upcoming DSA series.
🧵 👇
1️⃣ Algorithms Basics
1️⃣ What is an algorithm?
2️⃣ How to approach to solve a problem?
3️⃣ What is time complexity? How to measure it?
4️⃣ What is space complexity? How to measure it?
2️⃣ Data Structure Basics
5️⃣ What are types of data structures?
6️⃣ What are some mostly used data structure operations?
7️⃣ What is traversal?
8️⃣ How to insert an element?
9️⃣ How to delete an element?
1️⃣0️⃣ How to get an element?
1️⃣1️⃣ How to update an element?
3️⃣ Array
1️⃣2️⃣ What is an Array?
1️⃣3️⃣ What is a multi dimensional Array?
1️⃣4️⃣ What are mostly used operations on Array?
1️⃣5️⃣ What are time complexity and space complexity of all Array operations?
1️⃣6️⃣ How to reverse an Array?
4️⃣ Linked List
1️⃣7️⃣ What is a Linked List?
1️⃣8️⃣ Where to use Linked List over an Array and vice versa?
1️⃣9️⃣ What is a Node?
2️⃣0️⃣ What is a Pointer?
2️⃣1️⃣ What is a Double Linked List?
2️⃣2️⃣ What is a Circular Linked List?
++
2️⃣3️⃣ What are time and space complexity of Linked List operations?
2️⃣4️⃣ How to traverse through a linked list?
2️⃣5️⃣ How to reverse a linked list?
2️⃣6️⃣ How to check if a cycle of nodes is formed?
5️⃣ Stack & Queue
2️⃣7️⃣ What is a Stack?
2️⃣8️⃣ What is a Queue?
2️⃣9️⃣ What operations a Stack and Queue provide?
3️⃣0️⃣ What is the difference between a Stack and a Queue?
3️⃣1️⃣ Where to choose a Stack over a Queue and vice versa?
3️⃣2️⃣ What is a Dequeue?
3️⃣3️⃣ What is a priority Queue?
6️⃣ Hash Table
3️⃣4️⃣ What is a Hash Table?
3️⃣5️⃣ What are Keys and Values in a Hash Table?
3️⃣6️⃣ What is a Hashing Function?
3️⃣7️⃣ What are different Hashing Functions available?
3️⃣8️⃣ What is a hash collision?
3️⃣9️⃣ What are different techniques used to avoid/resolve a hash collision?
7️⃣ Tree
4️⃣0️⃣ What is a Tree?
4️⃣1️⃣ What are Binary Trees?
4️⃣2️⃣ What is a node in a Tree?
4️⃣3️⃣ What is the height of a Tree/Node?
4️⃣4️⃣ What is the depth of a Node?
4️⃣5️⃣ What is degree of a Node?
4️⃣6️⃣ What is the maximum number of nodes in a k-height binary tree?
++
4️⃣7️⃣ What are different tree traversal techniques?
4️⃣8️⃣ Print Left/Right View of any Binary Tree.
4️⃣9️⃣ What is a Binary Search Tree?
5️⃣0️⃣ What is an AVL Tree?
5️⃣1️⃣ What is a B-Tree?
5️⃣2️⃣ What is a B+ Tree?
5️⃣3️⃣ What is a Red Black Tree?
5️⃣4️⃣ What is a Trie?
8️⃣ Heap
5️⃣5️⃣What is a Heap?
5️⃣6️⃣What is a Max Heap and, Min Heap?
5️⃣7️⃣What is Heapify operation?
5️⃣8️⃣How to pick a max/min element from a Heap?
5️⃣9️⃣How to extract a max/min element from a Heap?
6️⃣0️⃣What is the difference between pick and extract?
6️⃣1️⃣What is a Fibonacci Heap?
9️⃣ Graph
6️⃣2️⃣ What is a Graph Data Structure?
6️⃣3️⃣ How to represent a graph?
6️⃣4️⃣ What is Adjacency List and, Adjacency Matrix?
6️⃣5️⃣ What is difference between Tree and Graph?
6️⃣6️⃣ What is Breadth First Search and Depth First Search?
++
6️⃣7️⃣ What is the difference between BFS and DFS?
6️⃣8️⃣ Where to use BFS over DFS and vice versa?
6️⃣9️⃣ What is a topological sorting in a Graph?
1️⃣0️⃣ Sorting
7️⃣0️⃣ How to approach a Sorting?
7️⃣1️⃣ What are some known sorting techniques?
7️⃣2️⃣ Provide Time and space complexity of different sorting techniques.
1️⃣1️⃣ Searching
7️⃣3️⃣ What is Linear Searching?
7️⃣4️⃣ What is Binary Searching?
7️⃣5️⃣ What is time and space complexity of search techniques?
This thread is a precursor to the upcoming DSA series. 👇 thread lists all the topics that will be covered through this series.