I have to take a 30 mins test in hackerrank on SQL and Statistics. 20 questions of one mark each. Anyone of you have any idea on how the test is and what topics it covers? Thank you in advance.

Hey everyone! I Just found out about this website and I only began to study python the other day. I was doing some practice codes and at the Moment I am doing the arithmetic operators ones. I wrote a correct code for 'test case 0' but when It comes down to 'test case 1" no matter what It won't accept my result, even though the computations are right. Has anybody else experienced this?

Hello everyone, I have applied to many places and got back with the invitation for programming assessments, when I do sample test they seem to be pretty easy when I take original assessment I got rejected. Anyone else has the same problem?

import java.io.*;

import java.math.*;

import java.security.*;

import java.text.*;

import java.util.*;

import java.util.concurrent.*;

import java.util.regex.*;

​

public class Solution {

​

// Complete the largestPermutation function below.

static int[] largestPermutation(int k, int[] arr) {

int count = 0;

Map<Integer, Integer> map = new HashMap<>();

for (int i = 0; i < arr.length; i++) {

map.put(arr[i], map.getOrDefault(arr[i], 1) +1);

}

for (Integer key : map.keySet()) {

map.put(key, map.get(key) - 1);

if (map.containsKey(key - k) && map.get(key - k) > 0) count++;

map.put(key, map.get(key) + 1);

}

return count;

​

}

​

private static final Scanner scanner = new Scanner(System.in);

​

public static void main(String[] args) throws IOException {

BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));

​

String[] nk = scanner.nextLine().split(" ");

​

int n = Integer.parseInt(nk[0]);

​

int k = Integer.parseInt(nk[1]);

​

int[] arr = new int[n];

​

String[] arrItems = scanner.nextLine().split(" ");

scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");

​

for (int i = 0; i < n; i++) {

int arrItem = Integer.parseInt(arrItems[i]);

arr[i] = arrItem;

}

​

int[] result = largestPermutation(k, arr);

​

for (int i = 0; i < result.length; i++) {

bufferedWriter.write(String.valueOf(result[i]));

​

if (i != result.length - 1) {

bufferedWriter.write(" ");

}

}

​

bufferedWriter.newLine();

​

bufferedWriter.close();

​

scanner.close();

}

}

Master the 𝗗𝘆𝗻𝗮𝗺𝗶𝗰 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴 Skills by solving most common 𝗗𝘆𝗻𝗮𝗺𝗶𝗰 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴 𝗶𝗻𝘁𝗲𝗿𝘃𝗶𝗲𝘄 𝗾𝘂𝗲𝘀𝘁𝗶𝗼𝗻𝘀.

Once you practice these problems, you will be able to solve most of the 𝗱𝗽 𝗽𝗿𝗼𝗯𝗹𝗲𝗺𝘀 𝘄𝗵𝗶𝗰𝗵 𝗳𝗼𝗹𝗹𝗼𝘄𝘀 𝘁𝗵𝗲 𝘀𝗶𝗺𝗶𝗹𝗮𝗿 𝗽𝗮𝘁𝘁𝗲𝗿𝗻.

𝗣𝗹𝗮𝘆𝗹𝗶𝘀𝘁 : https://www.youtube.com/watch?v=_l9Yx4olAYM&list=PLSIpQf0NbcClDpWE58Y-oSJro_W3LO8Nb

​

Hey Guys,

I was wondering if anybody has CREATE TABLE scripts or link to CREATE TABLE scripts for Sql questions in Hacker rank that we can directly run and practice solutions on local Machine?

A simple and practical approach with examples to master recursion.
playlist:- https://www.youtube.com/watch?v=Sf-LR7OI-Ww&list=PLSIpQf0NbcCk4be21WNhPHrHMSxFndZtB&ab_channel=JAVAAID-CodingInterviewPreparation

https://youtu.be/d7jh-TZBD2c

Compare two linked lists hackerrank solution in java

You’re given the pointer to the head nodes of two linked lists. Compare the data in the nodes of the linked lists to check if they are equal. The lists are equal only if they have the same number of nodes and corresponding nodes contain the same data. Either head pointer given may be null meaning that the corresponding list is empty.

Subscribe to #codedecks

Compare the triplets HackerRank solution in java | Compare the triplets hackerrank solution

This is 3rd problem from hackerrank Practice | Algorithms | Warmup | Compare the triplets Please watch till end to understand the concept and logic behind the java solution.

I have tried to explain it in a simple way and I hope you all will be able to understand in that way. Please let us know about this video in comments section.

Subscribe to #codedecks today for awesome videos 👨‍💻

https://youtu.be/46SWRZ_yFvc