Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
0% found this document useful (0 votes)
4 views

JavaCodes

Uploaded by

ulookamazing6
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
4 views

JavaCodes

Uploaded by

ulookamazing6
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 19

1|Page

HashMapHashSet

1. Hashmap.java---- 2
2. RemoveDuplicatesInArray.java---- 2

NumberArrays

1. EvenOddCount.java---- 3
2. FirstLargestInArray.java---- 3
3. LargestandSmallestElement.java---- 4
4. MinMaxOfArray.java---- 4
5. nonRepeatedEleArray.java---- 5
6. SearchElemInArray.java---- 5
7. SecondLargestInArray.java---- 6
8. SumOfNumsArray.java---- 6

Numbers

1. ArmstrongNumber.java---- 7
2. CountOfEvenOddNumbers.java---- 7
3. Factorial.java---- 8
4. FibonacciSeries.java---- 8
5. GivenNumOddOrEven.java---- 9
6. NumberReverse.java---- 9
7. Palindrome.java---- 10
8. PrimeOrNot.java---- 10
9. SumOfDigits.java---- 11
10. SwappingOfNumbers.java---- 11
11. SwapWithout3rdVariable.java---- 12
12. TotalNumberOfDigits.java---- 12

StringArrays

1. Anagram.java---- 13
2. CountOfRepeatedWords.java---- 13
3. DuplicateCharsCount.java---- 14
4. EachWordReverseInString.java---- 14
5. FirstNonRepeatedChar.java---- 15
6. NonRepeatedChars.java---- 15
7. NoOfCharsInString.java---- 16
8. PermutationsOfGivenString.java---- 16
9. RemoveDupCharsInString.java---- 17
2|Page

Strings

1. CountNoOfWordsInString.java---- 17
2. CountOfGivenChar.java---- 18
3. Pyramid.java---- 18
4. StringReverse.java---- 18

Hashmap.java----
package HashMapHashSet;
import java.util.HashMap;
import java.util.Map;

public class Hashmap {

public static void main(String[] args) {


HashMap<Integer,String> a=new HashMap<>();
a.put(1,"soujanya");
a.put(2,"tulasi");
a.put(3,"ram");
a.put(4,"lavanya");
// System.out.println(a.get(1));
for(Map.Entry<Integer,String> b:a.entrySet()) {
System.out.println("Key is: "+b.getKey()+" Value is: "+b.getValue());
}
}
}

RemoveDuplicatesInArray.java----
package HashMapHashSet;

import java.util.HashSet;
import java.util.Set;

public class RemoveDuplicatesInArray {

public static void main(String[] args) {


int a[]= {1,2,1};
Set<Integer> b=new HashSet<>();
for(int num: a) {
b.add(num);
}
System.out.println(b);
}
}
3|Page

EvenOddCount.java
package NumberArrays;
import java.util.Arrays;

public class EvenOddCount {

public static void main(String[] args) {


int a[]= {1,2,2};
Arrays.sort(a);
int evencount=0;
int oddcount=0;
for(int i=0;i<a.length;i++)
{
if(a[i]%2==0)
{
evencount=evencount+1;
}else {
oddcount=oddcount+1;
}
}
System.out.println("even numbers is "+evencount);
System.out.println("odd numbers is "+oddcount);
}

FirstLargestInArray.java
package NumberArrays;

public class FirstLargestInArray {

public static void main(String[] args) {


int a[]= {2,9,3,4,1,10};
int first=a[0];
for(int i=1;i<a.length;i++)
{
if(a[i]>first)
{
first=a[i];
}
}
System.out.println(first);

}
4|Page

LargestandSmallestElement.java----
package NumberArrays;

public class LargestandSmallestElement {

public static void main(String[] args) {


int a[]= {2,1,3,6,9,7,0};
int largest=a[0];
int smallest=a[0];
for(int i=0;i<a.length;i++) {
if(a[i]>largest) {
largest=a[i];
}
if(a[i]<smallest) {
smallest=a[i];
}
}System.out.println("Largest number is "+largest);
System.out.println("smallest number is "+smallest);
}
}

MinMaxOfArray.java----
package NumberArrays;

public class MinMaxOfArray {

public static void main(String[] args) {


int a[]= {1,2,3,4,5,9};
int max=a[0];
int min=a[0];
for(int i=1;i<a.length;i++) {
if(a[i]>max) {
max=a[i];
}
}System.out.println(max);
for(int i=1;i<a.length;i++) {
if(a[i]<min) {
min=a[i];
}
}System.out.println(min);
}
}
5|Page

nonRepeatedEleArray.java----
package NumberArrays;
import java.util.Arrays;

public class nonRepeatedEleArray {

public static void main(String[] args) {


int a[]= {1,1,2,2,3,4,5,5,6,6};
Arrays.sort(a);
for(int i=0;i<a.length;i++) {
int count=0;
for(int j=0;j<a.length;j++) {
if(a[i]==a[j]) {
count=count+1;
}
}
if(count==1) {
System.out.println(a[i]);
}
}
}
}

SearchElemInArray.java----
package NumberArrays;

public class SearchElemInArray {

public static void main(String[] args) {


int a[]= {1,2,3,4,5};
int searchelem=5;
boolean flag=false;
for(int i=0;i<a.length;i++) {
if(a[i]==searchelem) {
System.out.print("Element is found at index: " +i);
flag=true;
break;
}
}if(flag==false) {
System.out.print("Element is not found");
}
}
}
6|Page

SecondLargestInArray.java----
package NumberArrays;

public class SecondLargestInArray {

public static void main(String[] args) {


int a[] = { 8, 2, 7, 9, 5, 6, 10, 11 };
int first = a[0];
int second = a[0];
for (int i = 1; i < a.length; i++)
{
if (a[i] > first)
{
second = first;
first = a[i];
} else if (a[i] > second)
{
second = a[i];
}
}
System.out.println(second);
}
}

SumOfNumsArray.java----
package NumberArrays;

public class SumOfNumsArray {

public static void main(String[] args) {


String[] a= {"1","q","#","5"};
int sum=0;
for(String element:a) {
try {
int num=Integer.parseInt(element);
sum=sum+num;
}
catch(NumberFormatException e){
//ignore noninteger elements

}
}System.out.print(sum);
}
}
7|Page

ArmstrongNumber.java----
package Numbers;

public class ArmstrongNumber {

public static void main(String[] args) {


// 153 is with 1 cube+5 cube+3 cube=153
int num= 153;
int d=num;
int arm = 0;
int a,b;
while (num>0) {
a=num%10;//take last num
num=num/10;//remove last num
arm=arm+a*a*a;
}
if (d==arm) {
System.out.println("Given Number is armstrong");
} else {
System.out.println("Given Number is not armstrong");
}
}
}

CountOfEvenOddNumbers.java----
package Numbers;

public class CountOfEvenOddNumbers {


public static void main(String[] args) {
int num = 22213;
int even = 0;
int odd = 0;
while (num > 0) {
int res = num % 10;
if (res % 2 == 0) {
even++;
} else {
odd++;
}
num = num / 10;
}
System.out.println("Even count is " + even);
System.out.println("Odd count is " + odd);
}
}
8|Page

Factorial.java----
package Numbers;

public class Factorial {

public static void main(String[] args) {

int num = 5;

long factorial = 1;

for (int i = 1; i <= num; i++) {

factorial = factorial * i;

System.out.println(factorial);

FibonacciSeries.java----
package Numbers;

public class FibonacciSeries {

public static void main(String[] args) {


// 0 1 1 2 3 5 8

int n1=0;
int n2=1;
int sum=0;
System.out.print(n1+" "+n2);
for(int i=2;i<=10;i++) {
sum=n1+n2;
System.out.print(" "+sum);
n1=n2;
n2=sum;
}
}
}
9|Page

GivenNumOddOrEven.java----
package Numbers;

public class GivenNumOddOrEven {

public static void main(String[] args) {


int a=2021;
if(a%2==0) {
System.out.print("Given number "+a+" is prime");
}else {
System.out.print("Given number "+a+" is not prime");
}

}
}

NumberReverse.java----
package Numbers;

public class NumberReverse {

public static void main(String[] args) {


int num=1234;
int reverse=0;
while(num!=0)
{
reverse=reverse*10+num%10;//take remainder which is last num
num=num/10;//remove last num
}
System.out.print("Reverse number is "+reverse);
}

}
10 | P a g e

Palindrome.java----
package Numbers;

public class Palindrome {

public static void main(String[] args) {


int num = 121;
int orgnum = num;
int rev = 0;
while (num != 0) {
rev = rev * 10 + num % 10;
num = num / 10;// remove last digit
}
if (rev == orgnum) {
System.out.print("Number is palindrome");
} else {
System.out.print("Number is not palindrome");
}
}
}

PrimeOrNot.java----
package Numbers;

public class PrimeOrNot {

public static void main(String[] args) {


int a=4;
int count=0;
for(int i=1;i<=a;i++) {
if(a%i==0) {
count=count+1;
}
}
if(count==2) {
System.out.println("Given number is prime");
}
else {
System.out.println("Given number is not prime");
}
}

}
11 | P a g e

SumOfDigits.java----
package Numbers;

public class SumOfDigits {

public static void main(String[] args) {


int num = 123;
int sum = 0;
while (num > 0) {
sum = sum + num % 10;// gives last digit of number
num = num / 10;// removes last digit
}
System.out.print(sum);

SwappingOfNumbers.java----
package Numbers;

public class SwappingOfNumbers {

public static void main(String[] args) {


int a=123;
int b=456;
System.out.println("Values before swapping are:" +a+" "+b);
int c=a;
a=b;
b=c;
System.out.println("Values after swapping are:" +a+" "+b);
}
}
12 | P a g e

SwapWithout3rdVariable.java----
package Numbers;

public class SwapWithout3rdVariable {

public static void main(String[] args) {


int a=5;
int b=10;
System.out.println("Numbers Before Swipping: "+a+" "+b);
a=a+b;
b=a-b;
a=a-b;
System.out.println("Numbers After Swipping: "+a+" "+b);

TotalNumberOfDigits.java----
package Numbers;

public class TotalNumberOfDigits {

public static void main(String[] args) {


int num=12345;
int total=0;
while(num>0)
{
num=num/10;//remove last digit one by one
total++;
}
System.out.print(total);
}

}
13 | P a g e

Anagram.java----
package StringArrays;
import java.util.Arrays;
public class Anagram {
//Anagram is formation of word with same letters given words
public static void main(String[] args) {
String a = "army";
String b = "Mary";
char[] c = a.toLowerCase().toCharArray();
char[] d = b.toLowerCase().toCharArray();
Arrays.sort(c);
Arrays.sort(d);
if (Arrays.equals(c, d)) {
System.out.print("Given strings are anagram");
}
else {
System.out.print("Given strings are not anagram");
}
}
}
CountOfRepeatedWords.java----
package StringArrays;
public class CountOfRepeatedWords {
public static void main(String[] args)
{
String a = "hi hi souji";
String b[] = a.split(" ");
int count;
for (int i = 0; i < b.length; i++)
{
count = 1;
for (int j = i + 1; j < b.length; j++)
{
if (b[i].equals(b[j]))
{
count = count + 1;
b[j] = "0";
}
}
if (b[i] != "0") {
System.out.println("Number of occurances of given string " + b[i] + " is: "
+ count);
}
}
}
}
14 | P a g e

DuplicateCharsCount.java----
package StringArrays;

public class DuplicateCharsCount {

public static void main(String[] args) {

String a = "ccccccharacters";
char[] b = a.toCharArray();
int count;
for (int i = 0; i < b.length; i++) {
count = 1;
for (int j = i + 1; j < b.length; j++) {
if (b[i] == b[j]) {
count = count + 1;
b[j] = 0;
}
}
if (b[i] != 0) {
System.out.println(b[i] + " is: " + count);
}
}
}
}

EachWordReverseInString.java----
package StringArrays;

public class EachWordReverseInString {

public static void main(String[] args) {


String a="java program is very easy";
String[] b=a.split(" ");
String rev="";
for(int i=0;i<b.length;i++) {
String c=b[i];
String revword="";
for(int j=c.length()-1;j>=0;j--) {
char ch=c.charAt(j);
revword=revword+ch;
}rev=rev+revword+" ";
}System.out.println(a);
System.out.println(rev);
}
}
15 | P a g e

FirstNonRepeatedChar.java----
package StringArrays;
public class FirstNonRepeatedChar {
public static void main(String[] args) {
String a="hiibe";
char[] b=a.toCharArray();
char nondups=' ';
int count=0;
for(int i=0;i<b.length;i++) {
count=1;
for(int j=i+1;j<b.length;j++) {
if(b[i]==b[j]) {
count=count+1;
b[j]=0;
}
}
if(b[i]!=0) {
if(count<=1) {
System.out.println(b[i]);
}
}
}
}
}

NonRepeatedChars.java----
package StringArrays;
public class NonRepeatedChars {
public static void main(String[] args) {
String a="hii";
char[] b=a.toCharArray();
int count=0;
for(int i=0;i<b.length;i++) {
count=1;
for(int j=i+1;j<b.length;j++) {
if(b[i]==b[j]) {
count=count+1;
b[j]=0;
}
}
if(b[i]!=0) {
if(count<=1)
System.out.println(b[i]);
}
}
}
}
16 | P a g e

NoOfCharsInString.java----
package StringArrays;

public class NoOfCharsInString {

public static void main(String[] args) {


String a="Soujanya";
char[] b=a.toCharArray();
int count=0;
for(int i=0;i<b.length;i++) {
count=1;
for(int j=i+1;j<b.length;j++) {
if(b[i]==b[j]) {
count=count+1;
b[j]=0;
}
}
if(b[i]!=0) {
System.out.println(b[i]+" has "+count+" characters");
}
}
}
}

PermutationsOfGivenString.java----
package StringArrays;

public class PermutationsOfGivenString {

public static void main(String[] args) {


String a="abcd";
String prefix="";
String c="";
if(a.length()==0) {
System.out.println(prefix);
}else
{
for(int i=0;i<a.length();i++)
{
String b=a.substring(0,i)+a.substring(i+1);
c=prefix+a.charAt(i);
}
}
}
}
17 | P a g e

RemoveDupCharsInString.java----
package StringArrays;

public class RemoveDupCharsInString {

public static void main(String[] args) {


String a="cchharacter";
char[] b=a.toCharArray();
int count=0;
for(int i=0;i<b.length;i++) {
count=1;
for(int j=i+1;j<b.length;j++) {
if(b[i]==b[j]) {
count=count+1;
b[j]=0;
}
}
if(b[i]!=0) {
if(count==1 || count>1) {
System.out.println(b[i]);
}
}
}
}
}

CountNoOfWordsInString.java----
package Strings;

public class CountNoOfWordsInString {

public static void main(String[] args) {


String a="Hi Hello How r";
int count=1;
for(int i=0;i<a.length()-1;i++) {
if(a.charAt(i)==' ' && a.charAt(i+1)!=' ') {
count=count+1;
}
}
System.out.println(count);
}
}
18 | P a g e

CountOfGivenChar.java----
package Strings;

public class CountOfGivenChar {


public static void main(String[] args) {
String a = "Soujanyapanasa";
int totalcount = a.length();
int afterremovechar = (a.replace("a", "")).length();
int countofwantedchar = totalcount - afterremovechar;
System.out.println("Number of occurances of given char is " + countofwantedchar);
}
}

Pyramid.java----
package Strings;

public class Pyramid {


public static void main(String[] args) {
for (int i = 0; i <= 5; i++) {
System.out.print("");// to start row
for (int j = 1; j <= i; j++) {
System.out.print("* ");// to print *
}
System.out.println();// to move next line
}
}
}

StringReverse.java----
package Strings;

public class StringReverse {

public static void main(String[] args) {


String a = "ABCD";
String rev = "";

for (int i = a.length() - 1; i >= 0; i--) {


rev = rev + a.charAt(i);
}
System.out.println(rev);
}
}
19 | P a g e

You might also like