Take home assignment - not that difficult, but time consuming
Senior Software Interview Questions
75,502 senior software interview questions shared by candidates
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.
The main thrust of many of their questions was my ability to communicate and work with clients from the discovery phase onward.
Basic to advanced
What I found surprising was that there were no particularly hard questions, but bear in mind I am a very experienced engineer.
Given a string s (1<=s.length()<=1000), return the shortest substring that is only occurring once. Examples: s="aabbabbaab" gives either "bab" or "baa" s="aaaa" gives "aaaa"
process and execution order
A HackerRank challenge with 90 mins to solve
Find the contiguous subarray within an array (containing at least one number) which has the largest sum. For example, given the array [−2,1,−3,4,−1,2,1,−5,4], the contiguous subarray [4,−1,2,1] has the largest sum = 6.
Viewing 231 - 240 interview questions