What is oops Which is best sorting algorithm
Sde Interview Questions
16,590 sde interview questions shared by candidates
Questions on graph was asked
1. Shift all the zeroes in an array to the end and to the beginning. 2. Insert and delete a node from between in a doubly-linked list. 3. Find k nearest numbers of n in a sorted array, where n and k are given. You're supposed to tell the approach, write the code on their text editor, and dry-run it. Also, tell and reduce the complexity if required. 4- Write JOIN Queries in SQL, Graphs vs Trees, SQL vs NoSQL, and the Execution order of a query in SQL. 5- How will you sort data with numbers from -1B to +1B?
it was good good all
Behaviour questions Tell me about your self
Height of a binary tree?
Os Dbms Ada Trie Binary tree Heap
Given the graph consist of pair and weight attached to it. Print out the node having the maximum number of inorder weights. (Node having maximum sum weight ). Given the graph, Print out the maximum weight Cycle of the graph. ( Cycle which has maximum sum weight ). Given the 2 nodes. Print the shortest path between them. ( Return the array containing the path).
What is your Strength and weaknesses?
cycle detection in Graph working code. allocate 3d array using pointers.
Viewing 361 - 370 interview questions