Find the length of the longest chain of consecutive integers in an unsorted set in linear time.
Softwareentwickler 2 Interview Questions
512,287 softwareentwickler 2 interview questions shared by candidates
Jim has 42 cents and has 8 coins, and Jack has 56 cents and has 6 coins. Which has more nickels than the other?
Puzzle1 - Given 8 coins, and the fact that one of the coins is heavier than the other, how many times(min) do you need to use a beam balance to figure out which is the anomalous coin? After I answered this, he made it little tougher. Given 9 coins and one anomalous coin(maybe heavier or lighter), figure out which coin it is and whether heavier or lighter. What is the min no of comparisons? This is where i took a while to answer.
given an arrya of numbers see if you can get to index with 0 in it from an index by jumping through the array using the values in the array. So if you have [1,2,1,0,3] you can get to 0, from 0 by jumping 0, you can get to 0 from 3, by jumping 3 index down to 2 and then jumping 2 index up to 0...
Find the median of unsorted array in O(nlog n ) time. You need to know that particular mathematical algorithm, anything slower your answer is rejected.
Given a binary tree, which is not necessarily balanced, print the nodes in the tree in a level-wise manner. Also, nodes on the same level should be printed on a single line. A modification of the question was added later in which I cannot really add a "level" variable in the structure of the node in the tree.
Implement a method called printNonComments() which prints out a extract of text with comments removed. For example, the input: hello /* this is a multi line comment */ all Should produce: hello all You have access to a method called getNextLine() which returns the next line in the input string.
1. Tell me about yourself 2. Given each abc letter has a value (a=1, b=2, ... , z=26), compute the number of ways one can decode a given integer. e.g. 23 --> 2 [ 2, 3 ; 23 ], 456 --> 1 [ 4, 5, 6 ], 123 --> 3 [ 1, 2, 3 ; 1, 23 ; 12, 3 ]
(Phone screen questions) 1. For a given binary tree, print paths from root to all leaf nodes, one path per line. 2. Given a sequence of positive integers "seq" and an integer "total", return whether a contiguous sequence of "seq" sums up to "total". (Onsite interview questions are covered by NDA therefore can't post, but it can be said that the knowledge of data structures and handling edge cases are important for the coding interviews)
Give the count and the number following in the series. for e.g 1122344 first line output : 21221324 next line : 12112211121214 and so on...
Viewing 781 - 790 interview questions
See Interview Questions for Similar Jobs
Softwareentwickler 4SoftwareentwicklerSoftwareentwickler Im Test (ssd)Softwareentwickler IiSoftwareentwickler Co-opSoftwareentwickler Softwareentwickler SoftwareentwicklerMitarbeiter SoftwareentwicklerSoftwareentwickler IFrischerer SoftwareentwicklerSoftwareentwickler Im TestSoftwareentwicklungsingenieurSoftware Ingenieur EntwicklerLeitender Softwareentwickler Im TestSr. softwareentwicklerSoftwareentwicklung Ingenieur-testSoftware-engineering-kooperationSenior Softwareentwickler