Java Online Test

TestDome skill assessments are used by more than 6,000 companies and 450,000 individual test takers.

Jobseekers: Get a Certificate

Take a Practice Test

Companies: Try First, Pay Later

Sign Up To Use This Test

The Java online test assesses candidates' knowledge of programming in the Java language and their ability to leverage commonly used parts of the Java Class Library.

It's an ideal test for pre-employment screening. A good Java developer needs to be able not only to solve problems using Java but also recognize when to leverage the functionality provided by the Java Class Library to write robust and maintainable code.

This online test requires candidates to solve coding problems in Java and find and fix bugs in a Java program.

Recommended Job Roles
Back-End Developer
Java Developer
Web Developer
Sample Candidate Report

Sample Free Questions

Alert Service

10min
  -  
Easy  
  -  
CODE

Java Interfaces Inversion of control Refactoring Public

Refactor the AlertService and MapAlertDAO classes:

  • Create a new package-private interface, named AlertDAO, that contains the same methods as MapAlertDAO.
  • MapAlertDAO should implement the AlertDAO interface.
  • AlertService should have a constructor that accepts AlertDAO.
  • The raiseAlert and getAlertTime methods should use the object passed through the constructor.

Merge Names

10min
  -  
Easy  
  -  
CODE

Java Arrays Public

Implement the uniqueNames method. When passed two arrays of names, it will return an array containing the names that appear in either or both arrays. The returned array should have no duplicates.

For example, calling MergeNames.uniqueNames(new String[]{'Ava', 'Emma', 'Olivia'}, new String[]{'Olivia', 'Sophia', 'Emma'}) should return an array containing Ava, Emma, Olivia, and Sophia in any order.

Binary Search Tree

15min
  -  
Easy  
  -  
CODE

Java Algorithmic thinking Recursion Tree Public

A three-node binary tree.Binary search tree (BST) is a binary tree where the value of each node is larger or equal to the values in all the nodes in that node's left subtree and is smaller than the values in all the nodes in that node's right subtree.

Write a function that, efficiently with respect to time used, checks if a given binary search tree contains a given value.

For example, for the following tree:

  • n1 (Value: 1, Left: null, Right: null)
  • n2 (Value: 2, Left: n1, Right: n3)
  • n3 (Value: 3, Left: null, Right: null)

Call to contains(n2, 3) should return true since a tree with root at n2 contains number 3.

Use Free Questions On a Trial Plan

Premium Questions

The premium question library contains our unique, hand-crafted questions. We offer a refund if you find any of them answered online.

Questions
Document Store, Needle, Driver Exam, Read First Line, Shipping, Max Sum, Paper Strip, Unloading Trucks, Read Write Execute, Shining Star, Runner, Segment, Chain Link, Crop Ratio, Date Transform, Document Counter, Veterinarian, Hobbies, Internal Nodes, Log Parser, Node, Paragraph, Platformer, Product, Racer, Remove Repetitions, Snapshot, Snow Storm, Stack to List, Test Results, Ship, Unique Product, Unique Numbers, Username, Utilities, Weighted Average, Language Teacher, Book Sale, Friend, Shelf Test, Moving Total, Kilometer Converter, Stories, Hen
Skills
Java Bug fixing Language Stream Strings Exceptions Arithmetic Algorithmic thinking Arrays Sorting TDD Memory management Linked list Integer division Regex OOP Refactoring Queue HashMap Iteration Lists Tree Serialization XML Recursion Data structures Accessibility levels Multithreading Synchronization StringBuilder ArrayList Complexity Stack Stream API Class modifiers Inheritance Graphs Test case design Unit testing HashSet Method overriding Dynamic programming Higher order function Interfaces
Score Distribution
# of candidates
0-33%
34-66%
67-100%
Score
Pricing For Premium Questions