Skip to content

Commit 1e53250

Browse files
kwojcickikwojcicki
committed
copying over hackerank solutions
1 parent a9f6b63 commit 1e53250

File tree

47 files changed

+1579
-0
lines changed

Some content is hidden

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

47 files changed

+1579
-0
lines changed

‎.project

+11
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,11 @@
1+
<?xml version="1.0" encoding="UTF-8"?>
2+
<projectDescription>
3+
<name>coding_questions</name>
4+
<comment></comment>
5+
<projects>
6+
</projects>
7+
<buildSpec>
8+
</buildSpec>
9+
<natures>
10+
</natures>
11+
</projectDescription>

‎hackerrank/.classpath

+6
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,6 @@
1+
<?xml version="1.0" encoding="UTF-8"?>
2+
<classpath>
3+
<classpathentry kind="con" path="org.eclipse.jdt.launching.JRE_CONTAINER/org.eclipse.jdt.internal.debug.ui.launcher.StandardVMType/JavaSE-1.8"/>
4+
<classpathentry kind="src" path="src"/>
5+
<classpathentry kind="output" path="bin"/>
6+
</classpath>

‎hackerrank/.gitignore

+1
Original file line numberDiff line numberDiff line change
@@ -0,0 +1 @@
1+
/bin/

‎hackerrank/.project

+17
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,17 @@
1+
<?xml version="1.0" encoding="UTF-8"?>
2+
<projectDescription>
3+
<name>rankhacker</name>
4+
<comment></comment>
5+
<projects>
6+
</projects>
7+
<buildSpec>
8+
<buildCommand>
9+
<name>org.eclipse.jdt.core.javabuilder</name>
10+
<arguments>
11+
</arguments>
12+
</buildCommand>
13+
</buildSpec>
14+
<natures>
15+
<nature>org.eclipse.jdt.core.javanature</nature>
16+
</natures>
17+
</projectDescription>

‎hackerrank/.settings/org.eclipse.jdt.core.prefs

+11
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,11 @@
1+
eclipse.preferences.version=1
2+
org.eclipse.jdt.core.compiler.codegen.inlineJsrBytecode=enabled
3+
org.eclipse.jdt.core.compiler.codegen.targetPlatform=1.8
4+
org.eclipse.jdt.core.compiler.codegen.unusedLocal=preserve
5+
org.eclipse.jdt.core.compiler.compliance=1.8
6+
org.eclipse.jdt.core.compiler.debug.lineNumber=generate
7+
org.eclipse.jdt.core.compiler.debug.localVariable=generate
8+
org.eclipse.jdt.core.compiler.debug.sourceFile=generate
9+
org.eclipse.jdt.core.compiler.problem.assertIdentifier=error
10+
org.eclipse.jdt.core.compiler.problem.enumIdentifier=error
11+
org.eclipse.jdt.core.compiler.source=1.8

‎hackerrank/src/solutions/.classpath

+6
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,6 @@
1+
<?xml version="1.0" encoding="UTF-8"?>
2+
<classpath>
3+
<classpathentry kind="con" path="org.eclipse.jdt.launching.JRE_CONTAINER/org.eclipse.jdt.internal.debug.ui.launcher.StandardVMType/JavaSE-1.8"/>
4+
<classpathentry kind="src" path="src"/>
5+
<classpathentry kind="output" path="bin"/>
6+
</classpath>

‎hackerrank/src/solutions/.gitignore

+1
Original file line numberDiff line numberDiff line change
@@ -0,0 +1 @@
1+
/bin/

‎hackerrank/src/solutions/.project

+17
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,17 @@
1+
<?xml version="1.0" encoding="UTF-8"?>
2+
<projectDescription>
3+
<name>solutions</name>
4+
<comment></comment>
5+
<projects>
6+
</projects>
7+
<buildSpec>
8+
<buildCommand>
9+
<name>org.eclipse.jdt.core.javabuilder</name>
10+
<arguments>
11+
</arguments>
12+
</buildCommand>
13+
</buildSpec>
14+
<natures>
15+
<nature>org.eclipse.jdt.core.javanature</nature>
16+
</natures>
17+
</projectDescription>

‎hackerrank/src/solutions/.settings/org.eclipse.jdt.core.prefs

+11
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,11 @@
1+
eclipse.preferences.version=1
2+
org.eclipse.jdt.core.compiler.codegen.inlineJsrBytecode=enabled
3+
org.eclipse.jdt.core.compiler.codegen.targetPlatform=1.8
4+
org.eclipse.jdt.core.compiler.codegen.unusedLocal=preserve
5+
org.eclipse.jdt.core.compiler.compliance=1.8
6+
org.eclipse.jdt.core.compiler.debug.lineNumber=generate
7+
org.eclipse.jdt.core.compiler.debug.localVariable=generate
8+
org.eclipse.jdt.core.compiler.debug.sourceFile=generate
9+
org.eclipse.jdt.core.compiler.problem.assertIdentifier=error
10+
org.eclipse.jdt.core.compiler.problem.enumIdentifier=error
11+
org.eclipse.jdt.core.compiler.source=1.8

‎hackerrank/src/solutions/src/solutions/data_structures/array_left_rotation/Solution.java

+42
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,42 @@
1+
package solutions.data_structures.array_left_rotation;
2+
3+
import java.util.Scanner;
4+
5+
public class Solution {
6+
7+
8+
9+
private static final Scanner scanner = new Scanner(System.in);
10+
11+
public static void main(String[] args) {
12+
String[] nd = scanner.nextLine().split(" ");
13+
14+
int n = Integer.parseInt(nd[0]);
15+
16+
int d = Integer.parseInt(nd[1]);
17+
18+
int[] a = new int[n];
19+
20+
String[] aItems = scanner.nextLine().split(" ");
21+
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
22+
23+
for (int i = 0; i < n; i++) {
24+
int aItem = Integer.parseInt(aItems[i]);
25+
a[i] = aItem;
26+
}
27+
28+
29+
for(int i = 0; i < n; i++) {
30+
System.out.print(a[(i + d) % n]);
31+
32+
if( i != n - 1) {
33+
System.out.print(" ");
34+
}
35+
}
36+
37+
38+
39+
scanner.close();
40+
}
41+
}
42+

‎hackerrank/src/solutions/src/solutions/data_structures/arrays_ds/Solution.java

+52
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,52 @@
1+
package solutions.data_structures.arrays_ds;
2+
3+
import java.io.BufferedWriter;
4+
import java.io.FileWriter;
5+
import java.io.IOException;
6+
import java.util.Scanner;
7+
8+
public class Solution {
9+
10+
// Complete the hourglassSum function below.
11+
static int hourglassSum(int[][] arr) {
12+
int maxSum = Integer.MIN_VALUE;
13+
14+
for(int i = 0; i < arr.length - 2; i++) {
15+
for(int j = 0; j < arr[i].length - 2; j++) {
16+
maxSum = Math.max(maxSum, arr[i][j] + arr[i][j + 1] + arr[i][j + 2] +
17+
arr[i + 1][j + 1] +
18+
arr[i + 2][j] + arr[i + 2][j + 1] + arr[i + 2][j + 2]
19+
);
20+
}
21+
}
22+
23+
return maxSum;
24+
}
25+
26+
private static final Scanner scanner = new Scanner(System.in);
27+
28+
public static void main(String[] args) throws IOException {
29+
BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));
30+
31+
int[][] arr = new int[6][6];
32+
33+
for (int i = 0; i < 6; i++) {
34+
String[] arrRowItems = scanner.nextLine().split(" ");
35+
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
36+
37+
for (int j = 0; j < 6; j++) {
38+
int arrItem = Integer.parseInt(arrRowItems[j]);
39+
arr[i][j] = arrItem;
40+
}
41+
}
42+
43+
int result = hourglassSum(arr);
44+
45+
bufferedWriter.write(String.valueOf(result));
46+
bufferedWriter.newLine();
47+
48+
bufferedWriter.close();
49+
50+
scanner.close();
51+
}
52+
}

‎hackerrank/src/solutions/src/solutions/data_structures/compare_two_linked_links/Solution.java

+121
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,121 @@
1+
package solutions.data_structures.compare_two_linked_links;
2+
3+
import java.io.BufferedWriter;
4+
import java.io.FileWriter;
5+
import java.io.IOException;
6+
import java.util.Scanner;
7+
8+
public class Solution {
9+
10+
static class SinglyLinkedListNode {
11+
public int data;
12+
public SinglyLinkedListNode next;
13+
14+
public SinglyLinkedListNode(int nodeData) {
15+
this.data = nodeData;
16+
this.next = null;
17+
}
18+
}
19+
20+
static class SinglyLinkedList {
21+
public SinglyLinkedListNode head;
22+
public SinglyLinkedListNode tail;
23+
24+
public SinglyLinkedList() {
25+
this.head = null;
26+
this.tail = null;
27+
}
28+
29+
public void insertNode(int nodeData) {
30+
SinglyLinkedListNode node = new SinglyLinkedListNode(nodeData);
31+
32+
if (this.head == null) {
33+
this.head = node;
34+
} else {
35+
this.tail.next = node;
36+
}
37+
38+
this.tail = node;
39+
}
40+
}
41+
42+
public static void printSinglyLinkedList(SinglyLinkedListNode node, String sep, BufferedWriter bufferedWriter) throws IOException {
43+
while (node != null) {
44+
bufferedWriter.write(String.valueOf(node.data));
45+
46+
node = node.next;
47+
48+
if (node != null) {
49+
bufferedWriter.write(sep);
50+
}
51+
}
52+
}
53+
54+
// Complete the compareLists function below.
55+
56+
/*
57+
* For your reference:
58+
*
59+
* SinglyLinkedListNode {
60+
* int data;
61+
* SinglyLinkedListNode next;
62+
* }
63+
*
64+
*/
65+
static boolean compareLists(SinglyLinkedListNode head1, SinglyLinkedListNode head2) {
66+
while(head1 != null && head2 != null) {
67+
if(head1.data != head2.data) {
68+
return false;
69+
}
70+
71+
head1 = head1.next;
72+
head2 = head2.next;
73+
}
74+
75+
return head1 == head2 && head1 == null;
76+
}
77+
78+
private static final Scanner scanner = new Scanner(System.in);
79+
80+
public static void main(String[] args) throws IOException {
81+
BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));
82+
83+
int tests = scanner.nextInt();
84+
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
85+
86+
for (int testsItr = 0; testsItr < tests; testsItr++) {
87+
SinglyLinkedList llist1 = new SinglyLinkedList();
88+
89+
int llist1Count = scanner.nextInt();
90+
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
91+
92+
for (int i = 0; i < llist1Count; i++) {
93+
int llist1Item = scanner.nextInt();
94+
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
95+
96+
llist1.insertNode(llist1Item);
97+
}
98+
99+
SinglyLinkedList llist2 = new SinglyLinkedList();
100+
101+
int llist2Count = scanner.nextInt();
102+
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
103+
104+
for (int i = 0; i < llist2Count; i++) {
105+
int llist2Item = scanner.nextInt();
106+
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
107+
108+
llist2.insertNode(llist2Item);
109+
}
110+
111+
boolean result = compareLists(llist1.head, llist2.head);
112+
113+
bufferedWriter.write(String.valueOf(result ? 1 : 0));
114+
bufferedWriter.newLine();
115+
}
116+
117+
bufferedWriter.close();
118+
119+
scanner.close();
120+
}
121+
}

‎hackerrank/src/solutions/src/solutions/data_structures/crush/Solution.java

+58
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,58 @@
1+
package solutions.data_structures.crush;
2+
3+
import java.io.BufferedWriter;
4+
import java.io.FileWriter;
5+
import java.io.IOException;
6+
import java.util.Arrays;
7+
import java.util.Scanner;
8+
9+
public class Solution {
10+
11+
// Complete the arrayManipulation function below.
12+
static long arrayManipulation(int n, int[][] queries) {
13+
long[] ints = new long[n];
14+
15+
for(int i = 0; i < queries.length; i++) {
16+
for(int j = queries[i][0] - 1; j <= queries[i][1]; j++) {
17+
ints[j - 1] += queries[i][2];
18+
}
19+
}
20+
21+
22+
return Arrays.stream(ints).max().getAsLong();
23+
}
24+
25+
private static final Scanner scanner = new Scanner(System.in);
26+
27+
public static void main(String[] args) throws IOException {
28+
BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));
29+
30+
String[] nm = scanner.nextLine().split(" ");
31+
32+
int n = Integer.parseInt(nm[0]);
33+
34+
int m = Integer.parseInt(nm[1]);
35+
36+
int[][] queries = new int[m][3];
37+
38+
for (int i = 0; i < m; i++) {
39+
String[] queriesRowItems = scanner.nextLine().split(" ");
40+
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
41+
42+
for (int j = 0; j < 3; j++) {
43+
int queriesItem = Integer.parseInt(queriesRowItems[j]);
44+
queries[i][j] = queriesItem;
45+
}
46+
}
47+
48+
long result = arrayManipulation(n, queries);
49+
50+
bufferedWriter.write(String.valueOf(result));
51+
bufferedWriter.newLine();
52+
53+
bufferedWriter.close();
54+
55+
scanner.close();
56+
}
57+
}
58+

0 commit comments

Comments
 (0)