Blog Archives

03: Tree traversal algorithms in Java

Q1. What are the different binary tree traversal mechanisms? A1. Traversing a tree means visiting all the nodes of a tree in order. Many different binary tree algorithms involve traversals. For example, if you wish to count the number of employees in an organizational chart you must visit each node….

Read more ...


Java coding practice problems – prime and powerful

There is no other way to pass the Java coding tests other than practicing. I have failed Java coding tests due to lack of practice. How often do you get work with tree and graph data structures? Ho often do you work with algorithms?

50+ Java coding practice problems Links:

Can you write code in Java?Read more ...

Tags:

Searching algorithms in Java

This assumes that you understand “Swapping, partitioning, and sorting algorithms in Java”. Q1. Can you write a code to search for number 5 in 7 3 6 8 2 9 5 4? A1. The code below uses the linear search algorithm. The linear search algorithm’s two advantages are simplicity and…

Read more ...


Splitting input text & string processing coding Q&A

Q1. Can you write code to extract numbers from a given input text and return the sum of those numbers? Example: “1 some text 2 more text 4 more text 8” should return 15 as the sum. A The key steps are: 1. Split the given input into tokens. Split…

Read more ...


Swapping, partitioning, and sorting algorithms in Java

Q1. Can you write an algorithm in Java to swap two variables? A1.

Read more ...


500+ Java Interview FAQs

Java & Big Data Tutorials

Top