Confluent Fulltime SDE Tech Phone Screen Interview Experience

The original poster (OP) interviewed with Confluent and reviewed interview experiences and questions from other users. They expressed gratitude and offered some information to help others. The coding

The original poster (OP) interviewed with Confluent and reviewed interview experiences and questions from other users. They expressed gratitude and offered some information to help others. The coding questions included two Leeuwenhoek Sudoku puzzles and a word search problem. The word search problem involved a list of documents, each with an ID and a string containing multiple words. The first question required designing a data structure to output a list of document IDs for a given query word. The second question asked how to solve queries like word1 AND word2 OR word3. The approach was to use AND and OR as non-leaf nodes in a binary tree, and word as a leaf node, then traversing the binary tree. It didn't require building the binary tree from the query; instead, it required writing functions to define the binary tree nodes and traverse the tree to obtain the results.