Whiteboard Interview Series - Data Structures and Algorithms
We were working hard to release the Whiteboard Interview Series to help you with the various approaches needed to solve the Data Structures and Algorithms problem. Whiteboard Interview is common in companies like Google, Facebook, Amazon, Microsoft, and etc. Now that it has been released and we have received wonderful responses and we have planned to release more videos in the whiteboard interview series. I would also like to thank everyone for the feedback which is helping us to improve and deliver better content to you.
In this whiteboard interview series, we are taking problems asked in various companies and solving those with the various approaches. At the end of each video, we have provided the suggested problems to solve based on the problem which we have discussed in that video.
Before starting this series, we talked to the candidates who have cracked these interviews and noted down the things which are important for cracking the Data Structures and Algorithms interview. We also took reference from the book “Cracking the Coding Interview” for the tips to crack the coding interview.
Here is the link to the playlist on Youtube.
In addition to the solution to a particular problem with the various approaches, we have also covered the following as these things are important in the coding interview round:
- Ask for clarification questions. Understand the question properly before starting. Do focus on this when you go through the videos.
- You can always start with the brute-force solution. A brute-force solution is better than no solution. Make sure you notice these things when you go through the videos.
- Keep improving the solution for better time and space complexity whichever is applicable. We have followed this in the video.
- Think loud, even when you are writing the solutions.
- Write your code, not too slow and not too fast as suggested in the book “Cracking the Coding Interview”.
- Test your solution with examples and find mistakes if any.
- Do not miss the edge-cases. Make sure you notice these things when you go through the videos.
Let’s get started.
Here is the link to the playlist on Youtube.
Whiteboard Interview Part 1 | Find whether an array is a subset of another array
Whiteboard Interview Part 2 | Find the minimum and maximum value in an array
Whiteboard Interview Part 3 | Check for pair in an array with a given sum
Whiteboard Interview Part 4 | Search an element in a sorted and infinite array
Whiteboard Interview Part 5 | Count ways to reach the nth stair using step 1, 2 or 3
Whiteboard Interview Part 6 | Find the minimum element in a sorted and rotated array
Whiteboard Interview Part 7 | Move all zeroes to end of array
Whiteboard Interview Part 8 | Find Next Greater Element in an array for each element
More to come, we will keep adding.
Thanks for reading.
Clap, share if you like it and follow me for the updates.
