Skip to contentSkip to footer

Senior Engineer Interview Questions

Salaries
Interviews

114,089 senior engineer interview questions shared by candidates

Write code to sum the values contained in two memory slots into a third memory slot, using only 3 instructions: zero <slot> increment <slot> jlt <slot1>,<slot2> <location>, where jlt=jump to <location> if <slot1>is less than <slot2>.
avatar

Senior Software Engineer

Interviewed at Walmart

3.4★
Nov 13, 2011

Write code to sum the values contained in two memory slots into a third memory slot, using only 3 instructions: zero <slot> increment <slot> jlt <slot1>,<slot2> <location>, where jlt=jump to <location> if <slot1>is less than <slot2>.

in first round - 1.design database table that can store comments like facebook. but there could be hierarchy of replies possible. design table to store them and query them in a way that each complete set of comments with their reply can be resulted. 2.Design ranking system, like in oyo room, there could be different ranking systems like user feedback and audit feedback etc. you should allow user to query all of them or few of them. the query should be generic enough. In second round- 1. calculate a to the power of n (interviewer was under impression that in order to do that u have to multiply a n times :D). optimize it to logn. 2. in an array every number present in pairs except one. find out one number which is not present in pair. (u can't sort or use extra space). (again this funny interviewer wanted to use bit-wise operator xOr to solve this which he was rigid. )
avatar

Senior Software Engineer

Interviewed at OYO

3.3★
Nov 1, 2015

in first round - 1.design database table that can store comments like facebook. but there could be hierarchy of replies possible. design table to store them and query them in a way that each complete set of comments with their reply can be resulted. 2.Design ranking system, like in oyo room, there could be different ranking systems like user feedback and audit feedback etc. you should allow user to query all of them or few of them. the query should be generic enough. In second round- 1. calculate a to the power of n (interviewer was under impression that in order to do that u have to multiply a n times :D). optimize it to logn. 2. in an array every number present in pairs except one. find out one number which is not present in pair. (u can't sort or use extra space). (again this funny interviewer wanted to use bit-wise operator xOr to solve this which he was rigid. )

Viewing 1221 - 1230 interview questions

Glassdoor has 114,089 interview questions and reports from Senior engineer interviews. Prepare for your interview. Get hired. Love your job.