Confluent Interview Guide

#1. LRU Cache

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

Design a data structure that acts as a Least Recently Used (LRU) cache. Implement methods to get and put key-value pairs, evicting the least recently used entry when the cache is full.

Linked Lists

Time Based Key-Value Store

Design a key-value store that supports storing values with timestamps. You should be able to retrieve the latest value for a key that's less than or equal to a given timestamp.

StringsBinary Search

Very likely

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

#2. Time Based Key-Value Store

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

Design a key-value store that supports storing values with timestamps. You should be able to retrieve the latest value for a key that's less than or equal to a given timestamp.

StringsBinary Search

Valid Sudoku

Determine if a given 9x9 Sudoku board is valid. Check if each row, column, and 3x3 subgrid contains the digits 1-9 without repetition.

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

Somewhat likely

#3. Valid Sudoku

Determine if a given 9x9 Sudoku board is valid. Check if each row, column, and 3x3 subgrid contains the digits 1-9 without repetition.

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

Minimum Time to Eat All Grains

You are given a set of grain piles and a number of chickens. Determine the minimum time required for all chickens to eat all the grains, where each chicken can eat from only one pile at a time.

ArraysBinary SearchGreedy AlgorithmsDynamic Programming

Somewhat likely

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

#4. Minimum Time to Eat All Grains

ArraysBinary SearchGreedy AlgorithmsDynamic Programming

You are given a set of grain piles and a number of chickens. Determine the minimum time required for all chickens to eat all the grains, where each chicken can eat from only one pile at a time.

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

Sudoku Solver

Fill in the empty cells of a partially completed Sudoku grid according to the game's rules. The goal is to complete the grid so that each row, column, and 3x3 subgrid contains all digits from 1 to 9 without repetition.

If you have a Confluent interview, it's unlikely that you will get this question. Confluent does ask it, but it's rare

#5. Sudoku Solver

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

Combination Sum

Find all unique combinations of numbers from a given array that sum up to a specific target value. You can use the same number multiple times.

If you have a Confluent interview, it's unlikely that you will get this question. Confluent does ask it, but it's rare

#6. Combination Sum

Find all unique combinations of numbers from a given array that sum up to a specific target value. You can use the same number multiple times.

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

Design Authentication Manager

Design a system to manage user authentication tokens. Implement features to generate, renew, and count unexpired tokens, while handling token expiration.

If you have a Confluent interview, it's unlikely that you will get this question. Confluent does ask it, but it's rare

#7. Design Authentication Manager

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

Design a system to manage user authentication tokens. Implement features to generate, renew, and count unexpired tokens, while handling token expiration.

Count Subarrays With Median K

Given an array and a target number K, count the number of subarrays whose median is equal to K. Remember that the median is the middle element after sorting.

If you have a Confluent interview, it's unlikely that you will get this question. Confluent does ask it, but it's rare

#8. Count Subarrays With Median K

Given an array and a target number K, count the number of subarrays whose median is equal to K. Remember that the median is the middle element after sorting.

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

Regular Expression Matching

Determine if an input string matches a given regular expression that supports '.' and '*' characters. The '.' matches any single character, and '*' matches zero or more occurrences of the preceding element.

StringsDynamic ProgrammingRecursion

If you have a Confluent interview, it's unlikely that you will get this question. Confluent does ask it, but it's rare

#9. Regular Expression Matching

StringsDynamic ProgrammingRecursion

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

Debounce

Implement a debounce function that limits the rate at which a function can fire. You should only execute the function after a certain amount of idle time has passed.

If you have a Confluent interview, it's unlikely that you will get this question. Confluent does ask it, but it's rare

#10. Debounce

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

Implement a debounce function that limits the rate at which a function can fire. You should only execute the function after a certain amount of idle time has passed.

Number of Atoms

Decode a chemical formula to count the number of atoms of each element. The formula may contain nested parentheses and numbers indicating counts.

StringsStacksRecursion

If you have a Confluent interview, it's unlikely that you will get this question. Confluent does ask it, but it's rare

#11. Number of Atoms