GitHub - SagarChau750/Strivers-SDE-Sheet-Challenge: This document presents the Striver SDE Sheet, designed to facilitate DSA (Data Structures and Algorithms) practice and learning. It provides comprehensive solutions for each question, allowing for subsequent review and efficient revision in preparation for interviews or technical assessments.

Striver SDE Sheet : Welcome to the Striver SDE Sheet repository! This repository contains a comprehensive collection of problem-wise solutions for the Striver SDE (Software Development Engineer) Sheet, a popular resource for DSA (Data Structures and Algorithms) practice and learning.

About the Striver SDE Sheet : The Striver SDE Sheet is a curated set of questions aimed at helping individuals improve their DSA skills. It covers a wide range of topics and problem-solving techniques commonly encountered in technical interviews for software engineering roles. Whether you are a beginner looking to strengthen your foundations or an experienced professional aiming to enhance your problem-solving abilities, this sheet provides a structured approach to DSA practice.

Repository Structure : The repository is organized according to the problem-wise solutions for the Striver SDE Sheet. Each problem is solved and documented in its own file, providing a clear explanation of the approach, algorithm, and implementation. The solutions are implemented in various programming languages, ensuring flexibility for users with different language preferences.

How to Use : To benefit from this repository and the Striver SDE Sheet, follow these steps:

Clone the repository to your local machine using the command: git clone https://github.com/SagarChau750/Strivers-SDE-Sheet-Challenge/tree/main
Navigate to the specific problem folder you want to review or revise.
Open the solution file corresponding to the problem in your preferred programming language.

4 .Read through the solution explanation and implementation to understand the approach and algorithm used.

If desired, run the code locally to observe the solution in action and experiment with variations.
Repeat the above steps for other problems in the sheet based on your learning goals and requirements.

Contribution : Contributions to this repository are welcome! If you have additional solutions, improvements, or optimizations for existing solutions, feel free to submit a pull request. Please follow the established guidelines and maintain the repository's structure and code quality.

License : This repository is licensed under the MIT License. Feel free to use, modify, and distribute the code for personal and educational purposes.

Acknowledgements : Special thanks to Striver, whose Striver SDE Sheet serves as the foundation for this repository. Their valuable contributions and efforts in creating the sheet are greatly appreciated.

Happy coding and best of luck with your DSA practice and learning journey!

Name		Name	Last commit message	Last commit date
Latest commit History 127 Commits
0 1 Knapsack		0 1 Knapsack
3Sum		3Sum
Add Tow Number{Linked_list}		Add Tow Number{Linked_list}
BFS Traversal		BFS Traversal
BST Iterator		BST Iterator
Bellman Ford		Bellman Ford
Best time to Buy and Sell Stocks		Best time to Buy and Sell Stocks
Boundary Traversal of Binary Tree		Boundary Traversal of Binary Tree
Ceil from BST		Ceil from BST
Check Bipartite Graph		Check Bipartite Graph
Chess Tournament		Chess Tournament
Children Sum Property		Children Sum Property
Clone Graph		Clone Graph
Combination Sum II		Combination Sum II
Complete String		Complete String
Connect Nodes at Same Level		Connect Nodes at Same Level
Construct BST from Preorder Traversal		Construct BST from Preorder Traversal
Construct Binary Tree from Inorder and Postorder Traversal		Construct Binary Tree from Inorder and Postorder Traversal
Convert A Given Binary Tree To Doubly Linked List		Convert A Given Binary Tree To Doubly Linked List
Convert Sorted Array to BST		Convert Sorted Array to BST
Copy List with Random Pointer		Copy List with Random Pointer
Count Distinct Element in Every K Size Window		Count Distinct Element in Every K Size Window
Count Subarray with Given XOR		Count Subarray with Given XOR
Cut Logs		Cut Logs
Cycle Detection In Undirected Graph		Cycle Detection In Undirected Graph
Cycle Detection in Linked list		Cycle Detection in Linked list
DFS Traversal		DFS Traversal
Delete Kth node form End		Delete Kth node form End
Deleting a node when head is not given		Deleting a node when head is not given
Detect Cycle In A Directed Graph		Detect Cycle In A Directed Graph
Dijkstra's shortest path		Dijkstra's shortest path
Edit Distance		Edit Distance
Find Nth Root Of M		Find Nth Root Of M
Find Number Of Islands		Find Number Of Islands
Flatten A Linked List		Flatten A Linked List
Flatten Binary Tree to Linked List		Flatten Binary Tree to Linked List
Flood Fill Algorithm		Flood Fill Algorithm
Floor in BST		Floor in BST
Floyd Warshall		Floyd Warshall
Four sum problem		Four sum problem
Fractional Knapsack		Fractional Knapsack
Implement Trie		Implement Trie
Implement Trie II		Implement Trie II
Intersection of Two Linked list		Intersection of Two Linked list
Invert a Binary Tree		Invert a Binary Tree
Job Sequencing		Job Sequencing
K most frequent Elements		K most frequent Elements
Kruskal’s Minimum Spanning Tree Algorithm		Kruskal’s Minimum Spanning Tree Algorithm
Kth Element of Two Sorted Array		Kth Element of Two Sorted Array
Kth Max Sum Combination		Kth Max Sum Combination
Kth Permutation		Kth Permutation
Kth Smallest and Largest Element		Kth Smallest and Largest Element
Kth largest element in a stream		Kth largest element in a stream
Kth largest element in the unsorted array		Kth largest element in the unsorted array
Kth smallest node in BST		Kth smallest node in BST
LCA of Two Nodes In a BST		LCA of Two Nodes In a BST
Linked List Cycle II		Linked List Cycle II
Longest Common Subsequences		Longest Common Subsequences
Longest Increasing Subsequences		Longest Increasing Subsequences
Longest consecutive sequence		Longest consecutive sequence
Longest subarray with sum 0		Longest subarray with sum 0
Longest substring without repeating character		Longest substring without repeating character
M-Coloring Problem		M-Coloring Problem
Matrix Chain Multiplication		Matrix Chain Multiplication
Matrix Median		Matrix Median
Maximum Activities		Maximum Activities
Maximum Consecutive Ones		Maximum Consecutive Ones
Maximum Path Sum Between Two Leaves		Maximum Path Sum Between Two Leaves
Maximum Product Subarray		Maximum Product Subarray
Maximum Sum Increasing subsequence S		Maximum Sum Increasing subsequence S
Maximum in sliding window of size of k		Maximum in sliding window of size of k
Maximum meetings		Maximum meetings
Maximum-Subarray-sum.txt		Maximum-Subarray-sum.txt
Median in a stream		Median in a stream
Median of Two Sorted Array		Median of Two Sorted Array
Merge K sorted Array		Merge K sorted Array
Merge two sorted list		Merge two sorted list
Merge-Intervals		Merge-Intervals
Middle of linked list		Middle of linked list
Min Heap		Min Heap
Min Stack		Min Stack
Minimum Number of Coins		Minimum Number of Coins
Minimum Number of Platform		Minimum Number of Platform
Minimum Path Sum		Minimum Path Sum
N Queens		N Queens
Next Permutation.txt		Next Permutation.txt
Pair sum in BST		Pair sum in BST
Palindrome Partitioning		Palindrome Partitioning
Palindrome Partitioning II		Palindrome Partitioning II
Palindromic Linked List		Palindromic Linked List
Partial BST		Partial BST
Pascal Triangle.txt		Pascal Triangle.txt
Predecessor And Successor		Predecessor And Successor
Prim's MST		Prim's MST
Print Permutations - String		Print Permutations - String
README.md		README.md
Rat in a Maze		Rat in a Maze
Remove Duplicates from Sorted Array		Remove Duplicates from Sorted Array
Return Subsets Sum to K		Return Subsets Sum to K
Reverse Linked List		Reverse Linked List

SagarChau750/Strivers-SDE-Sheet-Challenge

Folders and files

Latest commit

History