Day1 of 100daysof Code

Author: sauravjaiswalsj

Leetcode/.m.c.swp

@@ -0,0 +1,30 @@
+import java.util.*;
+public class MinimumRotated{
+	public static void main(String[] args){
+		Scanner cin=new Scanner(System.in);
+		int n=cin.nextInt();
+		int[] array=new int[n];
+		for(int i=0;i<n;i++){
+			array[i]=cin.nextInt();
+		}
+		System.out.println(MinimumRotation(array));
+	}
+	public static int MinimumRotation(int[] array){
+		int left=0,right=array.length-1;
+		if(array[left]<array[right]) return array[left];
+		if(array.length==1) return array[left];
+		while(left<right){
+			// Find the inflectionPoint
+			int midPoint=(left+right)/2;
+			//check if midpoint is not the inflectionPoint
+			if(array[midPoint]>array[midPoint+1] && midPoint<array.length) return array[midPoint+1];
+			if(array[midPoint]<array[midPoint-1] && midPoint>0) return array[midPoint];
+			if(array[midPoint]>array[left]){
+				left=midPoint+1;
+			}else{
+				right=midPoint-1;
+			}
+		}
+		return -1;
+	}
+}

Leetcode/MinimumRotated.class

@@ -0,0 +1,38 @@
+/*
+ * Basic Trick:
+ * nsp= 2*nrow-1
+ * nst=n-nsp 
+ */
+
+import java.util.Scanner;
+public class HollowDiamond{
+	public static void main(String[] args){
+		Scanner cin=new Scanner(System.in);
+		int n=cin.nextInt();
+		int nrow=1;
+		int nsp=2*nrow-1;
+		int nst=n-nsp;
+		while(nrow<=n){
+			int cst=1;
+			while(cst<=nst){
+				System.out.print("*\t");
+				cst++;
+			}
+			int csp=1;
+			while(csp<=nsp){
+				System.out.print("\t");
+				csp++;
+			}
+			System.out.println();
+			if(nrow<n/2){
+				nsp=2*nrow-1;
+				nst=n-nsp;
+			}else{
+				//nst=2*nrow-k;
+				//nsp=n-nsp;
+			}
+			nrow++;
+			
+		}
+	}
+}

Leetcode/MinimumRotated.java

@@ -0,0 +1,25 @@
+import java.util.*;
+public class ManmohanLovesPatternsI{
+	public static void main(String[] args){
+		Scanner cin=new Scanner(System.in);
+		int n=cin.nextInt();
+		int nst=1;
+		int nrow=1;
+		while(nrow<=n){
+			//work
+			int cst=1;
+			while(cst<=nst){
+				if((nst%2==0 && nst!=2) &&(cst > 1 && cst<nst)){
+					System.out.print("0");
+				}else{
+					System.out.print("1");
+				}
+				cst++;
+			}
+			//prep
+			System.out.println();
+			nrow++;
+			nst++;
+		}
+	}
+}

cdblocks/challenge1/AnyBase.class

@@ -0,0 +1,31 @@
+import java.util.Scanner;
+public class ManmohanLovesPatternsII{
+	public static void main(String[] args){
+		Scanner cin=new Scanner(System.in);
+		int n=cin.nextInt();
+		int nst=1;
+		int nrow=1;
+		int pr=1;
+		while(nrow<=n){
+			//work
+			int cst=1;
+			while(cst<=nst){
+				if(nst>2 && (cst>1 && cst<nst)){
+					System.out.print("0");
+				}
+				else{
+					System.out.print(pr);
+				}
+				cst++;
+			}
+			//prep
+			System.out.println();
+			nst++;
+			nrow++;
+			if(nrow>2)
+				pr++;
+		}
+	}
+}
+			
+

cdblocks/challenge1/HollowDiamond.class

@@ -0,0 +1,33 @@
+import java.util.Scanner;
+public class PattenrTriangle{
+	public static void main+(String[] args){
+
+        int nr;
+        std::cin>>nr;
+        int row=1;
+        int val,nst=1,nsp=nr-1;
+        while(row<=nr){
+                val=1;
+                int csp=1;
+                while(csp<=nsp){
+                        std::cout<<"  ";
+                        csp++;
+                }
+                int cst=1;
+                while(cst<=nst){
+                        std::cout<<val<<" ";
+                        //prep
+                        if(cst<=nst/2){
+                                val++;
+                        }else{
+                                val--;
+                        }
+                        cst++;
+                }
+                //prep
+                std::cout<<std::endl;
+                nsp--;
+                nst+=2;
+                row++;
+        }
+}

cdblocks/challenge1/HollowDiamond.java

@@ -0,0 +1,25 @@
+import java.util.Scanner;
+public class PatternwithZeros{
+	public static void main(String[] args){
+		Scanner cin=new Scanner(System.in);
+		int n=cin.nextInt();
+		int nst=1;
+		int nrow=1;
+		while(nrow<=n){
+			int cst=1;
+			while(cst<=nst){
+				if(nst>2 && (cst>=2 && cst<nst)){
+					System.out.print("0\t");
+				}
+				else{
+					System.out.print(nrow+"\t");
+				}
+				cst++;
+			}
+			System.out.println();
+			nst++;
+			nrow++;
+		}
+	}
+}
+

cdblocks/challenge1/ManmohanLovesPatternsI.java

@@ -0,0 +1,56 @@
+import java.util.*;
+class LinkedList{
+	private class node{
+		int data;
+		node next;
+		node(){
+			this.data=0;
+			this.next=null;
+		}
+		node(int item){
+			this.data=item;
+			this.next=null;
+		}
+	}
+	private node head,tail;
+	private int size=0;
+	public void atBeg(int data){
+		node temp=new node(data);
+		temp.next=this.head;
+		if(this.size==0) this.tail=temp;
+		this.head=temp;
+		this.size++;
+	}
+	//5->10->null
+	//5->10->15->null
+	public void atEnd(int data){
+		node temp=new node(data);
+		if(this.head==null){
+			this.head=temp;
+		}else{
+			this.tail.next=temp;
+		}
+		this.tail=temp;
+		this.size++;
+	}
+	public void atMiddle(int data,int index){
+		node temp=new node(data);
+
+	public void display(){
+		node temp=new node();
+		temp=this.head;
+		while(temp!=null){
+			System.out.println(temp.data+" ");
+			temp=temp.next;
+		}
+	}
+}
+public class InsertionAtMid{
+	public static void main(String[] args){
+		LinkedList list=new LinkedList();
+		list.atBeg(10);
+		list.atBeg(5);
+		list.atEnd(15);
+		list.display();
+	}
+}

cdblocks/challenge1/ManmohanLovesPatternsII.java

@@ -0,0 +1,11 @@
+import java.util.*;
+public class LinkedCollection{
+	public static void main(String[] args){
+		LinkedList<Integer> list=new LinkedList<Integer>();
+		for(int i=1;i<10;i++){
+			list.add(i);
+		}
+		System.out.println(Collections.reverse(list));
+	}
+}
+		

cdblocks/challenge1/PatternTriangle.java

@@ -10,6 +10,7 @@ public static void main(String[] args){
 			list.add(cin.nextInt());
 		}
 		int d=cin.nextInt();
+		d%=list.size();
 		RightRotation(list,0,list.size()-1);
 		RightRotation(list,0,d-1);
 		RightRotation(list,d,list.size()-1);

cdblocks/challenge1/PatternwithZeros.class

@@ -0,0 +1,39 @@
+/*package whatever //do not write package name here */
+
+import java.util.*;
+import java.lang.*;
+import java.io.*;
+
+public class CyclicallyRotate {
+	public static void main (String[] args) {
+		Scanner cin=new Scanner(System.in);
+		int t=cin.nextInt();
+		while(t!=0){
+            int n=cin.nextInt();
+            ArrayList<Integer> list=new ArrayList<Integer>();
+            for(int i=0;i<n;i++){
+                list.add(cin.nextInt());
+            }
+            int d=n-1;
+            Rotate(list,d);
+            for(int i:list){
+                System.out.print(i+" ");
+            }
+            t--;
+            System.out.println();
+		}
+	}
+	public static void Rotate(ArrayList<Integer> list, int d){
+	d=d%list.size();
+        reverse(list,0,d-1);
+        reverse(list,d,list.size()-1);
+        reverse(list,0,list.size()-1); 
+	}
+	public static void reverse(ArrayList<Integer> list,int low,int high){
+	    while(low<high){
+	        Collections.swap(list,low,high);
+	        low++;
+	        high--;
+	    }
+	}
+}

cdblocks/challenge1/PatternwithZeros.java

@@ -0,0 +1,19 @@
+def checkPrime(num):
+    if(num<=1):
+        return False
+    if(num == 2 or num == 3):
+        return True
+    #if(num%2==0 or num%3==0):
+       # return False
+    for i in range(3,num+1):
+        if(num%i==0):
+            return False
+    return True
+
+if __name__ == "__main__":
+    firstInput = int(input())
+    secondInput = int(input())
+    for i in range(firstInput, secondInput+1):
+        if(checkPrime(i)==True):
+            print(i)
+

cdblocks/challenge1/check.class

@@ -0,0 +1,24 @@
+import math
+def checkPrime(num):
+    if(num<=1):
+        return False
+    if(num == 2 or num == 3):
+        return True
+    if(num%2==0 or num%3==0):
+        return False
+    for i in range(3,int(math.sqrt(num))):
+        if(num%i==0):
+            return False
+    return True
+
+if __name__ == "__main__":
+    loop=int(input())
+    while(loop!=0):
+        firstInput, secondInput = map(int, input().split())
+        for i in range(firstInput, secondInput+1):
+            if(checkPrime(i)==True):
+                print(i)
+        if(loop!=1):
+            print()
+        loop-=1
+