Scribd
Upload
25 views2 pages

Strings Solutions

Uploaded by

g1bhagat109
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
25 views2 pages

Strings Solutions

Uploaded by

g1bhagat109
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/ 2

STRINGS SOLUTIONS

g1bhagat101@gmail.com
Solution 1:
import java.util.*;

public class Solution {


public static void main(String[] args) {
String str = new Scanner(System.in).next();
int count = 0;

for(int i=0; i<str.length(); i++) {


char ch = str.charAt(i);
if(ch == 'a' || ch == 'e' ||ch == 'i' || ch == 'o' ||ch == 'u') {
count++;
}
}
System.out.println("count of vowels is :" + count);
}
}

Solution 2: Output will be :


false true
(If you need an explanation, please r-ewatch the video about how Strings work in memory?)

Solution 3 : Output will be :


​ApnaCoege

Following are some methods in Java which are used to replace characters:
Solution 4:

g1bhagat101@gmail.com
import java.util.Arrays;
public class Solution {
public static void main(String[] args) {
String str1 = "earth";
String str2 = "heart";

//Convert Strings to lowercase. Why? so that we don't have to check


separately for lower & uppercase.
str1 = str1.toLowerCase();
str2 = str2.toLowerCase();

// First check - if the lengths are the same


if(str1.length() == str2.length()) {
// convert strings into char array
char[] str1charArray = str1.toCharArray();
char[] str2charArray = str2.toCharArray();
// sort the char array
Arrays.sort(str1charArray);
Arrays.sort(str2charArray);
// if the sorted char arrays are same or identical then the strings are
anagram
boolean result = Arrays.equals(str1charArray, str2charArray);
if(result) {
System.out.println(str1 + " and " + str2 + " are anagrams of each
other.");
} else {
System.out.println(str1 + " and " + str2 + " are not anagrams of
each other.");
}
} else {
// case when lengths are not equal
System.out.println(str1 + " and " + str2 + " are not anagrams of each
other.");
}
}
}

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy