CommerceIQ Software Development Engineer (SDE) interview questions

find next lexicographically greater permutation Input format: {1, 2, 3} Output Arr[] = {2,1,3}

Minimum time required to burn the Binary tree from given node. (Basically given any node, it will burn at time 0 and then at time 1 the nodes connected to given node will burn and so on. Task was to find total time to burn.)

A low level design question on given different kind of excel files and different kind of sheets to be preprocessed how will I write code to preprocess excel file so that it is open for extension and closed for modification.

2nd Round - We discussed about my projects and dived deep into one and how to scale it. Question related to why choose this language and framework and language on backend, why this choice of database and how it will change when we will scale further. And some more questions regarding improving throughput and fault tolerance.