Skip to content

Anubhav099/Strivers-SDE-Sheet-Challenge

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

177 Commits
Bellman-Ford Algorithm.java
Bellman-Ford Algorithm.java
 
 
CN All Root to Leaf Paths In Binary Tree.java
CN All Root to Leaf Paths In Binary Tree.java
 
 
CN Array partition with minimum difference.java
CN Array partition with minimum difference.java
 
 
CN Bottom View Of Binary Tree - iterative.java
CN Bottom View Of Binary Tree - iterative.java
 
 
CN Bottom View Of Binary Tree - recursion.java
CN Bottom View Of Binary Tree - recursion.java
 
 
CN Ceil from BST.java
CN Ceil from BST.java
 
 
CN Count Inversions.txt
CN Count Inversions.txt
 
 
CN Count Subsets with Sum K.java
CN Count Subsets with Sum K.java
 
 
CN Find Nth Root Of M.java
CN Find Nth Root Of M.java
 
 
CN Floor in BST.java
CN Floor in BST.java
 
 
CN Frog Jump.java
CN Frog Jump.java
 
 
CN Implement Queue using Arrays.java
CN Implement Queue using Arrays.java
 
 
CN Implement a priority queue.java
CN Implement a priority queue.java
 
 
CN Left View Of a Binary Tree - iterative.java
CN Left View Of a Binary Tree - iterative.java
 
 
CN Left View Of a Binary Tree - recursion.java
CN Left View Of a Binary Tree - recursion.java
 
 
CN Median in a row-wise sorted Matrix.txt
CN Median in a row-wise sorted Matrix.txt
 
 
CN Merge K Sorted Arrays - heap.java
CN Merge K Sorted Arrays - heap.java
 
 
CN Min Heap - heap.java
CN Min Heap - heap.java
 
 
CN Min Heap Implementation.java
CN Min Heap Implementation.java
 
 
CN Minimal Cost.java
CN Minimal Cost.java
 
 
CN Minimum Elements.java
CN Minimum Elements.java
 
 
CN Missing And Repeating Numbers.txt
CN Missing And Repeating Numbers.txt
 
 
CN Ninja’s Training.java
CN Ninja’s Training.java
 
 
CN Partitions With Given Difference.java
CN Partitions With Given Difference.java
 
 
CN Rod cutting problem.java
CN Rod cutting problem.java
 
 
CN Stack Implementation Using Array.java
CN Stack Implementation Using Array.java
 
 
CN Subset Sum Equal To K.java
CN Subset Sum Equal To K.java
 
 
CN Top View Of Binary Tree.java
CN Top View Of Binary Tree.java
 
 
CN Tree Traversals (in, pre, post combined) - iterative.java
CN Tree Traversals (in, pre, post combined) - iterative.java
 
 
CN Tree Traversals (in, pre, post combined) - recursion.java
CN Tree Traversals (in, pre, post combined) - recursion.java
 
 
CN Unbounded Knapsack.java
CN Unbounded Knapsack.java
 
 
DFS of Graph using Stack.java
DFS of Graph using Stack.java
 
 
Dijkstra Algorithm.java
Dijkstra Algorithm.java
 
 
Floyd Warshall.java
Floyd Warshall.java
 
 
GFG 0 - 1 Knapsack Problem.java
GFG 0 - 1 Knapsack Problem.java
 
 
GFG BFS of graph.java
GFG BFS of graph.java
 
 
GFG Boundary Traversal of binary tree.java
GFG Boundary Traversal of binary tree.java
 
 
GFG DFS of Graph.java
GFG DFS of Graph.java
 
 
GFG Detect cycle in a directed graph.java
GFG Detect cycle in a directed graph.java
 
 
GFG Detect cycle in an undirected graph.java
GFG Detect cycle in an undirected graph.java
 
 
GFG Flattening a Linked List.txt
GFG Flattening a Linked List.txt
 
 
GFG Fractional Knapsack.txt
GFG Fractional Knapsack.txt
 
 
GFG Job Sequencing Problem.txt
GFG Job Sequencing Problem.txt
 
 
GFG Kth largest element in BST.java
GFG Kth largest element in BST.java
 
 
GFG Minimize the Heights II.java
GFG Minimize the Heights II.java
 
 
GFG Minimum Platforms.txt
GFG Minimum Platforms.txt
 
 
GFG Minimum number of Coins.txt
GFG Minimum number of Coins.txt
 
 
GFG Mirror Tree.java
GFG Mirror Tree.java
 
 
GFG N meetings in one room.txt
GFG N meetings in one room.txt
 
 
GFG Number Of Enclaves.java
GFG Number Of Enclaves.java
 
 
GFG Predecessor and Successor.java
GFG Predecessor and Successor.java
 
 
GFG Rat in a Maze Problem - I.txt
GFG Rat in a Maze Problem - I.txt
 
 
GFG Shortest Path in Weighted undirected graph.java
GFG Shortest Path in Weighted undirected graph.java
 
 
GFG Subset Sums - brute.txt
GFG Subset Sums - brute.txt
 
 
GFG Subset Sums - optimal.txt
GFG Subset Sums - optimal.txt
 
 
GFG Topological sort.java
GFG Topological sort.java
 
 
InterviewBit Maximum Sum Combinations.java
InterviewBit Maximum Sum Combinations.java
 
 
KosaRaju's Algo.java
KosaRaju's Algo.java
 
 
Kruskal's Algo - Disjoint Set.java
Kruskal's Algo - Disjoint Set.java
 
 
LC 100. Same Tree.java
LC 100. Same Tree.java
 
 
LC 1008. Construct Binary Search Tree from Preorder Traversal.java
LC 1008. Construct Binary Search Tree from Preorder Traversal.java
 
 
LC 101. Symmetric Tree.java
LC 101. Symmetric Tree.java
 
 
LC 102. Binary Tree Level Order Traversal - iterative.java
LC 102. Binary Tree Level Order Traversal - iterative.java
 
 
LC 102. Binary Tree Level Order Traversal - recursion.java
LC 102. Binary Tree Level Order Traversal - recursion.java
 
 
LC 103. Binary Tree Zigzag Level Order Traversal.java
LC 103. Binary Tree Zigzag Level Order Traversal.java
 
 
LC 104. Maximum Depth of Binary Tree.java
LC 104. Maximum Depth of Binary Tree.java
 
 
LC 105. Construct Binary Tree from Preorder and Inorder Traversal.java
LC 105. Construct Binary Tree from Preorder and Inorder Traversal.java
 
 
LC 108. Convert Sorted Array to Binary Search Tree.java
LC 108. Convert Sorted Array to Binary Search Tree.java
 
 
LC 110. Balanced Binary Tree.java
LC 110. Balanced Binary Tree.java
 
 
LC 114. Flatten Binary Tree to Linked List.java
LC 114. Flatten Binary Tree to Linked List.java
 
 
LC 1143. Longest Common Subsequence.java
LC 1143. Longest Common Subsequence.java
 
 
LC 116. Populating Next Right Pointers in Each Node.java
LC 116. Populating Next Right Pointers in Each Node.java
 
 
LC 120. Triangle.java
LC 120. Triangle.java
 
 
LC 13. Roman to Integer.java
LC 13. Roman to Integer.java
 
 
LC 131. Palindrome Partitioning - brute.txt
LC 131. Palindrome Partitioning - brute.txt
 
 
LC 131. Palindrome Partitioning - optimal.txt
LC 131. Palindrome Partitioning - optimal.txt
 
 
LC 133. Clone Graph.java
LC 133. Clone Graph.java
 
 
LC 138. Copy List with Random Pointer - brute.txt
LC 138. Copy List with Random Pointer - brute.txt
 
 
LC 138. Copy List with Random Pointer - optimal.txt
LC 138. Copy List with Random Pointer - optimal.txt
 
 
LC 14. Longest Common Prefix.java
LC 14. Longest Common Prefix.java
 
 
LC 141. Linked List Cycle.txt
LC 141. Linked List Cycle.txt
 
 
LC 142. Linked List Cycle II.txt
LC 142. Linked List Cycle II.txt
 
 
LC 144. Binary Tree Preorder Traversal - Morris.java
LC 144. Binary Tree Preorder Traversal - Morris.java
 
 
LC 144. Binary Tree Preorder Traversal - iterative.java
LC 144. Binary Tree Preorder Traversal - iterative.java
 
 
LC 144. Binary Tree Preorder Traversal.java
LC 144. Binary Tree Preorder Traversal.java
 
 
LC 145. Binary Tree Postorder Traversal - Morris.java
LC 145. Binary Tree Postorder Traversal - Morris.java
 
 
LC 145. Binary Tree Postorder Traversal - iterative.java
LC 145. Binary Tree Postorder Traversal - iterative.java
 
 
LC 145. Binary Tree Postorder Traversal.java
LC 145. Binary Tree Postorder Traversal.java
 
 
LC 146. LRU Cache.java
LC 146. LRU Cache.java
 
 
LC 151. Reverse Words in a String - brute.java
LC 151. Reverse Words in a String - brute.java
 
 
LC 152. Maximum Product Subarray.java
LC 152. Maximum Product Subarray.java
 
 
LC 160. Intersection of Two Linked Lists - better.txt
LC 160. Intersection of Two Linked Lists - better.txt
 
 
LC 160. Intersection of Two Linked Lists - brute.txt
LC 160. Intersection of Two Linked Lists - brute.txt
 
 
LC 160. Intersection of Two Linked Lists - optimal.txt
LC 160. Intersection of Two Linked Lists - optimal.txt
 
 
LC 169. Majority Element.txt
LC 169. Majority Element.txt
 
 
LC 173. Binary Search Tree Iterator.java
LC 173. Binary Search Tree Iterator.java
 
 
LC 19. Remove Nth Node From End of List - brute.txt
LC 19. Remove Nth Node From End of List - brute.txt
 
 
LC 19. Remove Nth Node From End of List - optimal.txt
LC 19. Remove Nth Node From End of List - optimal.txt
 
 
LC 198. House Robber.java
LC 198. House Robber.java
 
 
LC 1985. Find the Kth Largest Integer in the Array.java
LC 1985. Find the Kth Largest Integer in the Array.java
 
 

Repository files navigation

About

This repository was made to store all the solution to the problems in the Striver's DSA Sheet. Link: https://takeuforward.org/interviews/strivers-sde-sheet-top-coding-interview-problems/

Resources

Readme
Activity

Stars

0 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages