Technical question based on lists, trees, file systems.
Software Developer Ii Interview Questions
3,998 software developer ii interview questions shared by candidates
Questions will be on algorithms and data-structures and there will be one design round. Questions involved trees, stacks, queues and longest increasing sequence. Design round was not as difficult as Amazon. Algorithms did not require dynamic programming in my case. Overall, the interview was easy. I may be a little biased here because I was giving many interviews recently and was at the peak of my performance.
What is the difference between a clustered index and a nonclustered index? How do you optimize this given for loop?
The initial interview is really easy - given an array of integers and a key, write a method that determines if the key is contained in the array.
Implement insertion into a sorted linked list.
How to convert an integer into a binary number?
Interview #1. Q1. Print a Tree in level order in Zigzag way. Interview #2: Q. Swap LinkedList nodes (odd even pair). Interview #3: Q. Design a Web crawler. Tricky part was invalidating a crawled content (if content gets updated).
Coding problems: 1. Write a code showing how 2 goroutines would update the same variable? 2. Write a program to sum 2 numbers. the numbers will be given in an array presentatione e.g: 123 as [1,2,3]. output the sum in the same format? 3. Write a program to check is paranthesis are balanced. "(", "[", "{" 3 types of paranthesis can be provided in the inout string. 4. Write a program to reverse a linkedlist using recusrsion.
Question 4: Given a tree, where each node holds an integer value, find if there exists a path from the root node to a leaf node that equals a given sum.
What were past technical challenges that you had and how did you solve them?
Viewing 2631 - 2640 interview questions