Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

Commit ec6719b

Browse files
Competiitve Programming
1 parent c5753f9 commit ec6719b

File tree

221 files changed

+4583
-1
lines changed

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

221 files changed

+4583
-1
lines changed

‎Leetcode/RightArrayRotation.java

Lines changed: 27 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,27 @@
1+
import java.util.Scanner;
2+
import java.util.Collections;
3+
import java.util.ArrayList;
4+
public class RightArrayRotation{
5+
public static void main(String[] args){
6+
Scanner cin=new Scanner(System.in);
7+
int n=cin.nextInt();
8+
ArrayList<Integer> list=new ArrayList<Integer>();
9+
for(int i=0;i<n;i++){
10+
list.add(cin.nextInt());
11+
}
12+
int d=cin.nextInt();
13+
RightRotation(list,0,list.size()-1);
14+
RightRotation(list,0,d-1);
15+
RightRotation(list,d,list.size()-1);
16+
for(int i:list){
17+
System.out.print(i);
18+
}
19+
}
20+
public static void RightRotation(ArrayList<Integer> list, int low,int high){
21+
while(low<high){
22+
Collections.swap(list,low,high);
23+
low++;
24+
high--;
25+
}
26+
}
27+
}

‎cdblocks/challenge1/AnyBase.class

1.12 KB
Binary file not shown.

‎cdblocks/challenge1/AnyBase.java

Lines changed: 6 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -9,7 +9,12 @@ public static void main(String[] args){
99
int sb=cin.nextInt();
1010
System.out.println("Enter the Destination Base: ");
1111
int db=cin.nextInt();
12-
System.out.println(ToAnyBase(n,sb,db));
12+
if(sb==16){
13+
String g=cin.nextLine();
14+
int t=Integer.parseInt(g,16);
15+
System.out.println(t);
16+
}else
17+
System.out.println(ToAnyBase(n,sb,db));
1318
}
1419
public static int ToAnyBase(int n,int sb,int db){
1520
int sum=0,i=0;

‎cdblocks/challenge1/check.class

831 Bytes
Binary file not shown.

‎cdblocks/challenge1/check.java

Lines changed: 17 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,17 @@
1+
import java.util.*;
2+
class check{
3+
public static void main(String[] args){
4+
Scanner cin=new Scanner(System.in);
5+
int base=cin.nextInt();
6+
int n=cin.nextInt();
7+
String d;
8+
if(base ==16)
9+
d=cin.nextLine();
10+
int dec=0;
11+
if(base ==2 ) dec=Integer.parseInt(n,2);
12+
if(base ==8) dec=Integer.parseInt(n,8);
13+
if(base ==16) dec=Integer.parseInt(d,16);
14+
System.out.println(dec);
15+
16+
}
17+
}

‎codes/cpp/basics/'

Lines changed: 41 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,41 @@
1+
#include<iostream>
2+
#include<vector>
3+
//#include<algorithm>
4+
//using namespace std;
5+
int main(void){
6+
int n,val;
7+
std::cin>>n;
8+
std::vector<int> list;
9+
for(int i=0;i<n;i++){
10+
std::cin>>val;
11+
list.push_back(val);
12+
}
13+
int flag=0;
14+
std::vector<int> duplicate;
15+
std::vector<int>::iterator it=list.begin();
16+
for(int i=0;i<n;i++){
17+
std::advance(it,i);
18+
for(int j=i+1;j<n;j++){
19+
if(list.at(i)==list.at(j)){
20+
flag++;
21+
duplicate.push_back(list.at(i));
22+
//int val=list.at(i);
23+
list.erase(it);
24+
}
25+
}
26+
std::advance(it,0);
27+
}
28+
if(flag>0){
29+
std::cout<<"yes";
30+
}
31+
else{
32+
std::cout<<"no";
33+
}
34+
std::cout<<"\n";
35+
for(int i:duplicate){
36+
std::cout<<i<<" ";
37+
}
38+
std::cout<<"\n";
39+
for(int i:list)
40+
std::cout<<i<<" ";
41+
}
Binary file not shown.
12 KB
Binary file not shown.

‎codes/cpp/basics/Array.cpp

Lines changed: 21 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,21 @@
1+
#include<iostream>
2+
3+
using namespace std;
4+
5+
int main(){
6+
int n,count=0;
7+
cin>>n;
8+
int arr[n],arr1[n];
9+
for(int i=0;i<n;i++){
10+
cin>>arr[i];
11+
}
12+
for(int i=0;i<n;i++){
13+
cin>>arr1[i];
14+
}
15+
for(int i=0;i<n;i++){
16+
if(arr[0]==arr1[i]){
17+
count=i;
18+
}
19+
}
20+
cout<<count;
21+
}

‎codes/cpp/basics/Duplicate

28.1 KB
Binary file not shown.

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /