Step 1 : sort boxTypes so that boxes with the most units appear first.
Step 2 : Iterate through the boxes in sorted order.
Step 3 : Instead of counting down one by one how many boxes to take, we can calculate how many boxes of the current type to take by taking min(truckSize, numberOfBoxes). This is because the truck can fit at most truckSize more boxes, but we have numberOfBoxes left.

Step 1 : Create a descending order map, and insert first k elements. our map's first element will;point to the greatest element in the map.
Step 2 : In the second for loop, as its a sliding window, I'm removing the first elem(
a[k-i]) and adding the current upcoming elem (a[i]) into the window.
Step 3 : for that I'm decreasing the element's frequency in the map. also note that decreasi...

Step 1 : Initially, I gave the naive approach of traversing the tree in Inorder and while traversing, keep track of the count of the nodes visited. If the count becomes k, print the node and end the program. Complexity of this code is O(n) time and O(h) auxiliary space which I explained too and further asked if it is required to improve before starting to implement it.
Step 2 : Then I was as...

Step 1 : Initially, I explained an array-based approach similar to this one:Method 3 of https://www.geeksforgeeks.org/given-a-string-find-its-first-non-repeating-character/ 
So each time the find answer function is called we will have to traverse the fi[256] array each time to return the answer.
Step 2 : Then he asked me to try a different approach for a situation in which the Find A...

Step 1 : I gave the recursive approach, he told me to code.
Step 2 : After that he told me to dry run the approach for {a,b,c}, i tried to make the recursion tree on the editor but it was all messy after a few steps. He then shared a whiteboard link for that, it was taking lot of time doing there so finally he shared his whatsapp and told to do it on paper and send him the image, around 35 m...

Step 1 : I had solved this question before and after some time told him the O(n) approach. He told me to code. I did so explaining each step along. I had two nested for loops in the code, so he inquired about how the approach is linear in time. 
Step 2 : We had some discussion on the code and I had to explain some parts to him again. He suggested some changes too. I deleted 4-5 lines fo...