Design twitter trending topics
Software Engineers Interview Questions
420,318 software engineers interview questions shared by candidates
In a 2D vector, all vectors were of size two. Eg: {{1,3},{2,3},{1,4}}. The vectors represent the entry and exit time of a pedestrian crossing a road. Pedestrian 1 entered at time 1 and exited at time 3 and so on.. Find the interval during which maximum number of pedestrians were crossing the road.
1. How to encrypt a set of string e.g. WAAAYYFFFFFAIIIRR to W1A3Y2F4A1I3R2 etc... And how to decrypt it back to original string (2 separate functions) 2. How to design a system so that user can check in their location thru their phone, and how to scale it when the app gets popular and millions of users are using it. How would you expand the application features when popularity grows. 3. How to design a database of Warehouse, Suppliers and Customers and they ask you to write various SQL queries to pull products sold, how many customers bought more than 30 products etc 4. A coding problem to simulate the coin game and gambler's fallacy (if they are 4 Heads in a row, gambler would bet on Tail, and vice versa).
I interviewed with more than 5 people including CTO. I only receive one technical question that could have demonstrate any technical skill. The question was extremely easy and the interviewer did not even ask for the optimal solution (the interviewer actually did not want me to explain the optimal solution). The question was "You have an array of numbers. Return the number of couple that have 23 as their sum."
The question gave me as input an array a that had a permutations of the first n natural numbers and a number k. You have a series of plants, at the beginning all the plants are not in bloom. At the ith iteration the plant at the location of the array that had the value i was going to bloom. If a plant bloomed it stayed bloomed forever. We define a group as the number of adjacent bloomed plants. Find the last iteration that had a group of size k. E.g. Given a = [ 1 3 2 4] plants: 0 0 0 0 1 0 0 0 (1 group of size 1) 1 0 1 0 (2 groups of size 1) 1 1 1 0 (1 group of size 3) 1 1 1 1 (1 group of size 4)
sentence similarity
Write a method that finds depth of a (non-balanced) binary tree.
Given two linked lists, return the intersection of the two lists: i.e. return a list containing only the elements that occur in both of the input lists.
Write a function to return the longest common prefix between two strings.
Get the kth largest number from two sorted arrays
Viewing 1631 - 1640 interview questions
See Interview Questions for Similar Jobs
Game ProgrammerMobile EngineerOperations EngineerMobile Developer.net DeveloperFirmware EngineerPrincipal EngineerAtg DeveloperC DeveloperSoftware DeveloperDevops EngineerJr Security AnalystPython DeveloperQa EngineerData EngineerLead EngineerSenior DeveloperTechnical Program ManagerApplication Developer