← Back to Directory

BitKernel interview notes, page 1 of 2

Small

Screna has 18 BitKernel interview write-ups. The most reported round is the technical phone screen (18).

18 interview notes · updated Jul 2026

BitKernel·Software Engineer·Technical Phone Screen

Apr 2026
Interviewed for a software engineer role at Bitkernel and got a file systems question that felt more like an OS exam than a coding screen. Not the most intense round but it tested whether you actually understood storage internals.
  • Which physical file structure is NOT suitable when a file system needs to support efficient random access to records? (Sequential/contiguous, Indexed, Linked, or Hash)

“The answer is linked files.”

View Post

BitKernel·Software Engineer·Technical Phone Screen

Apr 2026
Interviewed for a Software Engineer role at Bitkernel and got hit with a networking fundamentals question about HTTP status codes. Pretty standard stuff but easy to slip up on if you half-remember the 4xx vs 5xx distinction.
  • Which of the following statements about HTTP status codes is incorrect? Options cover what 100, 2xx, 301, and 4xx mean respectively.

“The answer is D.”

View Post

BitKernel·Software Engineer·Technical Phone Screen

Apr 2026
Did a technical screen for a Software Engineer role at Bitkernel. One question on relational database fundamentals, pretty quick.
  • Which of the following statements about primary keys in a relational database is incorrect? (a) Every column in the primary key must be NOT NULL. (b) Every column in the primary key must be unique. (c) A table can have only one primary key. (d) Primary keys can be defined at the column level or table level.

“The answer is B and I second-guessed myself for a bit.”

View Post

BitKernel·Software Engineer·Technical Phone Screen

May 2026
Interviewed for a Software Engineer role at Bitkernel and ran into a logic puzzle that looked deceptively simple. One question, four cups, and I definitely second-guessed myself more than once.
  • Four cups sit on a table, each with a statement: Cup 1 says all cups contain fruit candy. Cup 2 says it contains apples. Cup 3 says it does not contain chocolate. Cup 4 says some cups do not contain fruit candy. Exactly one statement is true. Which must be true: (A) all cups have fruit candy, (B) no cup has fruit candy, (C) no cup has apples, or (D) the third cup contains chocolate?

“I spent way too long on this.”

View Post

BitKernel·Software Engineer·Technical Phone Screen

May 2026
Interviewed for a software engineering role at Bitkernel and got hit with a recursive function tracing question. Not the most complex thing in the world but I definitely fumbled the execution a bit.
  • Given a recursive function where x(n) returns 1 if n <= 3, otherwise returns x(n-2) + x(n-4) + 1, how many total calls to x are made when computing x(8), counting the initial call?

“I started tracing the call tree on paper which was the right move, but I kept losing track of branches halfway through.”

View Post

BitKernel·Software Engineer·Technical Phone Screen

May 2026
Had a technical screen at Bitkernel for a software engineer role. Just one question but it was the kind that looks straightforward until you actually trace through it by hand.
  • An 18-element sorted array is searched using binary search (1-based indexing, mid = floor((low + high) / 2)). What sequence of indices does the search examine when looking for the element at position 3?

“I almost went with 1, 2, 3 because my brain defaulted to linear search logic.”

View Post

BitKernel·Software Engineer·Technical Phone Screen

May 2026
Interviewed for a software engineer role at Bitkernel and got hit with a database concurrency question that felt more like a quiz than a conversation.
  • Two transactions read the same data item concurrently, then each writes back a modified version based on their original read. What concurrency problem does this scenario illustrate?

“The answer is lost update, which in hindsight is obvious once you trace through what actually ends up in the database.”

View Post

BitKernel·Software Engineer·Technical Phone Screen

May 2026
Did a coding screen for a Software Engineer role at Bitkernel, basically one browser JavaScript question. Pretty straightforward but there were a couple of edge cases I had to think through carefully.
  • Implement a function `showPopupAndRedirect(message, targetUrl)` that shows a popup with the given message, then redirects to `targetUrl` after the user closes it. The redirect should only happen if `targetUrl` is a non-empty string. Use only vanilla JavaScript and built-in browser APIs.

“My first instinct was just to use `alert(message)` and then set `window.location.href = targetUrl` right after.”

View Post

BitKernel·Software Engineer·Technical Phone Screen

May 2026
Bitkernel had a binary search question that looked straightforward but was actually a trap for anyone who hadn't thought carefully about how the algorithm narrows its search window. Short round, one question, left me second-guessing myself.
  • Given a sorted array containing the keys 180, 200, 450, and 500, which of the following sequences of comparisons cannot occur during a single run of binary search: (A) 500, 200, 450, 180 (B) 500, 450, 200, 180 (C) 180, 500, 200, 450 (D) 180, 200, 500, 450?

“I stared at this longer than I'd like to admit.”

View Post

BitKernel·Software Engineer·Technical Phone Screen

May 2026
Interviewed for a Software Engineer role at Bitkernel. The technical question was a classic tree/forest reconstruction problem that looks straightforward until you actually have to trace through it.
  • Given a binary tree's inorder traversal (A, B, C, D, E, F, G) and postorder traversal (B, D, C, A, F, G, E), the tree is converted to a forest using the left-child/right-sibling representation. How many trees does the resulting forest contain?

“I reconstructed the original binary tree from the two traversals first, which took a minute.”

View Post