feat: Add explanations and Top Interview Questions for Core DSA Topics #313
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Hey there!
I'm a big fan of this project and wanted to contribute some resources that I think will really help beginners.
When I was learning DSA, I found that connecting the core theory to actual interview problems was the hardest part. My goal with this pull request is to help bridge that gap.
Here’s a breakdown of what I added:
Some Deep-Dive Guides 📄
First, I wrote up a few detailed but easy-to-follow text guides on some of the trickier concepts. I tried to explain them simply, covering not just the "what" but the "how" and "why."
A full breakdown of Recursion (from base cases to the call stack).
A guide to BFS, explaining the level-by-level approach.
A guide to DFS, covering Pre-order, In-order, and Post-order traversals.
Top Interview Questions 💻
Then, to make the theory more practical, I added solutions for a bunch of the most common LeetCode questions that people actually see in interviews. This includes:
About 10 essential Linked List problems that cover all the key patterns (reversal, cycle detection, etc.).
Classic tree problems that test both BFS and DFS logic.
A popular and important question for Stacks (Valid Parentheses).
I really hope this helps other learners get interview-ready faster! Let me know if there are any changes you'd like me to make.
Thanks for the great project!