Anagram Program in Java : Check whether Two Strings are Anagrams of each other

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.

C Program to Check whether a Number is Prime or Not

Write a c program to check whether a number is prime or not. In this tutorial, we are going to write a c program to check whether an input number is prime or not.

Subscribe Our Tutorials

Get Latest Updates on Facebook

Given an integer, Write an efficient c code to check whether a number is prime or not.

C Program to Print Prime Numbers from 1 to N – Sieve of Eratosthenes

Write a c program to print prime numbers from 1 to N (where n is an integer). This question can also be asked like, print prime numbers from 1 to 100 in c. In this tutorial, we are going to use sieve algorithm to print prime numbers from 1 to N.

Suppose the value of N is 10, So the prime numbers between 1 to 10 is 2, 3, 5, 7.

Now, Let’s learn how to print prime numbers from to 1 to N using Sieve of Eratosthenes. Before solving this program, let’s understand what is a prime number.

MCQ on Recursion – Recursion Objective Questions for Practice

MCQ on Recursion

Recursion is the most important concept in computer science. In this tutorial, You’ll find practice questions related to recursion.

Recursion video tutorials

In my previous posts, i have written about binary search implementation using recursion and difference between recursion and iteration.

These MCQ helps you to understand the concept of Recursion.

1) Which Data Structure is used to perform Recursion?

a) Queue
b) Stack
c) Linked List
D) Tree