Skip to contentSkip to footer

Junior Java Softwareentwickler Interview Questions

Salaries
Interviews

64 junior java softwareentwickler interview questions shared by candidates

first round: technical coding test You will be provided with an input file which defines a graph and a series of questions relating to the graph. Your program will need to read this input file and output the answers to an output file. Input The program must accept a single argument, a path to the input file. e.g. "~/input.txt” The input file will be structured as follows: The first line will be the graph definition, a single line of routes separated by spaces. A route will be defined as AC5 (i.e. The distance from A to C is 5). Following the problem definition each line will represent one of the following questions (The routes included in these questions are examples only). DISTANCE CBAE What is calculated distance of the route CBAE? The answer should be the route, including distance. i.e. CBAE12 SHORTEST CA What is the shortest route from C to A? The answer should be the route, including distance. i.e. CBA12 POSSIBLE CA15 What are the possible routes from C to A with a maximum distance of 15? The answer should be all routes, including distances, separated by spaces. i.e. CBA8 CBADA12 CBDA11 CBDADA15 CEA12 CBEA15 The input file can contain any number of questions, in any order. Please find an example ‘input.txt' attached. Output Output the answers to a file named 'output.txt', one answer per line, in the following format: DISTANCE CBAE = CBAE12 The solution should be written in Java. You may only use external libraries or tools for the purposes of testing and building your program (e.g. JUnit, Ant, Maven). Keep in mind that the solution is not the only aspect of your code we will be looking for. While we understand that this is a relatively small problem, we expect object-oriented, production quality code that is runnable, testable, extendable and reusable. You do not need to gold-plate your solution, however you should keep in mind potential extensions when designing and developing the solution. Please submit a zipped file containing the source code and a README file. The README should contain the following: A short description of your solution Any assumptions you have made Instructions for compiling and running the program as a zipped file.
avatar

Junior Java Software Engineer

Interviewed at Loc8.com

4.6★
Feb 2, 2015

first round: technical coding test You will be provided with an input file which defines a graph and a series of questions relating to the graph. Your program will need to read this input file and output the answers to an output file. Input The program must accept a single argument, a path to the input file. e.g. "~/input.txt” The input file will be structured as follows: The first line will be the graph definition, a single line of routes separated by spaces. A route will be defined as AC5 (i.e. The distance from A to C is 5). Following the problem definition each line will represent one of the following questions (The routes included in these questions are examples only). DISTANCE CBAE What is calculated distance of the route CBAE? The answer should be the route, including distance. i.e. CBAE12 SHORTEST CA What is the shortest route from C to A? The answer should be the route, including distance. i.e. CBA12 POSSIBLE CA15 What are the possible routes from C to A with a maximum distance of 15? The answer should be all routes, including distances, separated by spaces. i.e. CBA8 CBADA12 CBDA11 CBDADA15 CEA12 CBEA15 The input file can contain any number of questions, in any order. Please find an example ‘input.txt' attached. Output Output the answers to a file named 'output.txt', one answer per line, in the following format: DISTANCE CBAE = CBAE12 The solution should be written in Java. You may only use external libraries or tools for the purposes of testing and building your program (e.g. JUnit, Ant, Maven). Keep in mind that the solution is not the only aspect of your code we will be looking for. While we understand that this is a relatively small problem, we expect object-oriented, production quality code that is runnable, testable, extendable and reusable. You do not need to gold-plate your solution, however you should keep in mind potential extensions when designing and developing the solution. Please submit a zipped file containing the source code and a README file. The README should contain the following: A short description of your solution Any assumptions you have made Instructions for compiling and running the program as a zipped file.

2nd Interview: follow up phone call discussing the solution -what if we want to add more question types other than (DISTANCE ,SHORTEST ,POSSIBLE ) -what if we want to change the argument type ? (to be something else other than String)
avatar

Junior Java Software Engineer

Interviewed at Loc8.com

4.6★
Feb 2, 2015

2nd Interview: follow up phone call discussing the solution -what if we want to add more question types other than (DISTANCE ,SHORTEST ,POSSIBLE ) -what if we want to change the argument type ? (to be something else other than String)

Test Questions: 1. Sum TotalSpeed given data is degree and speed according every degree and it can solve by MAP with respected key(Degree) and value(Speed). 2. Remove Special Character and also number and also every first char is capital Input -> String[] words = {"hello!", "world@", "java#", "programming$", "is^fun"}; Output -> {Hello, World, Java, Programming, is, Fun} 3. sort the array and shift the all zeros in last. 4. Adjust Array means array given and you have to tell the highest number of array and adjust those less number then highest number in way that if we sum answerer should be highest number Adjusted Array: 3 6 0 0 9 4 5 Before Sum: 9, After Sum: 9 5. write the program for the loan management like 4000 loan fixed amount is 10%(400) and with 3% interest and remaining balance like second month 3600 interest will charged on that amount. ------------------------------------------------------------------- In interview they will asked LeetCode questions, at least first 50 questions of easy and hard. -> Unbalanced/ Balanced bracket ()}, {()} -> Remove duplicates from array (Two Pointer) -> Reverse whole statement not character -> Middle element of the linked List and data is in singly linked List
avatar

Junior Backed Developer / Software Engineer / java Spring Boot

Interviewed at Sofstica

3.9★
Dec 21, 2024

Test Questions: 1. Sum TotalSpeed given data is degree and speed according every degree and it can solve by MAP with respected key(Degree) and value(Speed). 2. Remove Special Character and also number and also every first char is capital Input -> String[] words = {"hello!", "world@", "java#", "programming$", "is^fun"}; Output -> {Hello, World, Java, Programming, is, Fun} 3. sort the array and shift the all zeros in last. 4. Adjust Array means array given and you have to tell the highest number of array and adjust those less number then highest number in way that if we sum answerer should be highest number Adjusted Array: 3 6 0 0 9 4 5 Before Sum: 9, After Sum: 9 5. write the program for the loan management like 4000 loan fixed amount is 10%(400) and with 3% interest and remaining balance like second month 3600 interest will charged on that amount. ------------------------------------------------------------------- In interview they will asked LeetCode questions, at least first 50 questions of easy and hard. -> Unbalanced/ Balanced bracket ()}, {()} -> Remove duplicates from array (Two Pointer) -> Reverse whole statement not character -> Middle element of the linked List and data is in singly linked List

Viewing 21 - 30 interview questions

Glassdoor has 64 interview questions and reports from Junior java softwareentwickler interviews. Prepare for your interview. Get hired. Love your job.