1. Find the O(n) time complexity of a function which traverses a 2D array and sum all elements. 2. Code challenge: write an app that manages cabinet storages (like a double ended stack structure). When a cabinet is full, the first item (oldest) pushed to the next cabinet. The input is a list of items with their unique id. The input can have duplicate items. Question: print the location of the final item in the input list to where it belong (cabinet number or "new" item that is never stored)
Tell me about a mistake you made
What changes will you do first to the website?
Build a URL shortner and explain the system structure.
Why do you want to be a part of sage group?
What are the necessary steps that need to be taken when creating a new app or something like that?
What was your greatest achievement?
Why do you want to work here? Explain the software development process. Do you have experience working with different cultures? The importance of diversity. How you would know if a software has succeeded.
What are our values and which one do you most relate to?
What is the difference between stacks and queues
Viewing 461 - 470 interview questions