Front End Developer applicants have rated the interview process at Confluent with 2.7 out of 5 (where 5 is the highest level of difficulty) and assessed their interview experience as 100% positive. To compare, the company-average is 47.5% positive. This is according to Glassdoor user ratings.
Candidates applying for Front End Developer roles take an average of 7 days to get hired, when considering 3 user submitted interviews for this role. To compare, the hiring process at Confluent overall takes an average of 26 days.
Common stages of the interview process at Confluent as a Front End Developer according to 3 Glassdoor interviews include:
Phone interview: 40%
One on one interview: 40%
Skills test: 20%
Here are the most commonly searched roles for interview reports -
Initial recruiter call, frontend coding challenge, JavaScript and React questions, UI design discussion, system basics, behavioral interview, team fit chat, final manager round, offer decision, feedback, timeline, compensation, onboarding, startdate.
Interview questions [1]
Question 1
They asked me to build an interactive Accordion component, focusing on state management, accessibility, keyboard navigation, and clean, reusable React code.
I applied online. The process took 2 weeks. I interviewed at Confluent (Bengaluru) in Jul 2024
Interview
4 rounds all technical
1,2 core typescript all you can think of
3,4 any thing random they will call it system design but it depends on interviewer if he know fe he will ask fe if knows back end than he can ask something else
Interview questions [1]
Question 1
What is prototype then all followup questions to deep dive
This is an OA description, not a interview. The HackerRank coding challenge will assess your coding fundamentals and algorithms. Once you begin the challenge, you will have 70 minutes to complete it.
Interview questions [1]
Question 1
2 OA question. One is by chair. One is Given two arrays where array 'a' is fixed and array 'b' can be rearranged, for example a: 1,2,3,4,5 and b: 2,6,4,3,5. The objective is to rearrange array 'b' in such a way that as many numbers in 'b' as possible are greater than their corresponding numbers in 'a'. Finally, the sum of numbers in 'b' that are greater than the corresponding numbers in 'a' is calculated. For example, if a: 1,2,3,4,5 and b: 2,3,4,5,6 -> return 2+3+4+5+6.