Given below is the best-structured path to learn Arrays with the best video tutorials, and at the same time practice problems which are asked in top tech giants like Google, Amazon, Facebook, etc, and startups like Swiggy, Zomato, Paytm, and others.
Basic
Find both C++/Java/Python codes of all problem in the articles in the first column.
Problem | Practice Link 1 | Video Solution | Practice Link 2 | |
---|---|---|---|---|
Largest Element in an Array | ![]() |
![]() |
||
Check if the array is sorted | ![]() |
![]() |
![]() |
|
Second Largest Element in an Array without sorting | ![]() |
![]() |
||
Linear Search | ![]() |
![]() |
||
Left Rotate an array by one place | ![]() |
![]() |
![]() |
Easy
Find both C++/Java/Python codes of all problem in the articles in the first column.
Problem | Practice Link 1 | Video Solution | Practice Link 2 | |
---|---|---|---|---|
Maximum Consecutive Ones | ![]() |
![]() |
![]() |
|
Move Zeros to end | ![]() |
![]() |
![]() |
|
Left rotate an array by D places | ![]() |
![]() |
![]() |
|
Remove duplicates from Sorted array | ![]() |
![]() |
![]() |
|
Find missing number in an array | ![]() |
![]() |
![]() |
|
Find the number that appears once, and other numbers twice. | ![]() |
![]() |
![]() |
|
Find the Union and intersection of two sorted arrays | ![]() |
![]() |
||
2Sum Problem | ![]() |
![]() |
![]() |
Medium
Find both C++/Java/Python codes of all problem in the articles in the first column.
Hard
Find both C++/Java/Python codes of all problem in the articles in the first column.
Expert
Find both C++/Java/Python codes of all problem in the articles in the first column.
Problem | Practice Link 1 | Video Solution | Practice Link 2 | |
---|---|---|---|---|
3-Sum Problem | ![]() |
![]() |
![]() |
|
4-Sum Problem | ![]() |
![]() |
![]() |
|
Find the repeating and missing number | ![]() |
![]() |
||
Maximum Product Subarray | ![]() |
![]() |
![]() |
|
Merge Sort | ![]() |
|||
Count Inversions | ![]() |
![]() |
||
Reverse Pairs | ![]() |
![]() |
![]() |
What trust this set of problems?
This sheet is prepared by Raj Vikramaditya A.K.A Striver, Candidate Master, 6*, who has bagged offers from Google Warsaw, Facebook London, Media.net(Directi). He has also interned at Amazon India.
He is also one of the top educators across the globe when it comes to DSA with an overall following of 1M+ across social media. His experience and knowledge in this field help him to pick up top-tech interview questions and provide you with video solutions in the best possible order for you to learn.
What is the Unique thing about this?
In-depth Videos, Articles with C++/Java/Python codes, and Practice Links, all in one place making it easy for you to practice. Along with this, the trackers help you to keep track of your progress.
Why are the videos long?
The videos don’t contain just one solution, most of the videos have 3-4 solutions with live coding of each one of them. It helps you to learn problem-solving in the correct manner. We start from brute force, then move on to better, and then to multiple optimal solutions for every problem. Most videos on Youtube just tell you one solution, and our main focus is to teach you how to come up with solutions for every unknown array problem when you finish this sheet, and not just for the ones in the sheet.
You can also follow our Strivers A2Z sheet where you will be getting a structured path for learning the entire DSA. In case you are running short in time, and you want a crisp set of problems to prepare, you can follow Strivers SDE Sheet.
All our structured sheets have in-depth videos, descriptive articles, and practice links, which makes it easier for you to learn in a single place.