Dsa Tutorial
Learn Dsa interactively. Read the concept and write code to practice.
1. What is DSA?
DSA stands for Data Structures and Algorithms. - **Data Structure**: A way to o...
2. Time Complexity (Big O)
Time Complexity is the amount of time taken by an algorithm to run, as a functio...
3. Space Complexity
Space Complexity is the amount of memory space required by the algorithm in its ...
4. Arrays
An Array is a linear data structure that stores a collection of elements in cont...
5. Linked Lists
A Linked List is a linear data structure where elements (nodes) are not stored i...
6. Stacks
A Stack is a linear data structure that follows the LIFO (Last In, First Out) pr...
7. Queues
A Queue is a linear data structure that follows the FIFO (First In, First Out) p...
8. Hash Tables
A Hash Table (or Hash Map) is a data structure that implements an associative ar...
9. Trees (Binary Trees)
A Tree is a hierarchical data structure consisting of nodes connected by edges. ...
10. Binary Search Tree (BST)
A Binary Search Tree (BST) is a special type of binary tree. BST Property: - Th...
11. Linear Search
Linear Search is the simplest searching algorithm. It sequentially checks each ...
12. Binary Search
Binary Search is an efficient searching algorithm for **sorted** arrays. It wor...
13. Bubble Sort
Bubble Sort is a simple sorting algorithm. It works by repeatedly stepping thro...
14. Recursion
Recursion is a method where the solution to a problem depends on solutions to sm...
15. Graphs Introduction
A Graph is a non-linear data structure consisting of Nodes (also called vertices...