poola.praveen
BAN USERpublic class ReverseLinkedList {
Node l;
Node f;
int size = 0;
public void add(int i) {
Node newnode = new Node(l, i, null);
size++;
if (l == null) {
f = newnode;
} else {
l.next = newnode;
}
l = newnode;
}
public int get(int i) {
Node currentNode = l;
for (int j = 0; j <= size; j++) {
if (i == j)
return currentNode.i;
currentNode = currentNode.prev;
}
return -1;
}
private class Node {
int i;
Node prev;
Node next;
Node(Node prev, int i, Node next) {
this.prev = prev;
this.next = next;
this.i = i;
}
}
}
import java.util.Iterator;
import java.util.LinkedHashSet;
import java.util.Set;
public class ResultIterator<E> {
Iterator<E> iter1;
Iterator<E> iter2;
Set<E> set;
Iterator<E> iterator;
public ResultIterator(Iterator<E> iter1, Iterator<E> iter2) {
this.iter1 = iter1;
this.iter2 = iter2;
set = new LinkedHashSet<E>();
iterator=set.iterator();
addElements(iter1, iter2);
}
public void addElements(Iterator<E> iter1, Iterator<E> iter2) {
while (iter1.hasNext()) {
set.add(iter1.next());
}
while (iter2.hasNext()) {
set.add(iter2.next());
}
}
public boolean hasNext() {
return iterator.hasNext();
}
public E Next() {
return iterator.next();
}
}
import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
public class Challenge3 {
public static void main(String[] args) {
try{
File f1=new File("test.txt");
FileReader freader=new FileReader(f1);
BufferedReader buffer=new BufferedReader(freader);
String value;
while((value=buffer.readLine())!=null){
String[] charArry=value.split(",");
System.out.println(charArry[charArry.length-2]);
}
}catch(Exception e){
e.printStackTrace();
}
}
}
import java.util.ArrayList;
import java.util.HashMap;
import java.util.Iterator;
import java.util.List;
import java.util.Map;
public class Challenge2 {
public static void main(String[] args) {
List<String> l1 = new ArrayList<String>();
List<String> l2 = new ArrayList<String>();
List<String> l3 = new ArrayList<String>();
// for L1 list
l1.add("aaa");
l1.add("bbb");
l1.add("ddd");
l1.add("xyxz");
// for L2 list
l2.add("bbb");
l2.add("ccc");
l2.add("ccc");
l2.add("hkp");
// for L3 list
l3.add("ddd");
l3.add("eee");
l3.add("ffff");
l3.add("lmn");
l3.add("bbb");
Map<String, Integer> map = new HashMap<String, Integer>();
for (int i = 0; i < l1.size(); i++) {
if(map.containsKey(l1.get(i))){
int count=map.get(l1.get(i));
count++;
map.put(l1.get(i), count);
}else{
map.put(l1.get(i), 0);
}
}
for (int i = 0; i < l2.size(); i++) {
if(map.containsKey(l2.get(i))){
int count=map.get(l2.get(i));
count++;
map.put(l2.get(i), count);
}else{
map.put(l2.get(i), 0);
}
}
for (int i = 0; i < l3.size(); i++) {
if(map.containsKey(l3.get(i))){
int count=map.get(l3.get(i));
count++;
map.put(l3.get(i), count);
}else{
map.put(l3.get(i), 0);
}
}
Iterator<String> iter=map.keySet().iterator();
while (iter.hasNext()) {
String value=iter.next();
if(map.get(value)==0){
System.out.println(value);
}
}
}
}
import java.util.ArrayList;
import java.util.HashMap;
import java.util.Iterator;
import java.util.List;
import java.util.Map;
public class Challenge2 {
public static void main(String[] args) {
List<String> l1 = new ArrayList<String>();
List<String> l2 = new ArrayList<String>();
List<String> l3 = new ArrayList<String>();
// for L1 list
l1.add("aaa");
l1.add("bbb");
l1.add("ddd");
l1.add("xyxz");
// for L2 list
l2.add("bbb");
l2.add("ccc");
l2.add("ccc");
l2.add("hkp");
// for L3 list
l3.add("ddd");
l3.add("eee");
l3.add("ffff");
l3.add("lmn");
Map<String, String> map = new HashMap<String, String>();
for (int i = 0; i < l1.size(); i++) {
if (map.put(l1.get(i), "dummy") != null) {
map.remove(l1.get(i));
}
}
for (int i = 0; i < l2.size(); i++) {
if (map.put(l2.get(i), "dummy") != null) {
map.remove(l2.get(i));
}
}
for (int i = 0; i < l3.size(); i++) {
if (map.put(l3.get(i), "dummy") != null) {
map.remove(l3.get(i));
}
}
Iterator<String> iter=map.keySet().iterator();
while (iter.hasNext()) {
System.out.println(iter.next());
}
}
}
public class Challenge6 {
- poola.praveen February 21, 2017public static void main(String[] args) {
int[] a={1,2,3,4,5};
int[] b=new int[a.length];
for( int i=0;i<a.length;i++){/* n-1 times*/
int value=1;
for(int j=0;j<a.length;j++){/* n-1 times */
if(a[i]!=a[j])
value=value*a[j];
}
b[i]=value;
}
System.out.println(b[0]);
System.out.println(b[1]);
System.out.println(b[2]);
System.out.println(b[3]);
System.out.println(b[4]);
}
}