Repository navigation

DSA

Public

About

No description, website, or topics provided.

1 star

0 watching

Report repository

Name		Name	Last commit message	Last commit date
*Nesting Question STL		*Nesting Question STL
ARRAY : BASIC TO ADVANCED		ARRAY : BASIC TO ADVANCED
BASIC DSA		BASIC DSA
Binary Search ( basic to advanced)		Binary Search ( basic to advanced)
Bit Manipulation BASIC TO ADVANCED		Bit Manipulation BASIC TO ADVANCED
DP : Count Ways To Reach The N-th Stairs		DP : Count Ways To Reach The N-th Stairs
DP : Fibonacci Number		DP : Fibonacci Number
DP BASIC TO ADVANCED		DP BASIC TO ADVANCED
DP striver bhaiya		DP striver bhaiya
GRAPG : Shortest path in DAG		GRAPG : Shortest path in DAG
GRAPH : Detect Cycle In A Directed Graph (BFS Method )		GRAPH : Detect Cycle In A Directed Graph (BFS Method )
GRAPH : Dijkstra's shortest path		GRAPH : Dijkstra's shortest path
GRAPH : Adjacency List		GRAPH : Adjacency List
GRAPH : Cycle Detection Undirected graph using bfs and dfs		GRAPH : Cycle Detection Undirected graph using bfs and dfs
GRAPH : Detect cycle in Directed graph		GRAPH : Detect cycle in Directed graph
GRAPH : Prim's MST (****)		GRAPH : Prim's MST (****)
GRAPH : Topological Sort in Directed graph		GRAPH : Topological Sort in Directed graph
GRAPH: Topological Sort KAHN'S ALGO(BFS)		GRAPH: Topological Sort KAHN'S ALGO(BFS)
GRAPH: BFS traversal		GRAPH: BFS traversal
GRAPH: Creating and printing (adjacency list		GRAPH: Creating and printing (adjacency list
GRAPH: DFS traversal		GRAPH: DFS traversal
GRAPH: Shortest path in an unweighted graph		GRAPH: Shortest path in an unweighted graph
Insertion Sort		Insertion Sort
LINKED LIST : Sort linked list		LINKED LIST : Sort linked list
LINKED LIST : Palindrome Linked List		LINKED LIST : Palindrome Linked List
LINKED LIST BASIC TO ADVANCED		LINKED LIST BASIC TO ADVANCED
Linked List : Swapping Nodes in a Linked List		Linked List : Swapping Nodes in a Linked List
Linked List : Reverse Linked List II (Reverse in between )		Linked List : Reverse Linked List II (Reverse in between )
Linked List : Split Linked List in Parts (very important )		Linked List : Split Linked List in Parts (very important )
POTD		POTD
Placement preparation		Placement preparation
Queue : Deque implementation.		Queue : Deque implementation.
Queue : First non-repeating character in a stream		Queue : First non-repeating character in a stream
Queue : Queue implementation		Queue : Queue implementation
Queue : Reverse a Queue		Queue : Reverse a Queue
Queue: First Negative In Every Window		Queue: First Negative In Every Window
Queue: Reverse First K elements of Queue		Queue: Reverse First K elements of Queue
Queue: circular Queue implementation		Queue: circular Queue implementation
README.md		README.md
Recursion		Recursion
Recursion basic to advanced		Recursion basic to advanced
STL : Deque		STL : Deque
STL Iterator		STL Iterator
STL Map		STL Map
STL SET		STL SET
STL multiset		STL multiset
STL pair		STL pair
STRING BASIC TO ADVANCED		STRING BASIC TO ADVANCED
Sorting Selectionsort		Sorting Selectionsort
Stack : Delete middle element from the stack		Stack : Delete middle element from the stack
Stack: Celebrity Problem		Stack: Celebrity Problem
Stack: Design a stack that supports getMin() in O(1) time and O(1) extra space		Stack: Design a stack that supports getMin() in O(1) time and O(1) extra space
Stack: Find Redundant		Stack: Find Redundant
Stack: Find minimum cost to make string valid		Stack: Find minimum cost to make string valid
Stack: Insert element at the bottom of stack		Stack: Insert element at the bottom of stack
Stack: Largest Rectangle Area Histograms		Stack: Largest Rectangle Area Histograms
Stack: Max Rectangle in given binary matrix		Stack: Max Rectangle in given binary matrix
Stack: Reverse a stack		Stack: Reverse a stack
Stack: Sort a stack		Stack: Sort a stack
Stack: Two stack in an array		Stack: Two stack in an array
Stack: find next smaller element O(n)		Stack: find next smaller element O(n)
Stack: stack implementation.		Stack: stack implementation.
Stack: valid parentheses Stack		Stack: valid parentheses Stack
TREE basic to advanced revision		TREE basic to advanced revision
TWO POINTER AND SLIDING WINDOW basic to advanced		TWO POINTER AND SLIDING WINDOW basic to advanced
Tree : Check for Identical		Tree : Check for Identical
Tree : Construct Binary tree From Inorder and Preorder Traversal		Tree : Construct Binary tree From Inorder and Preorder Traversal
Tree : Flatten Binary Tree to Linked List		Tree : Flatten Binary Tree to Linked List
Tree : Inorder Traversal Morris		Tree : Inorder Traversal Morris
Tree : Kth ancestor of a node in binary tree		Tree : Kth ancestor of a node in binary tree
Tree : Preorder traversal (Iterative)		Tree : Preorder traversal (Iterative)
Tree : Same tree (using recursion )		Tree : Same tree (using recursion )
Tree : Top view of binary tree		Tree : Top view of binary tree
Tree : Vertical Traversal of Binary Tree		Tree : Vertical Traversal of Binary Tree
Tree : check balance or not		Tree : check balance or not
Tree : lowest common ancestor (LCS)		Tree : lowest common ancestor (LCS)
Tree : maximum sum of tree from node to leaf		Tree : maximum sum of tree from node to leaf
Tree : zig zag traversal in BT		Tree : zig zag traversal in BT
Tree- BST : creating BST from basic		Tree- BST : creating BST from basic
Tree-BST : Flatten BST To A Sorted List		Tree-BST : Flatten BST To A Sorted List
Tree-BST : Kth Smallest Element in a BST		Tree-BST : Kth Smallest Element in a BST
Tree-BST : Lowest Common Ancestor of a Binary Search Tree		Tree-BST : Lowest Common Ancestor of a Binary Search Tree
Tree-BST : Merge Two BSTs		Tree-BST : Merge Two BSTs
Tree-BST : Predecessor and Successor		Tree-BST : Predecessor and Successor
Tree-BST : Search in a Binary Search Tree		Tree-BST : Search in a Binary Search Tree
Tree-BST : convert Tree To sorted DLL		Tree-BST : convert Tree To sorted DLL
Tree-BST : min element and maximum element		Tree-BST : min element and maximum element
Tree-BST : valid BST		Tree-BST : valid BST
Tree-BST: Two Sum IV - Input is a BST		Tree-BST: Two Sum IV - Input is a BST
Tree-BST: Insert into a Binary Search Tree		Tree-BST: Insert into a Binary Search Tree
Tree-BST:Balance a Binary Search Tree		Tree-BST:Balance a Binary Search Tree
Tree-BST:Construct Binary Search Tree from Preorder Traversal		Tree-BST:Construct Binary Search Tree from Preorder Traversal
Tree: Symmetric Tree		Tree: Symmetric Tree
Tree: Building and traversal		Tree: Building and traversal
Tree: Building tree form level order input		Tree: Building tree form level order input
Tree: Diameter of the Tree		Tree: Diameter of the Tree
Tree: Height of the Tree		Tree: Height of the Tree
Tree: Left view and right viewof Tree		Tree: Left view and right viewof Tree
Tree: Maximum Sum of nodes in Binary tree such that no two are adjacent		Tree: Maximum Sum of nodes in Binary tree such that no two are adjacent
Tree: Sum of longest bloodline of a tree		Tree: Sum of longest bloodline of a tree

Repository files navigation

DSA

About

No description, website, or topics provided.

1 star

0 watching

Report repository

Releases

Packages

Contributors