In the world of programming, the distinction between Java and JavaScript often stirs confusion. Despite their similar names, these two languages are as different as chalk and cheese. To illustrate this point, let’s delve into a whimsical analogy: Java is to JavaScript as van is to vanillin. This comparison might seem odd at first, but […]
The year 2023, or the 3rd quarter, I have noticed that we divide ourselves like this. There is someone in my little bubble who is looking for a change at work. I am sometimes helpful and we discuss companies and positions. I saw several job descriptions. One thing caught my attention. The requirements state that […]
How do you find a good npm package? This article is based on my Openslava 2018 talk. While there are so many npm packages available to download. Which criteria do you use to find a good npm package? Is it downloads, GitHub stars, recommendation, documentation, …? NPM NPM – abbreviated from Node package manager, is […]
Recursion In computer science recursion is a function, which calls itself in the functio body. The function call is always conditional to ensure that calculation ends. Šaral as a problem-oriented programming langugage supports writing recursive procedures and functions. Specifics of a recursive function in Šaral The function recursion is different than in other programming languages. […]
Hackerrank – Problem Statement A description of the problem can be found on Hackerrank. Solution First, I have found common characters in both strings (intersection of characters) and calculate the count. Then I haves substracted string one length and intersection chars count. Similar way substraction of string 2 length and intersection chars count. The result […]
Hackerrank – Problem Statement A description of the problem can be found on Hackerrank. Solution Look at the implementation. I created solution in: Java All solutions are also available on my GitHub profile. Java
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 |
import java.util.*; public class Solution { public static void insertionSortPart2(int[] ar) { for(int i = 1; i < ar.length; i++) { int num = ar[i]; int swapPos = i - 1; int l = i - 1; boolean isSwap = false; while(l >= 0) { if(num < ar[l]) { isSwap = true; swapPos = l; l--; } else { break; } } if(isSwap) { for(int j = i - 1; j >= swapPos ; j--) { ar[j + 1] = ar[j]; } ar[swapPos] = num; } printArray(ar); } } public static void main(String[] args) { Scanner in = new Scanner(System.in); int s = in.nextInt(); int[] ar = new int[s]; for(int i=0;i<s;i++){ ar[i]=in.nextInt(); } insertionSortPart2(ar); } private static void printArray(int[] ar) { for(int n: ar){ System.out.print(n+" "); } System.out.println(""); } } |
Hackerrank – Problem Statement A description of the problem can be found on Hackerrank. Solution Look at the implementation. I created solution in: Scala Java Javascript All solutions are also available on my GitHub profile. Scala
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 |
import scala.io.Source object Solution{ def countingSort(arr: Array[Int]): Array[Int] = { val countsOfNumbers = arr.sorted.groupBy(i => i).map(a => (a._1, a._2.length)) (0 until 100).map(countsOfNumbers.getOrElse(_, 0)).toArray } def main(args: Array[String]) { val lines = Source.stdin.getLines().toList val arr = lines.tail.head.split(" ").map(_.toInt) val result = countingSort(arr) println (result.mkString(" ")) } } |
Java
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 |
import java.util.*; public class Solution { static int[] countingSort(int[] arr) { int[] counts = new int[100]; for(int i = 0; i < arr.length; i++) { counts[arr[i]]++; } return counts; } public static void main(String[] args) { Scanner in = new Scanner(System.in); int n = in.nextInt(); int[] arr = new int[n]; for(int arr_i = 0; arr_i < n; arr_i++){ arr[arr_i] = in.nextInt(); } int[] result = countingSort(arr); for (int i = 0; i < result.length; i++) { System.out.print(result[i] + (i != result.length - 1 ? " " : "")); } System.out.println(""); in.close(); } } |
Javascript
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 |
'use strict'; const counting = (arr) => { const counts = [] for(let i = 0; i < 100; i++) { counts[i] = 0; } for(let i = 0; i < arr.length; i++) { counts[arr[i]]++; } console.log(counts.join(' ')); } const processData = input => { const lines = input.split('\n'); const arr = lines[1].split(' ').map(i => parseInt(i)); counting(arr); }; process.stdin.resume(); process.stdin.setEncoding("ascii"); let _input = ""; process.stdin.on("data", input => _input += input); process.stdin.on("end", () => processData(_input)); |
Hackerrank – Problem Statement A description of the problem can be found on Hackerrank. Solution I explain my solution with following examples: Example 1234 I start with a beginning of a string, which would be one digit number – 1 and try to examine a rest of the given string 234. Next, I check the […]
Hackerrank – Problem Statement A description of the problem can be found on Hackerrank. Solution I started with finding all unique characters. Then I created all possible combinations of pairs. I deleted other characters except the pair. I found if the examined pair contains alternating characters in deleted strings If yes I count the length […]
Hackerrank – Problem Statement A description of the problem can be found on Hackerrank. Solution I loop throught all steps and remeber the level from the sea (level). If it is D, I decrement by 1, if U increment by 1. When such situation happen that actual sea level is 0 and current step is […]