-
Notifications
You must be signed in to change notification settings - Fork 0
/
StringSamples.java
71 lines (52 loc) · 1.1 KB
/
StringSamples.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
/**
*
*/
package Algo;
import java.util.*;
/**
* @author pritesh
*
*/
public class StringSamples {
/**
*
*/
public StringSamples() {
// TODO Auto-generated constructor stub
}
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
String givenString = "ElonMusk";
char[] givenArray = givenString.toCharArray();
Arrays.sort(givenArray);
System.out.print(givenArray);
char[] sortedArray = new char[] {'h','s','e'};
if(Arrays.equals(givenArray, sortedArray))
System.out.println("Arrays not equal");
char c = 'i';
countCharacters(c);
reverseString(givenString);
String sentense = "I am the great programmer";
reverseWordsinString(sentense);
}
static void reverseWordsinString(String sentense) {
}
void firstNonrepeatedCharacter() {
}
static void countCharacters(Character c) {
}
void removeCharacter(String given) {
}
boolean isAnagrams(){
return false;
}
boolean isPalindrome(){
Boolean flag = false;
return flag;
}
void permutations(){}
static void reverseString(String s){}
}