Exclusive Content

Get Access to 600+ DSA Interview Questions!!!!!!
I along with my friend while preparing for coding interviews faced a lot of trouble, we were totally clueless where to start from and which questions to practice and how to get the most efficient approach for that question.
Don't worry we won't let you go through the same, we've done the searching for you and now you can get all this at one place we have created 600+ interview questions list with their efficient solutions not only this we have also, created various channels for different topics and divided questions on the basis of their level of difficulty so now all you need to do is just go through the questions and practice them at one go, in case you get stuck while solving it we still have best solutions available with them.
The channels where go get access includes :
#sde-preparation-series
#basic-problems
#intermediate-problems
#advanced-problems
#stl-hacks
#trees-all
#graphs-must-do
#backtracking
#dynamic-programming
#sir-tech-sidhu
#stl-hacks
#resources
You get the complete access at just Rs.499 and in return we're providing you our content in which we have invested more than a year.

Pay Now

After your payment is done you can send me its screenshot at: ranaankitcse@gmail.com I'll soon send you the invitation link of my discord server.

Terms and Conditions : Click Here

Note : Once you've purchased this course then it is non-refundable and can't be cancelled.

Comments

100+ STL Algorithms, "I Bet If You Know Even 20 Out of These..." ( C++ 17 )

So, In the previous posts, I've been telling you about the various containers in STL and their implementation. I left a few of them purposely such as unordered_map, unordred_set, etc. so that you also do some homework. This post will entirely be about various functions available in STL and it would be your task to completely code & implement them. Do tell me if you have any doubts related to it in the comment section below. Some common Data Structures Implementation In STL : Stack Syntax : stack<data_type> stack_name Example : stack<int> st; Built-in functions such as top() , push() , pop() , empty() , size() etc. are available in STL for Stack. Queue Syntax : queue<data_type> queue_name Example : queue<int> q; Built-in functions such as push() , pop() , empty() , size() , front() , back() are available in STL for Queue. List ( Doubly Linked List ) Syntax : list<data_type> list_name Example : list<int> l;

Left & Right View Of a Binary Tree Made Easy!

When talking about binary trees then the view of a binary tree is something that has the most probability to be asked in a coding interview. In this blog post, I'm going to talk mainly about the Right & Left views of a binary tree. There are so many ways available on the internet, that it's really a very difficult task to choose which method you should follow. Suppose, you're using one method for Left View and another method for Right View, now you need to know two different methods for two similar questions. In this blog we'll discuss a single approach by which you can solve both Left View and Right View problems. Before diving directly into the approach we need to understand what exactly is this Right/Left view. For your better understanding I've created a binary tree : So let's try to understand the right view for this binary tree. Right View simply means looking at the tree from its right side and the only nodes visible from that view are required to b

On Which Coding Platform Should I Practice?

Which is the best online platform to practice, how to improve my coding skills? This post is all about giving answers to all such questions. If you're a beginner who has got no idea what programming is then I would recommend you step by step practice any programming language on Hackerrank. Hackerrank has modules that are self-explanatory and would slowly make you understand all the terminologies which are generally used and with practice, you'll be better at it. Moreover, if you're still not able to understand anything you can always search for your answers on GeekForGeeks or HackerEarth both of them provide one of the best tutorials on any topic. If you're an intermediate who's comfortable with any programming language then you can always improve your problem-solving skills studying Data Structures and Algorithms and practicing it. You can also improve by competitive coding. The best place to start with competitive programming according to me would be

Developers Nest - Intensify Your Coding Skills

Search This Blog