Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by Whatfix Team. If you also belong to the team, you can get access from here

Whatfix Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Whatfix Lead Front End Developer Interview Questions and Answers

Updated 12 Jun 2024

Whatfix Lead Front End Developer Interview Experiences

1 interview found

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Referral and was interviewed in May 2024. There were 2 interview rounds.

Round 1 - One-on-one 

(2 Questions)

  • Q1. Can you explain React Higher Order Component to a 5 year old
  • Ans. 

    Higher Order Component is like a magic spell that can make any component do special things.

    • HOC is a function that takes a component and returns a new component with added functionality

    • It's like adding a superpower to a regular component

    • For example, a HOC can add authentication or data fetching capabilities to a component

  • Answered by AI
  • Q2. Why would you use React class component over functional component
  • Ans. 

    Class components have access to lifecycle methods and state, while functional components are simpler and more lightweight.

    • Class components have access to lifecycle methods such as componentDidMount, componentDidUpdate, componentWillUnmount, etc.

    • Class components have the ability to hold and manage local component state.

    • Functional components are simpler, more lightweight, and easier to read and test.

    • Functional components...

  • Answered by AI
Round 2 - One-on-one 

(2 Questions)

  • Q1. Design a Todo system in React
  • Ans. 

    A Todo system in React for managing tasks and deadlines

    • Use React state to manage the list of tasks

    • Create components for adding, editing, and deleting tasks

    • Implement functionality for marking tasks as completed

    • Include a filter option for viewing completed and pending tasks

  • Answered by AI
  • Q2. Store the Todo items in the local storage and retrieve them

Interview Preparation Tips

Topics to prepare for Whatfix Lead Front End Developer interview:
  • React JS
  • Javascript
Interview preparation tips for other job seekers - Prepare strongly in React JS, Hooks, and custom hooks.

Skills evaluated in this interview

Interview questions from similar companies

Interview Questionnaire 

3 Questions

  • Q1. N a line where words are separated by spaces, , and capitalize first letter of the reversed word. Other letters of the word should be in small. Input : “how are you?” → Output: “Woh Era ?uoy”
  • Ans. 

    The program capitalizes the first letter of each reversed word in a sentence.

    • Split the sentence into an array of words using space as a delimiter.

    • Reverse each word in the array and capitalize the first letter.

    • Join the modified words back into a sentence.

  • Answered by AI
  • Q2. He second question reduced to finding maximum weight matching in a bipartite graph. Not many people would have done this (maybe none)
  • Q3. There are 2 sets of countries. One set will donate clothes (something of this sort) and anotherset will accept clothes. A country can be in only 1 of the sets. The amount of clothes donated is also given. ...

Interview Preparation Tips

Round: Test
Experience: There were about 20 MCQs (30 minutes) to be done after the coding section. MCQs were totally nonsense. Can be done in 10 mins.For coding section 60 mins.  It was hosted on Hackerrank.
Duration: 90 minutes
Total Questions: 2

Round: Technical Interview
Experience: After this, selected candidates were interviewed that consists of 4 rounds and discussion was mostly on your CV and data structure problems.

General Tips: Be honest with your interviewer. If you are not comfortable in 1 topic, tell your interviewer honestly. Do well in other areas. Look for hints from the interviewer if you get stuck. They want to see how you approach a problem.
Skills: Algortihm, Data structure
College Name: IIT DELHI

I was interviewed before Mar 2021.

Round 1 - Coding Test 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Easy

  • Q1. 

    Level Order Traversal Problem Statement

    Given a binary tree of integers, return the level order traversal of the binary tree.

    Input:

    The first line contains an integer 'T', representing the number of te...
  • Ans. 

    Return the level order traversal of a binary tree given in level order with null nodes represented by -1.

    • Create a queue to store nodes for level order traversal

    • Start with the root node and add it to the queue

    • While the queue is not empty, dequeue a node, print its value, and enqueue its children

    • Repeat until all nodes are traversed in level order

  • Answered by AI
Round 2 - Coding Test 

(1 Question)

Round duration - 45 minutes
Round difficulty - Easy

  • Q1. What is a deadlock in DBMS, and can you explain the concepts of join and query?
  • Ans. 

    A deadlock in DBMS occurs when two or more transactions are waiting for each other to release locks, causing them to be stuck indefinitely.

    • Deadlock is a situation where two or more transactions are unable to proceed because each is waiting for the other to release locks.

    • To prevent deadlocks, DBMS uses techniques like deadlock detection and prevention algorithms.

    • Joins in DBMS are used to combine rows from two or more ta...

  • Answered by AI
Round 3 - Coding Test 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Medium

  • Q1. Design a system for Twitter, outlining the key components and architecture involved.
  • Ans. 

    Design a system for Twitter

    • Key components: user profiles, tweets, hashtags, timelines

    • Architecture: microservices, load balancers, databases, caching

    • Scalability: sharding, replication, CDN

    • Real-time processing: streaming APIs, push notifications

  • Answered by AI
Round 4 - Coding Test 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

  • Q1. 

    Maximum Subarray Sum Queries

    You are provided with an array of ‘N’ integers and ‘Q’ queries. Each query requires calculating the maximum subarray sum in a specified range of the array.

    Input:

    The first ...
  • Ans. 

    Implement a function to calculate maximum subarray sum queries in a given range of an array.

    • Iterate through each query and calculate the maximum subarray sum within the specified range using Kadane's algorithm.

    • Keep track of the maximum sum found so far and update it as needed.

    • Return the maximum subarray sum for each query in the test case.

  • Answered by AI
  • Q2. 

    Sort 0 1 2 Problem Statement

    Given an integer array arr of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.

    Input:

    The first line contains an integer 'T' representing the n...
  • Ans. 

    Sort an integer array containing only 0s, 1s, and 2s in linear time complexity.

    • Use a single scan over the array to sort it in-place.

    • Maintain three pointers for 0s, 1s, and 2s and swap elements accordingly.

    • Example: Input: [0, 2, 1, 2, 0], Output: [0, 0, 1, 2, 2]

  • Answered by AI
Round 5 - Coding Test 

Round duration - 20 Minutes
Round difficulty - Medium

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in ChennaiEligibility criteria7 CGPAFreshworks interview preparation:Topics to prepare for the interview - Algorithms, Data Structures, Dynamic Programming, OOPS, System DesignTime required to prepare for the interview - 2.5 MonthsInterview preparation tips for other job seekers

Tip 1 : Prepare DS and Algo
Tip 2 : Prepare Dynamic programming 

Application resume tips for other job seekers

Tip 1 : Good in DS and algo that will be help in the interview that is very neccassry
Tip 2 : Prepare DBMS

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview Questionnaire 

1 Question

  • Q1. Simple basic c programing questions

Interview Questionnaire 

1 Question

  • Q1. 1st round c mcq 2nd round short coding 3rd round advanced coding 4 and 5 technical hr and general hr
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Company Website and was interviewed in Jun 2024. There was 1 interview round.

Round 1 - HR 

(3 Questions)

  • Q1. Tell me something about your self ?
  • Q2. What are your strengths?
  • Q3. Why are you interested in this job?

Interview Preparation Tips

Interview preparation tips for other job seekers - Identify career goals
Dedicate to time search
Keep your self busy
Use several job search websites
Optimize your linkedin profile
Make networking part of your everyday life
Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(1 Question)

  • Q1. Print Longest Increasing Subsequence
  • Ans. 

    Print the longest increasing subsequence of an array of strings.

    • Use dynamic programming to find the longest increasing subsequence.

    • Iterate through the array and keep track of the longest increasing subsequence ending at each index.

    • Return the longest increasing subsequence found.

  • Answered by AI

Skills evaluated in this interview

Interview experience
1
Bad
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

1. max of sub-array
2.snake-to-camel

Interview Preparation Tips

Interview preparation tips for other job seekers - 1. As a start you will receive an email about a coding assignment with no expiration date.
2. On the basis of that test only they can reject you irrespective of the situation.
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

Topics - array , tree , string baics
platorm - hackerank

I was interviewed in Oct 2021.

Round 1 - Coding Test 

(4 Questions)

Round duration - 90 minutes
Round difficulty - Hard

They gave around 7 days of time for attending the test.
It had 4 coding questions out of which I solved 2 fully and 2 partially. 
Questions were medium-hard and based on DSA.

  • Q1. 

    Find the Third Greatest Element

    Given an array 'ARR' of 'N' distinct integers, determine the third largest element in the array.

    Input:

    The first line contains a single integer 'T' representing the numb...
  • Ans. 

    Find the third largest element in an array of distinct integers.

    • Sort the array in descending order and return the element at index 2.

    • Handle cases where the array has less than 3 elements separately.

    • Consider edge cases like negative integers and duplicates.

  • Answered by AI
  • Q2. 

    Wildcard Pattern Matching Problem Statement

    Implement a wildcard pattern matching algorithm to determine if a given wildcard pattern matches a text string completely.

    The wildcard pattern may include the...

  • Ans. 

    Implement a wildcard pattern matching algorithm to determine if a given wildcard pattern matches a text string completely.

    • Create a recursive function to match the pattern with the text character by character.

    • Handle cases for '?' and '*' characters in the pattern.

    • Use dynamic programming to optimize the solution.

    • Check for edge cases like empty pattern or text.

  • Answered by AI
  • Q3. 

    Detect and Remove Loop in Linked List

    For a given singly linked list, identify if a loop exists and remove it, adjusting the linked list in place. Return the modified linked list.

    Expected Complexity:

    A...

  • Ans. 

    Detect and remove loop in a singly linked list with O(n) time complexity and O(1) space complexity.

    • Use Floyd's Cycle Detection Algorithm to identify the loop in the linked list.

    • Once the loop is detected, use two pointers to find the start of the loop.

    • Adjust the pointers to remove the loop and return the modified linked list.

    • Example: For input 5 2 and elements 1 2 3 4 5, output should be 1 2 3 4 5.

  • Answered by AI
  • Q4. 

    Longest Common Subsequence Problem Statement

    Given two strings STR1 and STR2, determine the length of their longest common subsequence.

    A subsequence is a sequence that can be derived from another sequen...

  • Ans. 

    The task is to find the length of the longest common subsequence between two given strings.

    • Implement a function to find the longest common subsequence length.

    • Use dynamic programming to solve the problem efficiently.

    • Iterate through the strings to find the common subsequence.

    • Handle edge cases like empty strings or equal strings.

    • Example: For input 'abcde' and 'ace', the longest common subsequence is 'ace' with a length of

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as Software Developer in BangaloreEligibility criteriaNo criteriaFreshworks interview preparation:Topics to prepare for the interview - Java, Data Structures, Algorithms, OOPS, DBMS, OSTime required to prepare for the interview - 8 monthsInterview preparation tips for other job seekers

Tip 1 : Practice programming daily
Tip 2 : Don't go after development when you are applying as a fresher, focus on DSA and CP. 
Tip 3 : Apply for multiple companies.

Application resume tips for other job seekers

Tip 1 : Keep it simple in one page
Tip 2 : Use novoresume.com for nice templates
Tip 3 : Mention your projects and experience clearly.

Final outcome of the interviewSelected

Skills evaluated in this interview

Whatfix Interview FAQs

How many rounds are there in Whatfix Lead Front End Developer interview?
Whatfix interview process usually has 2 rounds. The most common rounds in the Whatfix interview process are One-on-one Round.
What are the top questions asked in Whatfix Lead Front End Developer interview?

Some of the top questions asked at the Whatfix Lead Front End Developer interview -

  1. Can you explain React Higher Order Component to a 5 year ...read more
  2. Why would you use React class component over functional compon...read more
  3. Design a Todo system in Re...read more

Tell us how to improve this page.

Whatfix Lead Front End Developer Interview Process

based on 1 interview

Interview experience

4
  
Good
View more

Interview Questions from Similar Companies

Zoho Interview Questions
4.3
 • 505 Interviews
Swiggy Interview Questions
3.8
 • 425 Interviews
Udaan Interview Questions
4.0
 • 333 Interviews
Meesho Interview Questions
3.7
 • 328 Interviews
Zepto Interview Questions
3.5
 • 207 Interviews
Blinkit Interview Questions
3.7
 • 179 Interviews
BlackBuck Interview Questions
3.8
 • 175 Interviews
Freshworks Interview Questions
3.5
 • 155 Interviews
Tata 1mg Interview Questions
3.6
 • 146 Interviews
Paisabazaar.com Interview Questions
3.4
 • 139 Interviews
View all
Solution Engineer
46 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Customer Success Manager
25 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Business Development Representative
23 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Project Manager
20 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Development Engineer II
20 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Whatfix with

Freshworks

3.5
Compare

Zoho

4.3
Compare

Druva

3.7
Compare

Postman

3.6
Compare
Did you find this page helpful?
Yes No
write
Share an Interview