Allwin S
BAN USERUPDATED
package amazon;
/**
* @author Allwin S
*
*/
public class CanFormPalindrome {
/**
* @param args
*/
public static void main(String[] args) {
String arr[] = { "mmoo", "yakak", "travel",
"abcdefghijklmnopqrstuvwxyz", "absdba" };
for (String s : arr) {
int sum = 0;
for (int i = 0; i < s.length(); i++) {
int n = s.charAt(i);
sum ^= n;
}
if (sum == 0 || (sum >= 90 && sum <= 122)) {
System.out.println(s + " = true");
} else {
System.out.println(s + " = false");
}
}
}
}
package amazon;
/**
* @author Allwin S
*
*/
public class CanFormPalindrome {
/**
* @param args
*/
public static void main(String[] args) {
String arr[] = {"mmoo", "yakak", "travel","abcdefghijklmnopqrstuvwxyz","absdba"};
for (String s : arr) {
int sum = 0;
for(int i = 0; i< s.length(); i++){
int n = s.charAt(i);
sum ^= n;
}
if(sum ==0 || (sum >= 90 && sum <= 122))
System.out.println(s);
}
}
}
//Note : Here Repetations allowed
// Means when same char comes again then same word would be repeated.
package recursion;
public class Permutation {
public static void main(String[] args) {
String str = "tree";
//permu(str, str.length(), "");
combi(str, str.length(), "");
}
private static void permu(String str, int len, String out) {
if(out.length() == len){
System.out.println(out);
return;
}
for(int i = 0;i < str.length(); i++){
permu(str, len, out+str.charAt(i));
}
}
private static void combi(String str, int len, String out) {
if(out.length() == len){
System.out.println(out);
return;
}
for(int i = 0;i < str.length(); i++){
combi((str.substring(0,i)+""+str.substring(i+1)), len, out+str.charAt(i));
}
}
}
/*Answers
tree
tree
tere
teer
tere
teer
rtee
rtee
rete
reet
rete
reet
etre
eter
erte
eret
eetr
eert
etre
eter
erte
eret
eetr
eert*/
import java.io.*;
import java.util.*;
import java.util.Scanner;
public class SparseNumber {
static String s = "";
public static void main(String args[]){
Scanner in = new Scanner(System.in);
while(true){
int input = in.nextInt();
System.out.println(getNextSparseNumber(input));
}
}
private static int getNextSparseNumber(int input) {
while(true){
input++;
s= "";
toBin(input);
if(isSparseNumber()){
//System.out.println("Next Sparse Number : "+input);
break;
}
}
return input;
}
private static boolean isSparseNumber(){
for(int i = 0; i < s.length()-1; i++){
if(s.charAt(i) == '1' && s.charAt(i+1) == '1'){
return false;
}
}
return true;
}
private static void toBin(int n){
if(n!=0){
toBin(n/2);
s += n %2;
}
}
}
private static int getNextSparseNumber(int input) {
while(true){
input++;
s= "";
toBin(input);
if(isSparseNumber()){
//System.out.println("Next Sparse Number : "+input);
break;
}
}
return input;
}
private static boolean isSparseNumber(){
for(int i = 0; i < s.length()-1; i++){
if(s.charAt(i) == '1' && s.charAt(i+1) == '1'){
return false;
}
}
return true;
}
private static void toBin(int n){
if(n!=0){
toBin(n/2);
s += n %2;
}
}
- Allwin S August 16, 2020