Scribd
Upload
16 views10 pages

Tcs 15m

The document contains multiple Java programs that perform various string and number manipulations, including finding duplicate characters, removing whitespaces, counting occurrences of characters, reversing strings, calculating Fibonacci series, checking for perfect squares, finding HCF and LCM, calculating factorials, checking for prime numbers, and identifying palindromes and Armstrong numbers. Additional functionalities include counting digits, vowels, and consonants in strings, as well as checking for anagrams. Each program is encapsulated in a separate class with a main method that utilizes the Scanner class for user input.

Uploaded by

sk
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
16 views10 pages

Tcs 15m

The document contains multiple Java programs that perform various string and number manipulations, including finding duplicate characters, removing whitespaces, counting occurrences of characters, reversing strings, calculating Fibonacci series, checking for perfect squares, finding HCF and LCM, calculating factorials, checking for prime numbers, and identifying palindromes and Armstrong numbers. Additional functionalities include counting digits, vowels, and consonants in strings, as well as checking for anagrams. Each program is encapsulated in a separate class with a main method that utilizes the Scanner class for user input.

Uploaded by

sk
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 10

//print dup chars in a string

import java.util.*;
public class soln2 {
public static void main(String[] args){
Scanner sc=new Scanner(System.in);
String a=sc.nextLine();
char[] z=a.toCharArray();
System.out.println("dup chars are");
boolean[] visited=new boolean[256];
boolean f=false;
for(int i=0;i<a.length();i++){
int count=0;
if(visited[z[i]] ||z[i]==' '){
continue;
}
for(int j=i+1;j<a.length();j++){
if(z[i]==z[j]){
count++;
}
}
if(count>0){
System.out.print(z[i]);
visited[z[i]]=true;
f=true;
}

}
if(!f){
System.out.println("no dup");
}
sc.close();
}
}

//remove all whitespaces


import java.util.*;
public class soln2 {
public static void main(String[] args){
Scanner sc=new Scanner(System.in);
String a=sc.nextLine();
a=a.replaceAll("\\s", "");
System.out.println(a);
}
}
//occurence of a string
import java.util.*;
public class soln2 {
public static void main(String[] args){
Scanner sc=new Scanner(System.in);
String a=sc.nextLine();
int counter[]=new int[256];
for(int i=0;i<a.length();i++){
counter[(int)a.charAt(i)]++;
}
for(int i=0;i<256;i++){
if(counter[i]!=0){
System.out.println((char)i+"-->"+counter[i]);
}
}
}
}

//reverse a string
import java.util.*;
public class soln2 {
public static void main(String[] args){
Scanner sc=new Scanner(System.in);
String a=sc.nextLine();
StringBuilder z=new StringBuilder(a);
for(int i=0;i<z.length()/2;i++){
int front=i;
int back=z.length()-i-1;
char frontchar=z.charAt(front);
char backchar=z.charAt(back);
z.setCharAt(front,backchar);
z.setCharAt(back,frontchar);

}
System.out.println(z);
}

//FIBONACCI
import java.util.*;
public class soln2 {
public static void main(String[] args){
Scanner sc=new Scanner(System.in);
int num=sc.nextInt();
int first=0;
int second=1;
for(int i=1;i<=num;i++){
System.out.print(first+" ");

int next=first+second;
first=second;
second=next;

}
}
}

// PERFECT SQUARE
import java.util.*;
public class soln2 {
public static void main(String[] args){
Scanner sc=new Scanner(System.in);
int num=sc.nextInt();
boolean isperfectsquare=true;
for(int i=1;i*i<=num;i++){
if(num%i==0 && num/i==i){
isperfectsquare=true;
}
else{
isperfectsquare=false;
}
}
if(isperfectsquare){
System.out.println("perfect square");
}
else{
System.out.println("not");
}
}
}

// HCF AND LCM OF 2 NUMS


import java.util.*;
public class soln2 {
public static void main(String[] args){
Scanner sc=new Scanner(System.in);
int num1=sc.nextInt();
int num2=sc.nextInt();
int orgnum1=num1;
int orgnum2=num2;
while(num2>0){
int temp=num2;
num2=num1%num2;
num1=temp;
}
int hcf=num1;
System.out.println(hcf);
int lcm=(orgnum1*orgnum2)/hcf;
System.out.println(lcm);
}
}

// FACTORIAL OF NUMBER
import java.util.*;
public class soln2 {
public static void main(String[] args){
Scanner sc=new Scanner(System.in);
int num=sc.nextInt();
sc.nextLine();
long fact=1;
if(num<0){
System.out.println("no");
}
else{
for(int i=1;i<=num;i++){
fact=fact*i;
}

}
System.out.println(fact);

}
}

// PRIME OR NOT
import java.util.*;
public class soln2 {
public static void main(String[] args){
Scanner sc=new Scanner(System.in);
int num=sc.nextInt();
sc.nextLine();
int temp;
boolean isprime=true;
if(num<=1){
isprime=false;
}else{
for(int i=2;i<=num/2;i++){
temp=num%i;
if(temp==0){
isprime=false;
break;
}
}
}
if(isprime){
System.out.println("prime");
}
else{
System.out.println("not prime");
}
}
}

// PALIMDROME OR NOT
import java.util.*;
public class soln2 {
public static void main(String[] args){
Scanner sc=new Scanner(System.in);
int num=sc.nextInt();
sc.nextLine();
int pal=num;
int sum=0;
int rem=0;
while(num>0){
rem=num % 10;
sum=(10*sum)+rem;
num=num/10;
}
if(sum==pal){
System.out.println("palindrome");
}
else{
System.out.println("Not");
}
}
}

// ARMSTRONG NUMBER
import java.util.*;
public class soln2 {
public static void main(String[] args){
Scanner sc=new Scanner(System.in);
int num=sc.nextInt();
sc.nextLine();
int sum=0;
int org=num;
int numofdigits=String.valueOf(num).length();
while(num>0){
int digit=num % 10;
sum=sum+(int)Math.pow(digit,numofdigits);
num=num/10;
}
if(sum==org){
System.out.println("ARMSTRONG");
}
else{
System.out.println("Not ARMSTRONG");
}
}
}

// sum of digits of num


import java.util.*;
public class soln2 {
public static void main(String[] args){
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
sc.nextLine();
int sum=0;
int rem=0;
while(n>0){
rem=n%10;
sum=sum+rem;
n=n/10;
}
System.out.println(sum);
}

// print count num of even digits in a number


import java.util.*;
public class sk {
public static void main(String[] args){
Scanner sc=new Scanner(System.in);
String a=sc.nextLine();
int count=0;
for(int i=0;i<a.length();i++){
char b=a.charAt(i);
if(Character.isDigit(b)){// to check whether its digit or not
int digit=Character.getNumericValue(b);//convert
character to its numeric value
if(digit%2==0){
count++;
}
}

}
System.out.println(count);
}

}
// print count num of words in string
import java.util.*;
public class sk {
public static void main(String[] args){
Scanner sc=new Scanner(System.in);
String a=sc.nextLine();
String[] b=a.split(" ");
int count=0;
for(int i=0;i<b.length;i++){
count++;
}

if(count>0){
System.out.println(count);
}
else{
System.out.println("No STring found");
}
}

// print count if the first letter of word is a vowel


import java.util.*;
public class sk {
public static void main(String[] args){
Scanner sc=new Scanner(System.in);
String a=sc.nextLine();
String[] b=a.split(" ");
int count=0;
for(int i=0;i<b.length;i++){
char z=b[i].charAt(0);
if(z=='a'||z=='e'||z=='i'||z=='o'||z=='u'){
count++;
}
}if(count>0){
System.out.println(count);
}
else{
System.out.println("No STring found");
}
}
}
// print vowels as per their ascii sequence
import java.util.*;
public class sk {
public static void main(String[] args){
Scanner sc=new Scanner(System.in);
String a=sc.nextLine();
String b="";

for(int i=0;i<a.length();i++){
if(a.charAt(i)=='a'||a.charAt(i)=='e'||a.charAt(i)=='i'||a.charAt(i)=='o'||a.charAt(i)
=='u'){
b+=a.charAt(i);
}
}
char[] chars=b.toCharArray();

Arrays.sort(chars);

System.out.println(chars);
}
}

//letters at even index and for odd replace = with !

import java.util.*;
public class sk {
public static void main(String[] args){
Scanner sc=new Scanner(System.in);
String a=sc.nextLine();
char[] chars=a.toCharArray();
for(int i=0;i<a.length();i++){
if(i%2==0){
System.out.println(chars[i]);
}
}

//no.of vowels in string and print the vowels

import java.util.*;
public class sk {
public static void main(String[] args){
Scanner sc=new Scanner(System.in);
String a=sc.nextLine();
int c=0;
char[] chars=a.toCharArray();
for(int i=0;i<a.length();i++){
if(a.charAt(i)=='a'||a.charAt(i)=='e'||a.charAt(i)=='i'||a.charAt(i)=='o'||a.charAt(i)
=='u'){
System.out.println(chars[i]);
c++;
}
}
System.out.println(c);

// consonants in a string and count of it

import java.util.*;
public class sk {
public static void main(String[] args){
Scanner sc=new Scanner(System.in);
int c=0;
String a=sc.nextLine();
char[] chars=a.toCharArray();
for(int i=0;i<a.length();i++){
if(a.charAt(i)!='a'&& a.charAt(i)!='e'&&
a.charAt(i)!='i'&&a.charAt(i)!='o'&&a.charAt(i)!='u'){
c++;
System.out.println(chars[i]);
}
}
System.out.println(c);

}
//no.of lowercase letters and printing lowercase

import java.util.*;
public class sk {
public static void main(String[] args){
Scanner sc=new Scanner(System.in);
String a=sc.nextLine();
char[] chars=a.toCharArray();
int count=0;
for(int i=0;i<a.length();i++){
if(Character.isLowerCase(chars[i]))
{
System.out.println(chars[i]);
count++;
//System.out.println(count);
}
}
System.out.println(count);
}

//ANAGRAM CODE

import java.util.*;
public class practise {
public static void main(String[] args) {
// ANAGRAM CODE
Scanner sc=new Scanner(System.in);
String a=sc.nextLine();
String b=sc.nextLine();
char[] ch1=a.toCharArray();
char[] ch2=b.toCharArray();
if(ch1.length!=ch2.length){
System.out.println("no");
}
Arrays.sort(ch1);
Arrays.sort(ch2);
System.out.println(Arrays.equals(ch1, ch2));
}
}

You might also like