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 aff04b0

Browse files
Added CP
1 parent 9353859 commit aff04b0

Some content is hidden

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

50 files changed

+503
-0
lines changed

‎CandidateCode.class

-1.22 KB
Binary file not shown.

‎hackerrank/.ReachingPoint.java.swp

12 KB
Binary file not shown.

‎hackerrank/101hack5/Sort.class

556 Bytes
Binary file not shown.

‎hackerrank/101hack5/swap.class

669 Bytes
Binary file not shown.

‎hackerrank/101hack5/swap.java

Lines changed: 35 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,35 @@
1+
import java.util.*;
2+
class Sort{
3+
public void sorting(int[] arr){
4+
int n = arr.length;
5+
int c=0;
6+
for (int i = 0; i < n-1; i++){
7+
for (int j = 0; j < n-i-1; j++){
8+
if(arr[j] > arr[j+1]){
9+
int temp = arr[j];
10+
arr[j] = arr[j+1];
11+
arr[j+1] = temp;
12+
c++;
13+
}
14+
}
15+
}
16+
if(c>1){
17+
System.out.println(c);
18+
}
19+
else{
20+
System.out.println(c);
21+
}
22+
}
23+
}
24+
public class swap{
25+
public static final Scanner cin=new Scanner(System.in);
26+
public static void main(String[] args){
27+
int n=cin.nextInt();
28+
int[] arr=new int[n];
29+
for(int i=0;i<n;i++){
30+
arr[i]=cin.nextInt();
31+
}
32+
Sort ob=new Sort();
33+
ob.sorting(arr);
34+
}
35+
}

‎hackerrank/IOSD/a.out

12.8 KB
Binary file not shown.

‎hackerrank/IOSD/search.cpp

Lines changed: 39 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,39 @@
1+
#include<iostream>
2+
using namespace std;
3+
int binarySearch(int A[],int n,int x){
4+
int start=0;
5+
int end=n-1;
6+
while(start<=end){
7+
int mid=(start+end)/2;
8+
if(A[mid]==x){
9+
return mid;
10+
}
11+
else if(x>A[mid]){
12+
start=mid+1;
13+
}
14+
else{
15+
end=mid-1;
16+
}
17+
}
18+
return -1;
19+
}
20+
int main(){
21+
int n,result;
22+
cin>>n;
23+
int A[n];
24+
for(int i=0;i<n;i++){
25+
cin>>A[i];
26+
}
27+
int x;
28+
cin>>x;
29+
result=binarySearch(A,n,x);
30+
if(result==-1){
31+
x++;
32+
result=binarySearch(A,n,x);
33+
cout<<"No "<<result+1;
34+
}
35+
else{
36+
cout<<"Yes "<<result+1;
37+
}
38+
return 0;
39+
}

‎hackerrank/ReachingPoint.class

1.16 KB
Binary file not shown.

‎hackerrank/ReachingPoint.java

Lines changed: 46 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,46 @@
1+
import java.util.*;
2+
import java.lang.*;
3+
public class ReachingPoint{
4+
public static final Scanner cin=new Scanner(System.in);
5+
public static void main(String[] args){
6+
int x1=cin.nextInt();
7+
int x2=cin.nextInt();
8+
int y1=cin.nextInt();
9+
int y2=cin.nextInt();
10+
11+
if((x2<x1)||(y2<y1)){
12+
System.out.println("No");
13+
}
14+
else{
15+
System.out.println(finding(x1,y1,x2,y2));
16+
}
17+
}
18+
public static String finding(int x1,int y1,int x2,int y2){
19+
int c=0,sum=0,max;
20+
max=Math.max(x2,y2);
21+
System.out.println(max);
22+
while(sum<max){
23+
System.out.println("ak");
24+
sum=x1+y1;
25+
if(sum==x2){
26+
c++;
27+
x1=sum;
28+
System.out.println("1");
29+
}
30+
else if(sum==y2){
31+
c++;
32+
y2=sum;
33+
System.out.println("2");
34+
}
35+
if(c==2)
36+
break;
37+
}
38+
System.out.println(c);
39+
if(c==2){
40+
return "Yes";
41+
}
42+
else{
43+
return "No";
44+
}
45+
}
46+
}

‎hackerrank/Untitled1.cpp

Lines changed: 44 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,44 @@
1+
#include<iostream>
2+
#include <bits/stdc++.h>
3+
using namespace std;
4+
5+
int main() {
6+
long int n;
7+
int i,j;
8+
cin>>n;
9+
long int a[n];
10+
for(i=0;i<n;i++)
11+
{
12+
cin>>a[i];
13+
}
14+
long int temp;
15+
for(i=0; i<n; i++){
16+
for(j=0; j<n; j++){
17+
if(a[i] > a[j]){
18+
temp=a[i];
19+
a[i]=a[j];
20+
a[j]=temp;
21+
}
22+
}
23+
}
24+
long int c=1;
25+
for(i=0;i<n;i++){
26+
if(a[i]==a[i+1])
27+
{
28+
c++;
29+
}
30+
else
31+
break;
32+
}
33+
if(c>0)
34+
{
35+
cout<<c;
36+
37+
}
38+
else{
39+
cout<<a[0];
40+
}
41+
return 0;
42+
}
43+
44+

0 commit comments

Comments
(0)

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