Skip to content

Commit 3a40f82

Browse files
rajeshsvecrajeshsvec
authored
Add files via upload
1 parent d7d9d58 commit 3a40f82

20 files changed

+394
-0
lines changed

‎Week5/A-Arrays I/Assignment5a/FindDuplicate.txt

Lines changed: 16 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,16 @@
1+
import java.util.Arrays;
2+
public class Solution{
3+
4+
public static int duplicateNumber(int arr[]) {
5+
//Your code goes here
6+
Arrays.sort(arr);
7+
for(int i=0;i<arr.length-1;i++)
8+
{
9+
if(arr[i]==arr[i+1])
10+
{
11+
return arr[i];
12+
}
13+
}
14+
return 0;
15+
}
16+
}

‎Week5/A-Arrays I/Assignment5a/FindUnique.txt

Lines changed: 14 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,14 @@
1+
2+
public class Solution {
3+
4+
public static void swapAlternate(int arr[]) {
5+
//Your code goes here
6+
for(int i=0;i<arr.length-1;i++)
7+
{
8+
arr[i]=arr[i]+arr[i+1];
9+
arr[i+1]=arr[i]-arr[i+1];
10+
arr[i]=arr[i]-arr[i+1];
11+
i++;
12+
}
13+
}
14+
}

‎Week5/A-Arrays I/Assignment5a/IntersectionOfTwoArraysII.txt

Lines changed: 18 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,18 @@
1+
2+
public class Solution{
3+
4+
public static void intersections(int arr1[], int arr2[]) {
5+
//Your code goes here
6+
for(int i=0;i<arr1.length;i++)
7+
{
8+
for(int j=0;j<arr2.length;j++)
9+
{
10+
if(arr1[i]!=-1 && arr2[j]!=-1 && arr1[i]==arr2[j])
11+
{
12+
System.out.print(arr1[i] +" ");
13+
arr1[i]=arr2[j]=-1;
14+
}
15+
}
16+
}
17+
}
18+
}

‎Week5/A-Arrays I/Assignment5a/SecondLargest.txt

Lines changed: 21 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,21 @@
1+
public class Solution {
2+
3+
public static int secondLargestElement(int[] arr, int n) {
4+
//Your code goes here
5+
int max1=arr[0],max2=arr[0];
6+
for(int i=1;i<arr.length;i++)
7+
{
8+
if(max1<arr[i])
9+
{
10+
max2=max1;
11+
max1=arr[i];
12+
}
13+
else if(max2<arr[i])
14+
{
15+
max2=arr[i];
16+
}
17+
}
18+
return max2;
19+
}
20+
21+
}

‎Week5/A-Arrays I/Assignment5a/Sort01.txt

Lines changed: 8 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,8 @@
1+
import java.util.Arrays;
2+
public class Solution {
3+
4+
public static void sortZeroesAndOne(int[] arr) {
5+
//Your code goes here
6+
Arrays.sort(arr);
7+
}
8+
}

‎Week5/A-Arrays I/LargestElementInTheArray.txt

Lines changed: 15 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,15 @@
1+
import java.util.* ;
2+
import java.io.*;
3+
4+
public class Solution {
5+
6+
static int largestElement(int[] arr, int n) {
7+
// Write your code here.
8+
int max=Integer.MIN_VALUE;
9+
for(int i:arr)
10+
{
11+
max=Math.max(max,i);
12+
}
13+
return max;
14+
}
15+
}

‎Week5/A-Arrays I/MinimumElement.txt

Lines changed: 15 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,15 @@
1+
import java.util.Scanner;
2+
public class Solution {
3+
4+
public static int minimum_element(int[] arr){
5+
6+
int min=Integer.MAX_VALUE;
7+
for(int i=0;i<arr.length;i++)
8+
{
9+
min=Math.min(min,arr[i]);
10+
}
11+
return min;
12+
13+
}
14+
15+
}

‎Week5/A-Arrays I/ReturnArraySum.txt

Lines changed: 13 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,13 @@
1+
2+
public class Solution {
3+
4+
public static int sum(int[] arr) {
5+
//Your code goes here
6+
int s=0;
7+
for(int i:arr)
8+
{
9+
s+=i;
10+
}
11+
return s;
12+
}
13+
}

‎Week5/A-Arrays I/SwapAlternate.txt

Lines changed: 14 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,14 @@
1+
2+
public class Solution {
3+
4+
public static void swapAlternate(int arr[]) {
5+
//Your code goes here
6+
for(int i=0;i<arr.length-1;i++)
7+
{
8+
arr[i]=arr[i]+arr[i+1];
9+
arr[i+1]=arr[i]-arr[i+1];
10+
arr[i]=arr[i]-arr[i+1];
11+
i++;
12+
}
13+
}
14+
}

‎Week5/B-Arrays - II/ArrayRotation.txt

Lines changed: 33 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,33 @@
1+
public class Solution {
2+
public static void changeToLeft(int a[],int pos,int b[])
3+
{
4+
for(int i=0;i<a.length;i++)
5+
{
6+
b[(i-pos+a.length)%a.length]=a[i];
7+
}
8+
}
9+
public static void changeToRight(int a[],int pos,int b[])
10+
{
11+
for(int i=0;i<a.length;i++)
12+
{
13+
b[(i+pos)%a.length]=a[i];
14+
}
15+
}
16+
public static int[] rotateArray(int []a, int x, String dir) {
17+
// Write your code here.
18+
int l=a.length;
19+
if(x>l)
20+
{
21+
x=x%l;
22+
}
23+
int b[]=new int[l];
24+
if(dir.equals("LEFT"))
25+
{
26+
changeToLeft(a,x,b);
27+
}
28+
else{
29+
changeToRight(a,x,b);
30+
}
31+
return b;
32+
}
33+
}

‎Week5/B-Arrays - II/Assignment5b/ArrangeNumbersInTheArray.txt

Lines changed: 19 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,19 @@
1+
2+
public class Solution {
3+
4+
public static void arrange(int[] arr, int n) {
5+
//Your code goes here
6+
int odds=(n+1)/2;
7+
int evens=n/2;
8+
for(int i=0;i<odds;i++)
9+
{
10+
arr[i]=2*i+1;
11+
}
12+
int r=1;
13+
for(int j=n-1;j>=odds;j--)
14+
{
15+
arr[j]=2*r;
16+
r+=1;
17+
}
18+
}
19+
}

‎Week5/B-Arrays - II/Assignment5b/PairSum.txt

Lines changed: 21 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,21 @@
1+
public class Solution {
2+
3+
public static int pairSum(int arr[], int x) {
4+
//Your code goes here
5+
int res=0;
6+
int l=arr.length;
7+
for(int i=0;i<l-1;i++)
8+
{
9+
int a=arr[i];
10+
int b=x-a;
11+
for(int j=i+1;j<l;j++)
12+
{
13+
if(arr[j]==b)
14+
{
15+
res+=1;
16+
}
17+
}
18+
}
19+
return res;
20+
}
21+
}

‎Week5/B-Arrays - II/Assignment5b/PrefixSum.txt

Lines changed: 12 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,12 @@
1+
public class Solution {
2+
3+
public static void prefixSum(int[] arr) {
4+
5+
//Write your code here
6+
7+
for(int i=1;i<arr.length;i++)
8+
{
9+
arr[i]+=arr[i-1];
10+
}
11+
}
12+
}

‎Week5/B-Arrays - II/Assignment5b/TripletSum.txt

Lines changed: 37 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,37 @@
1+
2+
public class Solution {
3+
public static int pairSum(int arr[], int x,int ind) {
4+
//Your code goes here
5+
int res=0;
6+
int l=arr.length;
7+
for(int i=ind;i<l-1;i++)
8+
{
9+
int a=arr[i];
10+
int b=x-a;
11+
for(int j=i+1;j<l;j++)
12+
{
13+
if(arr[j]==b)
14+
{
15+
res+=1;
16+
}
17+
}
18+
}
19+
return res;
20+
}
21+
22+
public static int findTriplet(int[] arr, int x)
23+
{
24+
//Your code goes here
25+
int count=0;
26+
for(int i=0;i<arr.length-2;i++)
27+
{
28+
int pradeep=arr[i];
29+
int bala=x-pradeep;
30+
int temp=pairSum(arr, bala, i+1);
31+
count+=temp;
32+
}
33+
return count;
34+
35+
}
36+
37+
}

‎Week5/B-Arrays - II/CheckArrayRotation.txt

Lines changed: 15 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,15 @@
1+
public class Solution {
2+
3+
public static int arrayRotateCheck(int[] arr){
4+
//Your code goes here
5+
for(int i=0;i<arr.length-1;i++)
6+
{
7+
if(arr[i] > arr[i+1])
8+
{
9+
return i+1;
10+
}
11+
}
12+
return 0;
13+
}
14+
15+
}

‎Week5/B-Arrays - II/MoveAllNegativeNumbers.txt

Lines changed: 20 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,20 @@
1+
public class Solution
2+
{
3+
public static int[] separateNegativeAndPositive(int a[])
4+
{
5+
int z=0,nz=0;
6+
int l=a.length;
7+
while(z!=l)
8+
{
9+
if(a[z]<0)
10+
{
11+
int temp=a[z];
12+
a[z]=a[nz];
13+
a[nz]=temp;
14+
nz+=1;
15+
}
16+
z+=1;
17+
}
18+
return a;
19+
}
20+
}

‎Week5/B-Arrays - II/MoveZeroesToEnd.txt

Lines changed: 31 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,31 @@
1+
2+
import java.util.ArrayList;
3+
import java.util.Collections;
4+
import java.util.*;
5+
6+
public class Solution {
7+
public static int[] moveZeros(int n,int []a)
8+
{
9+
// Write your code here.
10+
int l=a.length,count=0;
11+
for(int i=0;i<l;i++)
12+
{
13+
if(a[i]==0){
14+
count+=1;
15+
}
16+
}
17+
int ref=-1;
18+
for(int i=0;i<l;i++)
19+
{
20+
if(a[i]!=0)
21+
{
22+
a[ref+=1]=a[i];
23+
}
24+
}
25+
for(int i=0;i<count;i++)
26+
{
27+
a[ref+=1]=0;
28+
}
29+
return a;
30+
}
31+
}

‎Week5/B-Arrays - II/ReverseAnArray.txt

Lines changed: 14 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,14 @@
1+
public class Solution {
2+
public static int[] reverseArray(int n, int []nums) {
3+
// Write your code here.
4+
int l=nums.length;
5+
for(int i=0;i<l/2;i++)
6+
{
7+
nums[i]=nums[i]+nums[l-1-i];
8+
nums[l-1-i]=nums[i]-nums[l-1-i];
9+
nums[i]=nums[i]-nums[l-1-i];
10+
}
11+
return nums;
12+
13+
}
14+
}

‎Week5/B-Arrays - II/ReverseArrayBetween2Index.txt

Lines changed: 17 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,17 @@
1+
public class Solution {
2+
public static int[] reverseBetween(int n, int l, int r, int []arr) {
3+
// Write your code from here.
4+
for(int i=l;i<n;i++)
5+
{
6+
if(i<r)
7+
{
8+
arr[i]=arr[i]+arr[r];
9+
arr[r]=arr[i]-arr[r];
10+
arr[i]=arr[i]-arr[r];
11+
r-=1;
12+
}
13+
14+
}
15+
return arr;
16+
}
17+
}

0 commit comments

Comments
 (0)