I was used to working on one task, one screen, in one application window. Arguments in favor that keep spinning in my head: Boris Cherny (Head of Claude Code) works across 5 parallel instances. Peter Steinberger (creator of OpenClaw) runs 3-8 Codex terminals at once. It makes sense on paper – why watch AI "think" […]
I also wanted to try what it feels like to “code something” just for fun. I came up with a project that I had in my head for a long time, but I never found the time to finish it – probably because of its time demands. I too fell for Claude Code and told […]
This year, I participated in several technical interview rounds for two different positions at Bloomreach. I decided to try a different approach: I completely avoided looking at candidates’ profiles – no CVs, no LinkedIn, no internal notes from previous rounds. My Strategy I prepared for each interview using only the candidate’s assignment solution. My reasoning […]
A month ago, I decided to fully switch to the Colemak keyboard layout. Until then, I had been typing on QWERTY and didn’t know how to type with all ten fingers. Now, I can type at a speed of about 30 words per minute. Why did I decide to make this change? I’m digitizing my […]
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(""); } } |