Skip to contentSkip to footer

Desarrollador Java Junior Interview Questions

Salaries
Interviews

716,806 desarrollador java junior interview questions shared by candidates

You have a function f(p) that returns an array of linked pages e.g f(homepage) = {page1, page2, page3}. Or f(page1) = {page4, page5}. If there is no linked pages function will return null. And we say one site is a good site if we can get to any page of that site in a less than 6 clicks. The task was to write a function that will check is it a good site or not using f(p).
avatar

Software Developer

Interviewed at Booking.com

4.1★
Dec 9, 2017

You have a function f(p) that returns an array of linked pages e.g f(homepage) = {page1, page2, page3}. Or f(page1) = {page4, page5}. If there is no linked pages function will return null. And we say one site is a good site if we can get to any page of that site in a less than 6 clicks. The task was to write a function that will check is it a good site or not using f(p).

1. Given an array of n integers. Derive an array where the value of the element at index i is the product of elements in the given array except element i in the given array. The complexity should be O(n). 2. How to traverse timing graph starting from the input nodes? Data structure of the nodes in the graph is given. Write a C program for it. 3. Implement C++ hashing function.
avatar

Software Engineer

Interviewed at Intel Corporation

3.9★
Dec 1, 2017

1. Given an array of n integers. Derive an array where the value of the element at index i is the product of elements in the given array except element i in the given array. The complexity should be O(n). 2. How to traverse timing graph starting from the input nodes? Data structure of the nodes in the graph is given. Write a C program for it. 3. Implement C++ hashing function.

Take a ladder with 5 steps, write a function that gives all the possible combinations of either 1,2, or 3 steps, in any order, to get to the 5th step, and returns the total number of combinations. So some of the possibilities would be [1,1,1,1,1], [1,1,1,2], [1,1,2,1], etc. Then he asked the same question with order not being considered, so [1,1,1,2] and [1,1,2,1] are the same solution.
avatar

Software Engineer

Interviewed at Walmart

3.4★
Jul 16, 2013

Take a ladder with 5 steps, write a function that gives all the possible combinations of either 1,2, or 3 steps, in any order, to get to the 5th step, and returns the total number of combinations. So some of the possibilities would be [1,1,1,1,1], [1,1,1,2], [1,1,2,1], etc. Then he asked the same question with order not being considered, so [1,1,1,2] and [1,1,2,1] are the same solution.

Viewing 1131 - 1140 interview questions

Glassdoor has 716,806 interview questions and reports from Desarrollador java junior interviews. Prepare for your interview. Get hired. Love your job.