Given 2 strings find the common words along with the time and space complexity. How would you optimize the algorithm
Sr Software Engineer Interview Questions
71,542 sr software engineer interview questions shared by candidates
"Given a log file spanning multiple days, and given a page transition A -> B -> C, find all the unique users who made this page transition in the logs"
Write a function that determines the divisors of an supplied parameter and which of those are prime numbers.
Without using length and size function how could you get the 2nd last variable in an array of integers?
void sort(String s){ } void sort(Integer I){ } void sort(Object o){ } calling : sort(null) which function will be called?
Given an integer array containing positive and negative numbers, how do you get the maximum sum of its sub-arrays? Continuous numbers form a sub-array of an array. For example, if the input array is {1, -2, 3, 10, -4, 7, 2, -5}, the sub-array with the maximum sum is {3, 10, -4, 7, 2} whose sum 18.
What is your highest educations
There will be lot of things which i cant explain.
Take home assignment - not that difficult, but time consuming
Puzzle ------- Eg: Assume you have 4 strings formed from a,b,c,d like abcd, acdb, adbc, bcda Output should be "bc",3 as "bc" is the largest substring repeated in 3 input strings. Few more examples to understand it. Inp1: {abcd,abcd,abcd,abcd} Out1: abcd,4 Inp2: {abcd,dabc,acbd} Out2: abc,2 Inp3: {abcd,dabc,adbc} Out3: bc,3 All the chars are distinct and all the chars are repeated in each string(You can relax these restrictions if you want). If 4 input strings are given then the output should be like, if you have subString of size 3 present in 3 inputs and subString of size 4 present in 3 inputs but a subString of size 2 present in 4 inputs then you should print the last one as output. But as it is obvious a subString of size 1 will be repeated in all the inputs but you should consider subString od size > 2 and repeated in max of the inputs. To say mathematically, high priority is given to the number of repetitions followed by the size of the subString.
Viewing 211 - 220 interview questions