Python interview with a Salesforce engineer: Make change

[afonsovideira]

at 42:42 shouldn´t the time complexity be O(1), because the array of bills is constant.

[caseysick]

Great interview, but I have one improvement. There's no need to reverse the array in the last problem. In the loop, just start from length-1 and decrement backwards to 0.

[Kriishna]

Q2: Every element appears exactly twice except for one element. Not sure, if the interviewer or interviewee mentioned it.

Q3: { 1.54.100} For a change of 108 should give the result 54*2 but not 100*1 + 8* 1

[edwardteach]

Basically the Coin Change problem without the Dynamic Approach and you're basically going through the greedy implementation

[jeremyrivers]

man i wish real coding interviews were this easy hahah

[hareshbsingh]

Couldve just used the deque rotate function