Why you should not use pramp

Here I talk about my experience using pram as a free user

The UI, is actually neat. Not flashy but presents in a clean way what is there for you. I created my meeting at 8 am Central Time and the interviewer and I logged accordingly. Nothing wrong occurred with that.

When talking to my interviewer we had some sound issues, by some reason he was not hearing me correctly, I have had tons of meetings in my setup but still, change my location to be closer to the router, and changed my headset to be sure.

My interviewer did not present himself so I do not know weather I was talking with some experienced developer nor a university grad.

The two biggest downsides were the following. My interviewer did not know how to use the programming language I selected. Being that the case, why are you allowed to take the interviewer role? He kept changing the language to C++ until I asked him if it was okey if I used java, and he did not agree! I tried to use C++ but when I started coding I though, it would be more useful for me using a programming language that I know better.

Finally the last part that I did not like of using pramp is that they always set you up with the same question, even though you have 5 free interviews. That does not occur in the premium version I guess. So I only took one and cancel the other ones.

If you are interested in the questions asked you will find one below. Let me know if you want the second question and my solution too

Sales Path

The car manufacturer Honda holds their distribution system in the form of a tree (not necessarily binary). The root is the company itself, and every node in the tree represents a car distributor that receives cars from the parent node and ships them to its children nodes. The leaf nodes are car dealerships that sell cars direct to consumers. In addition, every node holds an integer that is the cost of shipping a car to it.

Take for example the tree below:

A path from Honda’s factory to a car dealership, which is a path from the root to a leaf in the tree, is called a Sales Path. The cost of a Sales Path is the sum of the costs for every node in the path. For example, in the tree above one Sales Path is 0→3→0→10, and its cost is 13 (0+3+0+10).

Honda wishes to find the minimal Sales Path cost in its distribution tree. Given a node rootNode, write a function getCheapestCost that calculates the minimal Sales Path cost in the tree.

Implement your function in the most efficient manner and analyze its time and space complexities.

For example:

Given the rootNode of the tree in diagram above

Your function would return:

7 since it’s the minimal Sales Path cost (there are actually two Sales Paths in the tree whose cost is 7: 0→6→1 and 0→3→2→1→1)

Constraints:

• [time limit] 5000ms
• [input] Node rootNode
• 0 ≤ rootNode.cost ≤ 100000
• [output] integer