Skip to content

Commit 8d5523b

Browse files
architg-oparchitg-op
committed
Added Some Problems
1 parent 69f0f22 commit 8d5523b

10 files changed

+310
-53
lines changed

‎Array/Adding ones.java

Lines changed: 32 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,32 @@
1+
import java.util.*;
2+
import java.lang.*;
3+
import java.io.*;
4+
class GFG
5+
{
6+
public static void main (String[] args)
7+
{
8+
Scanner sc = new Scanner(System.in);
9+
int t = sc.nextInt();
10+
while (t-- != 0) {
11+
int n = sc.nextInt();
12+
int k = sc.nextInt();
13+
int a[] = new int[n];
14+
for (int i = 0; i < n; i++) {
15+
a[i] = 0;
16+
}
17+
while (k != 0) {
18+
int j = sc.nextInt();
19+
for (int i = 0; i < n; i++) {
20+
if ((i + 1) >= j) {
21+
a[i] += 1;
22+
}
23+
}
24+
k--;
25+
}
26+
for (int i = 0; i < n; i++) {
27+
System.out.print(a[i] + " ");
28+
}
29+
System.out.println();
30+
}
31+
}
32+
}

‎Array/Count Pairs in an Array(Brute Force).java

Lines changed: 28 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,28 @@
1+
import java.util.*;
2+
import java.lang.*;
3+
import java.io.*;
4+
class GFG
5+
{
6+
public static void main (String[] args)
7+
{
8+
Scanner sc = new Scanner(System.in);
9+
int t = sc.nextInt();
10+
while (t-- != 0) {
11+
int n = sc.nextInt();
12+
int a[] = new int[n];
13+
for (int i = 0; i < n; i++) {
14+
a[i] = sc.nextInt();
15+
}
16+
int cnt = 0;
17+
for (int i = 0; i < n; i++) {
18+
for (int j = i + 1; j < n; j++) {
19+
if (i * a[i] > j * a[j]) {
20+
cnt++;
21+
}
22+
}
23+
}
24+
System.out.println(cnt);
25+
cnt = 0;
26+
}
27+
}
28+
}

‎Array/Equal Sum.java

Lines changed: 48 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,48 @@
1+
import java.util.*;
2+
import java.lang.*;
3+
import java.io.*;
4+
class GFG
5+
{
6+
public static void main (String[] args) throws Exception
7+
{
8+
Scanner sc = new Scanner(System.in);
9+
int f = 0;
10+
int t = sc.nextInt();
11+
while (t-- != 0) {
12+
int p = sc.nextInt();
13+
String s = sc.nextLine();
14+
String[] ss = s.split(" ");
15+
int n = ss.length;
16+
int a[] = new int[n];
17+
for(int i=0;i<n;i++) {
18+
a[i]= Integer.valueOf(ss[i]);
19+
}
20+
21+
for (int i = 0; i < n; i++) {
22+
int j = i - 1;
23+
int lsum, rsum;
24+
lsum = rsum = 0;
25+
while (j >= 0) {
26+
lsum += a[j];
27+
j--;
28+
}
29+
j = i + 1;
30+
while (j < n) {
31+
rsum += a[j];
32+
j++;
33+
}
34+
if (lsum == rsum) {
35+
f = 1;
36+
break;
37+
}
38+
}
39+
if (f == 1) {
40+
System.out.println("YES");
41+
}
42+
else {
43+
System.out.println("NO");
44+
}
45+
f = 0;
46+
}
47+
}
48+
}

‎Array/Greater on right side (Naive).java

Lines changed: 32 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,32 @@
1+
import java.util.*;
2+
import java.lang.*;
3+
import java.io.*;
4+
class GFG
5+
{
6+
public static void main (String[] args)
7+
{
8+
Scanner sc = new Scanner(System.in);
9+
int t = sc.nextInt();
10+
while (t-- != 0) {
11+
int n = sc.nextInt();
12+
int a[] = new int[n];
13+
for (int i = 0; i < n; i++) {
14+
a[i] = sc.nextInt();
15+
}
16+
for (int i = 0; i < n; i++) {
17+
int max = -1;
18+
for (int j = i + 1; j < n; j++) {
19+
if (a[j] > max) {
20+
max = a[j];
21+
}
22+
}
23+
a[i] = max;
24+
}
25+
a[n - 1] = -1;
26+
for (int i = 0; i < n; i++) {
27+
System.out.print(a[i] + " ");
28+
}
29+
System.out.println();
30+
}
31+
}
32+
}

‎Array/Greater on right side(Efficient).java

Lines changed: 33 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,33 @@
1+
import java.util.*;
2+
import java.lang.*;
3+
import java.io.*;
4+
class GFG
5+
{
6+
public static void main (String[] args)
7+
{
8+
Scanner sc = new Scanner(System.in);
9+
int t = sc.nextInt();
10+
while (t-- != 0) {
11+
int n = sc.nextInt();
12+
int a[] = new int[n];
13+
for (int i = 0; i < n; i++) {
14+
a[i] = sc.nextInt();
15+
}
16+
int max = a[n - 1];
17+
for (int i = n - 2; i >= 0; i--) {
18+
int temp = a[i];
19+
a[i] = max;
20+
if (temp > max) {
21+
max = temp;
22+
}
23+
}
24+
25+
// Printing the Array
26+
a[n - 1] = -1;
27+
for (int i = 0; i < n; i++) {
28+
System.out.print(a[i] + " ");
29+
}
30+
System.out.println();
31+
}
32+
}
33+
}

‎Array/Inversion Count of Array(Efficient).java

Lines changed: 62 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,62 @@
1+
import java.util.*;
2+
import java.lang.*;
3+
import java.io.*;
4+
class GFG
5+
{
6+
static int merge(int a[], int l, int m, int r) {
7+
int invCnt = 0;
8+
int L[] = new int[m - l + 1];
9+
int R[] = new int[r - m];
10+
for (int i = 0; i < L.length; i++) {
11+
L[i] = a[l + i];
12+
}
13+
for (int j = 0; j < R.length; j++) {
14+
R[j] = a[m + j + 1];
15+
}
16+
int i, j, k;
17+
i = j = 0;
18+
k = l;
19+
while (i < L.length && j < R.length) {
20+
if (L[i] <= R[j]) {
21+
a[k++] = L[i++];
22+
}
23+
else {
24+
invCnt += (m + 1 - i);
25+
a[k++] = R[j++];
26+
}
27+
}
28+
while (i < L.length) {
29+
a[k++] = L[i++];
30+
}
31+
while (j < R.length) {
32+
a[k++] = R[j++];
33+
}
34+
return invCnt;
35+
}
36+
static int mergeSort(int a[], int l, int r) {
37+
int invCnt = 0;
38+
if (l < r) {
39+
int m = (l + r) / 2;
40+
invCnt = mergeSort(a, l, m);
41+
invCnt += mergeSort(a, m + 1, r);
42+
invCnt += merge(a, l, m, r);
43+
}
44+
return invCnt;
45+
}
46+
public static void main (String[] args)
47+
{
48+
Scanner sc = new Scanner(System.in);
49+
int t = sc.nextInt();
50+
while (t-- != 0) {
51+
int n = sc.nextInt();
52+
int a[] = new int[n];
53+
for (int i = 0; i < n; i++) {
54+
a[i] = sc.nextInt();
55+
}
56+
System.out.println(mergeSort(a, 0 , n - 1));
57+
for (int i = 0; i < a.length; i++) {
58+
System.out.println(a[i]);
59+
}
60+
}
61+
}
62+
}

‎Array/Next Permutation.java

Lines changed: 0 additions & 53 deletions
This file was deleted.

‎Array/Remove Duplicates(Efficient).java

Lines changed: 11 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,11 @@
1+
int remove_duplicate(int a[])
2+
{
3+
int j = 0;
4+
for (int i = 0; i < a.length - 1; i++) {
5+
if (a[i] != a[i + 1]) {
6+
a[j++] = a[i];
7+
}
8+
}
9+
a[j++] = a[a.length - 1];
10+
return j;
11+
}

‎Array/Remove Duplicates(Inefficient).java

Lines changed: 18 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,18 @@
1+
int remove_duplicate(int a[])
2+
{
3+
int newa[] = new int[1000];
4+
for (int i = 0; i < 1000; i++) {
5+
newa[i] = 0;
6+
}
7+
for (int i = 0; i < a.length; i++) {
8+
newa[a[i]]++;
9+
}
10+
int cnt = 0;
11+
int k = 0;
12+
for (int i = 0; i < 1000; i++) {
13+
if (newa[i] >= 1) {
14+
a[k++] = i;
15+
}
16+
}
17+
return k;
18+
}

‎Array/Rotate Array(Juggling Algorithm).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+
import java.io.*;
4+
class GFG
5+
{
6+
static int gcd(int a, int b) {
7+
if (b == 0) {
8+
return a;
9+
}
10+
return gcd(b, a % b);
11+
}
12+
public static void main (String[] args)
13+
{
14+
Scanner sc = new Scanner(System.in);
15+
int t = sc.nextInt();
16+
while (t-- != 0) {
17+
int n = sc.nextInt();
18+
int d = sc.nextInt();
19+
int a[] = new int[n];
20+
for (int i = 0; i < n; i++) {
21+
a[i] = sc.nextInt();
22+
}
23+
int j, k, temp;
24+
for (int i = 0; i < gcd(n, d); i++) {
25+
temp = a[i];
26+
j = i;
27+
while (true) {
28+
k = j + d;
29+
if (k >= n) {
30+
k = k % n;
31+
}
32+
if (k == i) {
33+
break;
34+
}
35+
a[j] = a[k];
36+
j = k;
37+
}
38+
a[j] = temp;
39+
}
40+
for (int i = 0; i < n; i++) {
41+
System.out.print(a[i] + " ");
42+
}
43+
System.out.println();
44+
}
45+
}
46+
}

0 commit comments

Comments
 (0)