A Linklist represent a number and every node contain a digit only. Write a function that take Root node and after adding one , it will return the the root node Write a function that add 1 to linkedlist number [2]->[4]->[5]->[7]->[3]->[6] afte plus 1 [2]->[4]->[5]->[7]->[3]->[7] + time and space complexity of the solution
rest of the interview was pretty basic
Do you have experience with BDD?
Design an app to consume API and display in a sorted list. No further instruction is given.
String Manupulation related questions and previous project related questions.
You have to tell maximum value in a path from first element to last row with 2 constraints : You can chose only one element in each row. You can chose either exact below element in next row of current element or right element to exact below element. e.g. in given exampe if yo have chosen 3, in next row you can chose 5 or 6
Have you worked on mobile first? If not i will ask a few more random questions and you can leave then
I was asked to develop a solution given that a service that they had implemented would return some data after X amount of time they wanted me to develop something to call the service and consume the data.
What are your strengths and weaknesses?
What's your favorite programming langugage?
Viewing 351 - 360 interview questions