Block Interview Questions

Showing 12 questions

Ranking

A question's ranking corresponds to how commonly it's asked by Block. The higher the ranking, the more likely you'll encounter it in a Block interview.

Question

Frequency

Difficulty

Rotating the Box

Simulate a box tilting to the right, causing stones to fall until they hit obstacles or the floor. Re-arrange the characters in a given grid to reflect the resulting state of the box.

ArraysTwo Pointers

If you have a Block interview, it's very likely that you will get this question

#1. Rotating the Box

Simulate a box tilting to the right, causing stones to fall until they hit obstacles or the floor. Re-arrange the characters in a given grid to reflect the resulting state of the box.

ArraysTwo Pointers

This question is very likely to be asked in your Block interview

Squirrel Simulation

Imagine a squirrel trying to collect nuts efficiently. Find the minimum distance the squirrel must travel to collect all nuts and bring them to a tree, given the locations of the squirrel, tree, and nuts.

ArraysGreedy Algorithms

If you have a Block interview, it's very likely that you will get this question

#2. Squirrel Simulation

Imagine a squirrel trying to collect nuts efficiently. Find the minimum distance the squirrel must travel to collect all nuts and bring them to a tree, given the locations of the squirrel, tree, and nuts.

ArraysGreedy Algorithms

This question is very likely to be asked in your Block interview

Word Break

Determine if a given string can be segmented into a space-separated sequence of words from a dictionary. You are given a string and a dictionary of words; can you break the string down using words from the dictionary?

ArraysStringsDynamic Programming

Somewhat likely

If you have a Block interview, you might get this question

#3. Word Break

Determine if a given string can be segmented into a space-separated sequence of words from a dictionary. You are given a string and a dictionary of words; can you break the string down using words from the dictionary?

ArraysStringsDynamic Programming

This question is somewhat likely to be asked in your Block interview

Count Nice Pairs in an Array

You're given an array of numbers. Find how many pairs of numbers in the array satisfy a specific 'nice' property determined by reversing their digits and comparing them.

ArraysTwo Pointers

Somewhat likely

If you have a Block interview, you might get this question

#4. Count Nice Pairs in an Array

You're given an array of numbers. Find how many pairs of numbers in the array satisfy a specific 'nice' property determined by reversing their digits and comparing them.

ArraysTwo Pointers

This question is somewhat likely to be asked in your Block interview

Walking Robot Simulation II

Simulate a robot moving around a rectangular grid, following specific movement rules and boundary conditions. You need to implement the robot's movement and track its position and direction after each step.

Somewhat likely

If you have a Block interview, you might get this question

#5. Walking Robot Simulation II

Simulate a robot moving around a rectangular grid, following specific movement rules and boundary conditions. You need to implement the robot's movement and track its position and direction after each step.

This question is somewhat likely to be asked in your Block interview

Pancake Sorting

Given an array, sort it using pancake flips. Each flip reverses a portion of the array; find the sequence of flips to sort the array.

ArraysGreedy Algorithms

If you have a Block interview, it's unlikely that you will get this question

#6. Pancake Sorting

Given an array, sort it using pancake flips. Each flip reverses a portion of the array; find the sequence of flips to sort the array.

ArraysGreedy Algorithms

This question is not likely to be asked in your Block interview

Falling Squares

Imagine dropping squares of varying sizes onto a number line. Calculate the height of the tallest stack of squares after each drop.

ArraysTwo PointersSliding Windows

If you have a Block interview, it's unlikely that you will get this question

#7. Falling Squares

Imagine dropping squares of varying sizes onto a number line. Calculate the height of the tallest stack of squares after each drop.

ArraysTwo PointersSliding Windows

This question is not likely to be asked in your Block interview

Available Captures for Rook

On a chessboard, find how many pawns a rook can capture in one move. The rook can move horizontally or vertically until it hits an obstacle or the edge of the board.

If you have a Block interview, it's unlikely that you will get this question

#8. Available Captures for Rook

On a chessboard, find how many pawns a rook can capture in one move. The rook can move horizontally or vertically until it hits an obstacle or the edge of the board.

This question is not likely to be asked in your Block interview

Number of Black Blocks

Imagine a grid where some 2x2 blocks are marked. Count how many unique integers from 0 to 4 (inclusive) represent the number of marked cells within those 2x2 blocks that intersect with given coordinates.

ArraysSliding Windows

If you have a Block interview, it's unlikely that you will get this question

#9. Number of Black Blocks

Imagine a grid where some 2x2 blocks are marked. Count how many unique integers from 0 to 4 (inclusive) represent the number of marked cells within those 2x2 blocks that intersect with given coordinates.

ArraysSliding Windows

This question is not likely to be asked in your Block interview

Implement Trie (Prefix Tree)

Design a data structure that efficiently stores a set of strings and allows for prefix-based searches. Implement methods to insert strings, search for complete words, and check if any word starts with a given prefix.

If you have a Block interview, it's unlikely that you will get this question

#10. Implement Trie (Prefix Tree)

Design a data structure that efficiently stores a set of strings and allows for prefix-based searches. Implement methods to insert strings, search for complete words, and check if any word starts with a given prefix.

This question is not likely to be asked in your Block interview

Design a Text Editor

Simulate the basic operations of a text editor. Implement functions to add text, delete characters, and move the cursor.

If you have a Block interview, it's unlikely that you will get this question

#11. Design a Text Editor

Simulate the basic operations of a text editor. Implement functions to add text, delete characters, and move the cursor.

This question is not likely to be asked in your Block interview

The Maze

You're given a maze represented by a matrix, and a starting point. Determine if it's possible to reach the maze's destination by rolling a ball through open spaces.

If you have a Block interview, it's unlikely that you will get this question

#12. The Maze

You're given a maze represented by a matrix, and a starting point. Determine if it's possible to reach the maze's destination by rolling a ball through open spaces.

This question is not likely to be asked in your Block interview

Copyright © Taro