non disclosure agreement
2286 Domande di colloqui condivise dai candidati | software development engineer intern
What was one of your best achievements on a project in the past?
DS, Algorithms.
To find and return the common node of two linked lists merged into a 'Y' shape.
Determine if an array from 1..n has a duplicate in constant time and space.
An optimal algorithm to check whether a hand of cards was a full house (in Poker) or not.
I was asked two questions. Q 1. You are given two version numbers of a software, like Version 10.3.4 and Version 10.3.41. Write a program to find out which of the version numbers are the latest. If version 1 is latest output -1, if version number 2 is latest output +1 else output 0 if same version. Both the version numbers are taken as string. He also asks to make the program of minimum time complexity as we can. At the end he also asked the difference between an iterative program and one with recurrence and their advantages and disadvantages. Q 2. Given two files with a list of application IDs (or some kind of data) stored in them , write a program to compare the data in the two files and output all the common data found in each. What data structure would you use and why ? Give a minimum time and space complexity algorithm. Why did you choose the particular data Structure or algorithm ?
get the second most highest integer from an array
To return the 'm' smallest numbers from a file of 'n' numbers
(following the previous one) You got only TWO baby bottle sample. You would like to know the max height you can drop it without breaking the bottle. Let set the unit as 1 foot. And the highest height you can reach is at N feet. So how would you find the (max) safe height? (This is the one I think is kind of brain-teaser one.)
Stai visualizzando 1 - 10 domande di colloquio