how to determine if 2 linked lists are merged at a common node in O(n) time
Senior Development Engineer Interview Questions
1,587 senior development engineer interview questions shared by candidates
N-Queen problem -
Print a matrix in spiral fashion...so Matrix input example (Arrows indicate how the spiral happens...start at first arrow go in circle and move to next arrow...etc.) ->1 1 1 1 1 1 -> 2 2 2 1 1 2 2 2 1 1 1 1 1 1 Output: 11111111111111222222
a) Develop a XML parser (rules: Node closures and single root node..i.e. root node cannot be duplicated in structure). b) Count occurrences of words in a string (with string too large to be processed in memory).
reverse a linkedlist
Round 1: Screening by HR: Linux commands like du -sh, PWD, top, grep, and python questions like- the difference between list and tuple.
Q: Can you explain a challenging technical problem you faced and how you solved it?
Presented with scenarios, and ask to offer solutions. Mostly interested in your approach, not the solution.
No point in knowing the question because in second round they wont let you answer
How would you test a coke can?
Viewing 91 - 100 interview questions