It is very easy to crack a Java interview if you are aware of some of the commonly asked programs. I have compiled a list of Java programs that a candidate should know in order to crack any typical coding interview.
This is applicable for experienced as well as freshers out there. Believe me, once I was done with this list, I had many offers from reputed companies.
One more message for all the people out there is that, if you don’t clear an interview then there is no need to be discouraged. You are one step ahead of everyone who has not even attempted the interview. All these failures will give you the confidence to crack your dream company interview.
So, enough talk. We will get started with the simple programs first and then move on to the advanced programs.
Let’s get our hands dirty with some algorithms and programs.
- Find duplicate characters in a string
- Reverse a number
- Check whether a given number is prime or not
- Find Sum of each digit in the given number using recursion
- Find the sum of first 1000 prime numbers
- Sort a map by value
- Find top two maximum numbers in an array
- Swap two numbers without using temporary variable
- Check if the given number is Armstrong number or not
- Convert to binary to decimal number
I think we had enough warm-up. Let’s dive into the world of algorithms.
Analysis Of Algorithms:
- Asymptotic Analysis
- Worst, Average and Best Cases
- Asymptotic Notations
- Little o and little omega notations
- Analysis of Loops
- Solving Recurrences
- Amortized Analysis
- What does ‘Space Complexity’ mean?
- Pseudo-polynomial Algorithms
- NP-Completeness Introduction
- Polynomial Time Approximation Scheme
- A Time Complexity Question
- Time Complexity of building a heap
- Time Complexity where loop variable is incremented by 1, 2, 3, 4 ..
- Time Complexity of Loop with Powers
- Performance of loops (A caching question)
Keep a watch on this section for more algorithms.
Until then Happy Coding!