Write a java program to reverse a string using recursion. In this tutorial, I am going to explain how to write a java code which reverse an input string using recursion. I have also added the video at the end of this tutorial.
For example :
Input String: Object
Output String: tcejbO
Write a java program to find the second highest number in an array. Given an unsorted array, we have to write a java code to find the second highest number in an array.
Write a Java program to find GCD of two numbers using Recursion. Given two input integers, we have to write a code to find GCD of two numbers using recursion. For this program, I assume you are familiar with the concept of recursion. If you don’t know about recursion then check my previous post on recursion vs iteration.
In this article, we are going to implement bubble sort program in java. Bubble sort is a simple sorting algorithm which is used to sort an unsorted array.
We are going to cover following points in this tutorial.
i) What is Bubble Sort Algorithm?
ii) Bubble sort implementation in java (We sort an unsorted array using bubble sort algorithm).
iii) Bubble sort video tutorial.
Write a java program to find first non-repeated character in a string. Given an input string, find it’s first non-repeated character in a string.
For example –
i) Input string – java
Output – j (j is the first non-repeating character in a string)
ii) Input string – web rewrite
Output – b (b is the first non-repeating character in a string)
Write a anagram program in java or Java program to check anagram. In this programming question, we are going to write a java code to check whether two strings are anagrams of each other.
Let’s first understand what is an anagram? and how we are going to solve this problem.
What is an Anagram?
Two strings are said to be anagrams of each other if it contains the same characters, only the order of characters in both the strings is different. In other words, both strings must contain the same exact letters in the same exact frequency.
How to check prime number in Java. In this tutorial, we are going to write a Java program to check whether a number is prime or not. Also In this tutorial, we’ll discuss multiple approaches and their time complexity to solve this problem.
Before writing a program, let’s quickly understand what is a prime number.
What is Prime Number?
A prime number is a number that is greater than 1 and it has no positive divisors other than 1 and itself.
For example – 3, 13, 7 is a prime number, as it’s divisible by 1 and itself. Similarly, 29, 19 etc. are also prime numbers.
6 is not a prime number as it’s divisible by 1, 2, 3 and 6.
2 is the only even prime number.
How to Check whether a Number is Prime or not in Java
Write a java program to print Fibonacci series up to N number, where N is the input integer. In this tutorial, We are going to write a java code to print fibonacci series.
Write a program to print 1 to 100 numbers without using loop. Using loop, (for and while loop) we can easily solve this problem. Think for a moment how do you solve this problem without using a loop. We can solve this problem using recursion.
Find Pair of Elements in an Array whose Sum is Equal to given number. Given an array of n integers and a number x, We have to write a code to find a pair of elements(a,b) in an array whose sum is equal to a given number x.