Confluent Interview Guide

Showing 3 of 11 questions

Ranking

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

Question

Frequency

Difficulty

LRU Cache

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

Very likely

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

Medium

#1. LRU Cache

Medium

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

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

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

Medium

#2. Time Based Key-Value Store

Medium

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

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

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.

Arrays

Somewhat likely

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

Medium

#3. Valid Sudoku

Medium

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

Arrays

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