Data Structure Interview Round - Atlassian | P40 | Software Engineer 2
Anonymous User
2910

I had my data structures round today for atlassian, I was asked Stock Price Fluctuation question. I was able to solve the question but I missed out on the time complexity a little.

First I said the time complexity would be O(1) but my approach was using treeMap and that has a time complexity of O(logN). But when pointed out that I'm using a TreeMap. I said the time complexity would be O(logN) What do you guys think would it be a problem?

I was even able to solve the follow ups with a little help

Comments (4)