Simple OOPs question, a BFS problem, elementary number theory problem
Sr Software Engineer Interview Questions
71,535 sr software engineer interview questions shared by candidates
Given an array of integers, find the maximum number that can be reached by summing the best possible consecutive subsequence of the array.
Given a list of versions (in string format). The versions can have invalid characters (requires cleaning). Print the list in sorted order of increasing versions. Input: ["1.2.34", "$5.j8", "3.4#", "3.45"] output: 1.2, 3.4, 3.45
So you're not a .Net developer?
Brain teaser #1: Given 8 balls and a balance, how many weighings would it take to find one ball that does not weigh the same as the other 7. Brain teaser #2: Two boys enter a tunnel. When they are 1/3 of the way through, they hear a train coming. If the boys run in opposite directions at the same speed, and narrowly miss getting hit by the train at their respective end of the tunnel, how fast was the train traveling compared to the 2 boys?
given a large array of int return the length of the longest increasing(non-necessarily-adjacent) sub-sequence
Coding the fibonacci algorithm.
Given an array and a sum, determine if any of the items add up to sum. Do a linear space solution and constant time solution.
The number of paths in a m x n grid to a given cell? (After looking it up I noticed the interviewer actually asked the question incorrectly). So, always ask for more details if things are unclear.
Tell me the difference between C# and C++
Viewing 161 - 170 interview questions