Description
The Striver’s 79 Sheet is a compilation of top coding interview questions covering various topics in DSA. These questions are commonly asked in interviews at major tech companies like Google, Amazon, Microsoft, Facebook, Swiggy, and Flipkart. The sheet provides in-depth video solutions for problems, well-structured articles/notes for quick revision, code examples in C++, Java, Python, and JavaScript, company tags associated with each problem, and a notes section for personal annotations
It is emphasized that candidates should have prior knowledge of DSA before attempting the questions in the Striver’s 79 Sheet. Beginners are advised to start with the Strivers A2Z DSA Sheet. This resource seems to be a comprehensive tool for individuals preparing for technical interviews, offering a structured approach to revising key concepts in DSA and practicing common coding problems.
Tags
Syllabus
Part 1: Arrays & Hashings
Part 2: Binary Search
Part 3: Linked List
Part 4: Recurssion & Backtracking
Part 5: Stacks/Queues
Part 6: Heaps
Part 7: Trees (BT + BST)
Part 8: Graphs
Part 9: Dynamic Programming
Part 10: Tries
Part 11: String
-
TypeProblem Sets
-
ProviderIndependent
-
PricingFree
-
Duration5 weeks
-
DifficultyBeginner
-
CertificateNo certificate
The Striver’s 79 Sheet is a compilation of top coding interview questions covering various topics in DSA. These questions are commonly asked in interviews at major tech companies like Google, Amazon, Microsoft, Facebook, Swiggy, and Flipkart. The sheet provides in-depth video solutions for problems, well-structured articles/notes for quick revision, code examples in C++, Java, Python, and JavaScript, company tags associated with each problem, and a notes section for personal annotations
It is emphasized that candidates should have prior knowledge of DSA before attempting the questions in the Striver’s 79 Sheet. Beginners are advised to start with the Strivers A2Z DSA Sheet. This resource seems to be a comprehensive tool for individuals preparing for technical interviews, offering a structured approach to revising key concepts in DSA and practicing common coding problems.
Part 1: Arrays & Hashings
Part 2: Binary Search
Part 3: Linked List
Part 4: Recurssion & Backtracking
Part 5: Stacks/Queues
Part 6: Heaps
Part 7: Trees (BT + BST)
Part 8: Graphs
Part 9: Dynamic Programming
Part 10: Tries
Part 11: String