Why do you want to join the Company?
Member Technical Staff Interview Questions
17,419 member technical staff interview questions shared by candidates
Questions were related to the stuff you have added in you Resume.
General Computer programming, esp Data Structures / Algorithm . Design level questions.
Q. You have been given a list of words. In O(n) complexity, you have to determine which words in the list make the anagram, could have multiple words make the same anagram. Print the matching list.
Q. You have been given an array, and you have to find the product of all the indexes except itself, and you cannot use division.
Q. SQL queries questions - one liners to understand the basics on JOIN
find missing element if n-1 number is given from 1 to n
Coding and design questions
You're given a list of installation dependencies. Then you're given a sequence of install/remove/list program commands, and you're supposed to output what programs get installed such that all dependencies are satisfied, and what programs are removed when nothing depends on them. Kind of like a very bare bones version of Linux's APT tool.
coding round - two questions - 1.5 hours time - hacker rank 1) find the pair of indexes in an array whose values sum equal given number - duplicate pairs not allowed 2) Special key board contains special keys problem ...something like special keys are "A", "Ctrl+A", "Ctrl+C", "Ctr+V", Input is number of keystrokes-Need to find how many "A"'s could appear on the screen using these special keys Technical Round -1 1) Given a singly linked list , given input n, -- Need to reverse every n nodes in the linked list -- in other words (Reverse a Linked List in groups of given size) 2) Check wheter given tree is symmetric or not 3) Give any data structure of complexity o(1) 4) Celebrity with millions of followers - updates some page, how does it reach ..technology behind it. Round 2: 1) Reverse sub strings of given String Eg: "My name is Salesforce" output : "Salesforce is name My" 2) An array contains some integers, Need to find the index at which sum of left indexes equal to sum of right indexes Eg { 1, 2, 5, 1,2,6} --> index is 3( sum is 8 to left and right } 3) Least common ancestor 4) Design chat application
Viewing 3871 - 3880 interview questions