Skip to contentSkip to footer

Softwareentwickler Java Interview Questions

Salaries
Interviews

512,860 softwareentwickler java interview questions shared by candidates

In a sequence of alphabets (like aaabbddaabbcc) write a program to find the number of the consecutive alphabets in and print the alphabet and number. example :if input is aaabbddaabbcc then output should be 3a, 2b, 2d, 2a, 2b, 2c
avatar

Software Development Engineer In Test (SDET)

Interviewed at Microsoft

4★
May 24, 2012

In a sequence of alphabets (like aaabbddaabbcc) write a program to find the number of the consecutive alphabets in and print the alphabet and number. example :if input is aaabbddaabbcc then output should be 3a, 2b, 2d, 2a, 2b, 2c

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

Describe oops concept.What you know about collections.3rd highest salary.find only numbers in alphanumeric string,remove space with in word in string.which is the best way to retrieve using hashmap.how to make immutable class,all methods of object class
avatar

Software Engineer

Interviewed at Yodlee

3.6★
Apr 3, 2016

Describe oops concept.What you know about collections.3rd highest salary.find only numbers in alphanumeric string,remove space with in word in string.which is the best way to retrieve using hashmap.how to make immutable class,all methods of object class

-given a binary tree, and a number in each node. Select the nodes that will maximize the overall sum such that if a node is selected its parent and children cannot be selected. Return the sum of the selected nodes. - The buildings in a a city can be represented in 2D by linear array. Given an array that represents the heights of the buildings such that the value in a specific index in the array indicates the height of the building at that location in the city. How much rain will gather in the city if it rains?
avatar

Software Engineer

Interviewed at Altera

3.4★
May 6, 2015

-given a binary tree, and a number in each node. Select the nodes that will maximize the overall sum such that if a node is selected its parent and children cannot be selected. Return the sum of the selected nodes. - The buildings in a a city can be represented in 2D by linear array. Given an array that represents the heights of the buildings such that the value in a specific index in the array indicates the height of the building at that location in the city. How much rain will gather in the city if it rains?

Viewing 1131 - 1140 interview questions

Glassdoor has 512,860 interview questions and reports from Softwareentwickler java interviews. Prepare for your interview. Get hired. Love your job.