Whatfix logo

Whatfix Software Engineer Interview Questions
& Process

Real candidates share what happened, how many rounds they had,
and how the experience turned out.

Based on 49 interview experiences · FREE TO READ

3.9 Rounds average
Average Typical difficulty
75.5% Positive experience

Candidate interview experiences

First-hand accounts from people who interviewed at Whatfix.

Showing 3 of 49
Whatfix logo
Whatfix

Software Engineer Intern

Engineering · nearly a year ago

Intern Average Positive experience No offer 4 rounds
Interview process
Technical screen Technical screen Technical screen Recruiter call
Interview formats
Coding Technical Technical Behavioral

I had an online coding assessment on HackerEarth, followed by 3 rounds of interviews. The first interview was a DS Algo round where I was asked questions based on my resume and LeetCode problems like Buy and Sell stocks and longest prefix. Then there was an advanced DS Algo round. Lastly, I had an HR interview.

Confirmed questions4 questions
  • Could you discuss Data Structures and Algorithms questions, with a focus on your resume and projects?
  • Can you solve the 'Buy and Sell Stocks' problem?
  • What is the longest common prefix?
Whatfix logo
Whatfix

Software Engineer

Engineering · nearly a year ago

Entry Average Positive experience No offer 4 rounds
Interview process
Technical screen Technical screen Recruiter call Recruiter call
Interview formats
Coding Technical Behavioral

The interview had 4 rounds in total. Round 1 was about data structures and algorithms. Round 2 was about advanced data structures. Round 3 was a managerial round. Round 4 was an HR round. The first round went okay. I was asked a simple question where I had to use an inverted stack for the optimal approach. In the second round, a Leetcode hard question (dp) was asked.

Confirmed questions2 questions
  • In round 1, I was asked a simple question requiring the use of an inverted stack for an optimal approach, along with some OOPS questions about implementing interfaces.
  • In round 2, I was asked a Leetcode hard question involving dynamic programming.
Whatfix logo
Whatfix

Software Development Engineer

Engineering · more than a year ago

Senior Difficult Negative experience No offer 7 rounds
Interview process
Recruiter call Technical screen Onsite Offer
Interview formats
Technical Coding Behavioral

Overall 7 rounds of interviews, 4 virtual and 3 onsite. I cleared all rounds and was asked to share documents for processing. The recruiter went silent for a while and then mentioned they needed time to make a hiring decision, which is unclear why. The recruiter also doesn't know what's happening. It felt like a waste of time, and I had to travel a lot for the onsite interviews for no reason. I suggest the hiring team be clear about their expectations and value candidates' time. Being unprofessional while running a company is not acceptable. Don't be unethical or play with emotions. Be grateful to candidates for considering your company. Again, please be professional and don't play with emotions.

Confirmed questions8 questions
  • Could you build an auto-suggestion component?
  • Can you explain the basics of JavaScript?
  • Can you explain the basics of React?

Whatfix Software Engineer Interview Questions

Quoted word for word from Whatfix interview reports.

Find the maximum sum between a root and a leaf node, along with the path.

Read reports

Given an array of integers A representing rope lengths, find the minimum cost to connect them all into a single rope, where the cost of connecting two ropes is the sum of their lengths. You can combine any two ropes at each step.

Read reports

What is the default initial capacity of a HashMap and why is it 16?

Read reports

How to print the path between two nodes in a Binary Search Tree?

Read reports

How can the efficiency of finding an index in a HashMap be improved using the '&' operation?

Read report

What is the output of this code snippet: const add = (function () { let counter = 0; return function () {counter += 1; return counter} })(); add(); add(); add();

Read report

Given a 2D matrix with 1s and 0s, how would you fan out the 1s to adjacent cells (left, right, top, bottom) if they exist, ensuring O(n x m) time complexity and avoiding O(n x m) space complexity?

Read report

Imagine you receive daily dumps of 100 log files, each 1 GB, named log1, log2, and so on. Given a specific timestamp, how would you efficiently determine which log file contains the relevant logs?

Read report

How would you build a Trie that supports insertion, deletion, and prefix searches?

Read report

Formats, difficulty and experience

Across all 49 Whatfix interview reports.

Interview formats

Technical 37.4%
Coding 32%
Behavioral 20.4%
System Design 7.5%
Presentation 1.4%

Interview difficulty

Easy 6.1%
Average 65.3%
Difficult 28.6%

Candidate experience

Positive 75.5%
Negative 16.3%
Neutral 8.2%