Solving Algorithms One Whiteboard at a Time
[Written explanation coming soon.] AFFILIATE LINKS Great resource I use to learn algorithms.40% off Tech Interview Pro: http://techinterviewpro.com/terriblewhiteboard20% off CoderPro: http://coderpro.com/terriblewhiteboard Here is the full implementation.
[Full explanation will be added soon.] AFFILIATE LINKS Great resource I use to learn algorithms.40% off Tech Interview Pro: http://techinterviewpro.com/terriblewhiteboard20% off CoderPro: http://coderpro.com/terriblewhiteboard Here is the full implementation.
[Full explanation will be added soon.] AFFILIATE LINKS Great resource I use to learn algorithms.40% off Tech Interview Pro: http://techinterviewpro.com/terriblewhiteboard20% off CoderPro: http://coderpro.com/terriblewhiteboard Here is the full implementation.
In this question, we need to create a queue, but we’re only allowed to use stacks to do so. Both stacks and queues add elements in the same order. I highly suggest reading the explanation and implementation of stacks here if you don’t have a good grasp of them already. So what’s the difference between a …
In this question, we need to reverse a linked list. A linked list is a data structure consisting of nodes that contain a data field and a reference to the next node. The head refers to the following node in its “head’.next” property. The linked list ends when the reference to the next node is …
In this question, we need to reverse an integer. The key to solving this problem is by creating a variable, let’s call it reversed, which will slowly be transformed until it is the reverse of the integer in question. Let’s walk through this using the number 321. No matter which integer you want to reverse, …
This post will teach you how to create a queue in JavaScript and the difference between a queue and a stack. So what is a queue, anyway? A queue is just a data structure in which the oldest element added is the first element removed. You may see this referred to as “FIFO”, which just …
In this question, we need to determine if two numbers in an array add up to the target number, and if they do, return their respective array indeces. The key to solving this problem is creating a map that holds the numbers and their indeces. As we iterate through the array, we check if the …
If you want to see how to implement a stack using two queues with the costly push method or just one queue, click here and here. Also, I highly suggest reading the explanation and implementation of queues here if you don’t have a good grasp of them already. In this question, we need to create …
Implement Stack Using Queues | LeetCode 225 (Costly Pop) Read More »
If you want to see how to implement a stack using queues with the costly pop or costly push method, click here and here. Also, I highly suggest reading the explanation and implementation of queues here if you don’t have a good grasp of them already. In this question, we need to create a stack, …
Implement Stack Using Queues | LeetCode 225 (One Queue) Read More »