1. Smallest non negative number in a array
2. Given a grid with costs in each cell.You can enter through any item in Row 0 and exit through any row n-1. Find the minimum cost path
1. Connect all nodes at same level in a Binary Tree
2. Median in a running stream of numbers
1. Design a group chat both front end and back end.
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready. To complete your preparation from learning a language to DS Algo and many more, please refer Complete Interview Preparation Course. In case you are prepared, test your skills using TCS, Wipro, Amazon and Microsoft Test Serieses.