DeltaX @placement_mate Channel on Telegram

DeltaX

@placement_mate


DeltaX (English)

Are you a student looking to kickstart your career with the perfect job placement? Look no further than DeltaX! This Telegram channel, with the username @placement_mate, is your go-to source for all things related to job placements. Whether you are in the final year of college or a recent graduate, DeltaX offers valuable insights, tips, and job opportunities to help you land your dream job. With a team of experienced professionals and industry experts, DeltaX provides personalized guidance and support to help you navigate the competitive job market. Stay updated with the latest job openings, resume tips, interview techniques, and career advice by joining DeltaX today. Don't let the job search process overwhelm you - let DeltaX be your placement mate on the journey to success!

DeltaX

25 Aug, 14:26


Channel name was changed to «DeltaX»

DeltaX

11 May, 10:12


Channel name was changed to «Accenture PADA»

DeltaX

11 May, 10:12


https://youtu.be/fOfRLeXvK44?si=G2OksGjBwlb8Y3Xs

DeltaX

15 Sep, 07:40


import java.util.Arrays;
import java.util.Scanner;

public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int N = scanner.nextInt();
int M = scanner.nextInt();
int[] A = new int[N];

for (int i = 0; i < N; i++) {
A[i] = scanner.nextInt();
}

Arrays.sort(A);

int minFunctionValue = Integer.MAX_VALUE;
for (int i = 0; i <= N - M; i++) {
int currentFunctionValue = A[i + M - 1] - A[i];
if (currentFunctionValue < minFunctionValue) {
minFunctionValue = currentFunctionValue;
}
}

System.out.println(minFunctionValue);
}
}

DeltaX

11 Sep, 07:33


import java.util.*;

public class Main {
public static boolean canPlace(int[] A, int N, int K, int mid) {
int count = 1;
int prev = A[0];

for (int i = 1; i < N; i++) {
if (A[i] - prev >= mid) {
count++;
prev = A[i];
}
}

return count >= K;
}

public static int largestMinDistance(int[] A, int N, int K) {
Arrays.sort(A);
int low = 1;
int high = A[N - 1] - A[0];

while (low <= high) {
int mid = low + (high - low) / 2;

if (canPlace(A, N, K, mid)) {
low = mid + 1;
} else {
high = mid - 1;
}
}

return high;
}

public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int N = scanner.nextInt();
int K = scanner.nextInt();
int[] A = new int[N];

for (int i = 0; i < N; i++) {
A[i] = scanner.nextInt();
}

int result = largestMinDistance(A, N, K);
System.out.println(result);
}
}

DeltaX

01 Sep, 09:41


Channel name was changed to «DeltaX»

DeltaX

31 Aug, 20:17


https://youtu.be/cseyBVfuO8o?si=4n6IJNGuUs7XqP60

If u can please subscribe this channel then I will update more such ongoing placement related questions.

DeltaX

31 Aug, 20:15


DeltaX pinned Deleted message

DeltaX

29 Aug, 17:33


Will update the deltaX pdf in the morning at 8 am.
Stay updated in the group

DeltaX

28 Aug, 05:26


Messages in this channel will no longer be automatically deleted

DeltaX

28 Aug, 05:26


Messages in this channel will be automatically deleted after 1 day

DeltaX

28 Aug, 02:58


Coding question

DeltaX

27 Aug, 19:40


Deltax tomorrow Online MCQ round is scheduled at 10AM. PDF of solution that will asked in the OA will be posted here before 9 AM. All the questions will be same from the pdf order of questions may change. All the best :)

DeltaX

27 Aug, 19:35


Channel name was changed to «Placement Mate»

1,357

subscribers

2

photos

2

videos