Skip to contentSkip to footer

Software Engineer 2 Interview Questions

Salaries
Interviews

665,594 software engineer 2 interview questions shared by candidates

Union of n arrays with x elements. Output common members contained in at least 2 arrays. Explain the complexity of the algorithm used. We have a digested server log with username, visited page and timestamp. Create a processing algorithm that will output the most visited page/areas in such a way that will match partial path as well. i.e. { { user: "user1", page="/home" }, { user: "user1", page="/home/account" }, { user: "user1", page="/home/account/profile" }, { user: "user1", page="/home/account/login" }, { user: "user2", page="/about" }, { user: "user2", page="/about/contact" }, { user: "user2", page="/home" } } the output user1 - home/account - home user2 - /about PS I'm rephrasing because I cannot recall exactly the question
avatar

Software Developer

Interviewed at Booking.com

4.1★
Jan 14, 2016

Union of n arrays with x elements. Output common members contained in at least 2 arrays. Explain the complexity of the algorithm used. We have a digested server log with username, visited page and timestamp. Create a processing algorithm that will output the most visited page/areas in such a way that will match partial path as well. i.e. { { user: "user1", page="/home" }, { user: "user1", page="/home/account" }, { user: "user1", page="/home/account/profile" }, { user: "user1", page="/home/account/login" }, { user: "user2", page="/about" }, { user: "user2", page="/about/contact" }, { user: "user2", page="/home" } } the output user1 - home/account - home user2 - /about PS I'm rephrasing because I cannot recall exactly the question

Technical: 1. https://www.facebook.com/hackercup/problem/403525256396727/ 2. http://www.geeksforgeeks.org/count-ways-reach-nth-stair/ 3. In english alphabet "a-z and A-Z" letters. As we know all numbers can be represented by a fibonacci number. 1 2 3 5 8 13 21 34 55 89 Suppose 6 = 5 + 1, can be encoded as 1001 16 = 13 + 3 = 100100 4 = 3 + 1 = 101 Similarly, all the letters "a-z and A-Z" should be converted to ASCII number then convert them to Fibonacci encoded number Then read decode them back to origonal character. H E L L O ASCII values of all the letters from (HELLO) Then covert them to corresponding binary values e.g H = 72 = 55 + 13 + 3 + 1 = 100100101 And add "1" (number 1) to end of all charcter to find out the number ends there. So H = 100100101 + 1 = 1001001011 (Not mathematical add, string add or append) 4. What you like to do in leisure time? 5. What you have done something interesting beyond your scope? 6. How do you manage a day in your place when you are heavily loaded? 7. Why are you looking for a change? ....
avatar

Senior Software Engineer

Interviewed at Honeywell

4.1★
Mar 27, 2017

Technical: 1. https://www.facebook.com/hackercup/problem/403525256396727/ 2. http://www.geeksforgeeks.org/count-ways-reach-nth-stair/ 3. In english alphabet "a-z and A-Z" letters. As we know all numbers can be represented by a fibonacci number. 1 2 3 5 8 13 21 34 55 89 Suppose 6 = 5 + 1, can be encoded as 1001 16 = 13 + 3 = 100100 4 = 3 + 1 = 101 Similarly, all the letters "a-z and A-Z" should be converted to ASCII number then convert them to Fibonacci encoded number Then read decode them back to origonal character. H E L L O ASCII values of all the letters from (HELLO) Then covert them to corresponding binary values e.g H = 72 = 55 + 13 + 3 + 1 = 100100101 And add "1" (number 1) to end of all charcter to find out the number ends there. So H = 100100101 + 1 = 1001001011 (Not mathematical add, string add or append) 4. What you like to do in leisure time? 5. What you have done something interesting beyond your scope? 6. How do you manage a day in your place when you are heavily loaded? 7. Why are you looking for a change? ....

Viewing 1091 - 1100 interview questions

Glassdoor has 665,594 interview questions and reports from Software engineer 2 interviews. Prepare for your interview. Get hired. Love your job.