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 …



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 …



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 …



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” …



Swapping, partitioning, and sorting algorithms in Java

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



800+ Java Interview Q&As

Prepare to fast-track & go places
with multi-offers to choose from & increased earning potential. Expand your horizons along the way by taking the road less travelled.
Learn by categories on the go...
Learn by categories such as FAQs – Core Java, Key Area – Low Latency, Core Java – Java 8, JEE – Microservices, Big Data – NoSQL, etc. Some posts belong to multiple categories.
Top