Hackerrank - Making Anagrams

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 - Insertion Sort - Part 2

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

Hackerrank - Counting Sort 1

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

Java

Javascript

Hackerrank - Separate the Numbers

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 - Two Characters

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 […]