Knowing keywords of a programming language is very important to understand its features, and Java has rich set of keyword, going along with rich set of functionalities. The first keyword, I learn while writing Java program was public, static and void, not surprisingly they are picked from main method. Our instructor explained meaning of each keyword, saying that its, always remember why main is public, static and void main Java.
How to remove duplicate(s) from linked list in Java? Example Tutorial
Hello guys, if you are wondering how to find duplicates in a given linked list
in Java then you have come to the right place. In the past, I have explained
how to reverse a linked list in Java, find kth element from tail in linked list, find cycle on linked list, and in this article, I will show you how to find duplicate nodes in a given
linked list. This is one of the classic linked list coding problem and I have
also included this in my list of
30 common linked list problems
for programmers. You can further check that list to practice more linked list
programs and improve your understanding of linked lists and how to solve those
problems. But, before we get into details of finding and printing duplicate
nodes from the given linked list let's start with the basics.
How to Find Greatest Common Divisor of two numbers in Java - [ Euclid's algorithm GCD Example]
How to find the Greatest Common Divisor of two numbers in Java
Simple Java program to find GCD (Greatest Common Divisor) or GCF (Greatest Common Factor) or HCF (Highest common factor). The GCD of two numbers is the largest positive integer that divides both the numbers fully i.e. without any remainder. There are multiple methods to find GCD, GDF, or HCF of two numbers but Euclid's algorithm is very popular and easy to understand, of course, only if you understand how recursion works. Euclid's algorithm is an efficient way to find the GCD of two numbers and it's pretty easy to implement using recursion in the Java program. According to Euclid's method GCD of two numbers, a, b is equal to GCD(b, a mod b) and GCD(a, 0) = a.
Subscribe to:
Posts (Atom)