Competiitve Programming

Author: sauravjaiswalsj

Leetcode/RightArrayRotation.java

@@ -0,0 +1,27 @@
+import java.util.Scanner;
+import java.util.Collections;
+import java.util.ArrayList;
+public class RightArrayRotation{
+public static void main(String[] args){
+Scanner cin=new Scanner(System.in);
+int n=cin.nextInt();
+ArrayList<Integer> list=new ArrayList<Integer>();
+for(int i=0;i<n;i++){
+list.add(cin.nextInt());
+}
+int d=cin.nextInt();
+RightRotation(list,0,list.size()-1);
+RightRotation(list,0,d-1);
+RightRotation(list,d,list.size()-1);
+for(int i:list){
+System.out.print(i);
+}
+}
+public static void RightRotation(ArrayList<Integer> list, int low,int high){
+while(low<high){
+Collections.swap(list,low,high);
+low++;
+high--;
+}
+}
+}

cdblocks/challenge1/AnyBase.class

@@ -9,7 +9,12 @@ public static void main(String[] args){
 int sb=cin.nextInt();
 System.out.println("Enter the Destination Base: ");
 int db=cin.nextInt();
-System.out.println(ToAnyBase(n,sb,db));
+if(sb==16){
+String g=cin.nextLine();
+int t=Integer.parseInt(g,16);
+System.out.println(t);
+}else
+System.out.println(ToAnyBase(n,sb,db));
 }
 public static int ToAnyBase(int n,int sb,int db){
 int sum=0,i=0;

cdblocks/challenge1/AnyBase.java

@@ -0,0 +1,17 @@
+import java.util.*;
+class check{
+public static void main(String[] args){
+Scanner cin=new Scanner(System.in);
+int base=cin.nextInt();
+int n=cin.nextInt();
+String d;
+if(base ==16)
+ d=cin.nextLine();
+int dec=0;
+if(base ==2 ) dec=Integer.parseInt(n,2);
+if(base ==8) dec=Integer.parseInt(n,8);
+if(base ==16) dec=Integer.parseInt(d,16);
+ System.out.println(dec);
+
+}
+}

cdblocks/challenge1/check.class

@@ -0,0 +1,41 @@
+#include<iostream>
+#include<vector>
+//#include<algorithm>
+//using namespace std;
+int main(void){
+int n,val;
+std::cin>>n;
+std::vector<int> list;
+for(int i=0;i<n;i++){
+std::cin>>val;
+list.push_back(val);
+}
+int flag=0;
+std::vector<int> duplicate;
+std::vector<int>::iterator it=list.begin();
+for(int i=0;i<n;i++){
+std::advance(it,i);
+for(int j=i+1;j<n;j++){
+if(list.at(i)==list.at(j)){
+flag++;
+duplicate.push_back(list.at(i));
+//int val=list.at(i);
+list.erase(it);
+}
+}
+std::advance(it,0);
+}
+if(flag>0){
+std::cout<<"yes";
+}
+else{
+std::cout<<"no";
+}
+std::cout<<"\n";
+for(int i:duplicate){
+std::cout<<i<<" ";
+}
+std::cout<<"\n";
+for(int i:list)
+std::cout<<i<<" ";
+}

cdblocks/challenge1/check.java

@@ -0,0 +1,21 @@
+#include<iostream>
+
+using namespace std;
+
+int main(){
+int n,count=0;
+cin>>n;
+int arr[n],arr1[n];
+for(int i=0;i<n;i++){
+cin>>arr[i];
+}
+for(int i=0;i<n;i++){
+cin>>arr1[i];
+}
+for(int i=0;i<n;i++){
+if(arr[0]==arr1[i]){
+count=i;
+}
+}
+cout<<count;
+}