i
Whatfix
Filter interviews by
I applied via Referral and was interviewed in May 2024. There were 2 interview rounds.
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
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...
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
Top trending discussions
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.
I was interviewed before Mar 2021.
Round duration - 60 Minutes
Round difficulty - Easy
Given a binary tree of integers, return the level order traversal of the binary tree.
The first line contains an integer 'T', representing the number of te...
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
Round duration - 45 minutes
Round difficulty - Easy
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...
Round duration - 60 Minutes
Round difficulty - Medium
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
Round duration - 60 Minutes
Round difficulty - Medium
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.
The first ...
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.
Given an integer array arr
of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.
The first line contains an integer 'T' representing the n...
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]
Round duration - 20 Minutes
Round difficulty - Medium
Tip 1 : Prepare DS and Algo
Tip 2 : Prepare Dynamic programming
Tip 1 : Good in DS and algo that will be help in the interview that is very neccassry
Tip 2 : Prepare DBMS
posted on 10 Jul 2024
I applied via Company Website and was interviewed in Jun 2024. There was 1 interview round.
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.
1. max of sub-array
2.snake-to-camel
Topics - array , tree , string baics
platorm - hackerank
I was interviewed in Oct 2021.
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.
Given an array 'ARR' of 'N' distinct integers, determine the third largest element in the array.
The first line contains a single integer 'T' representing the numb...
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.
Implement a wildcard pattern matching algorithm to determine if a given wildcard pattern matches a text string completely.
The wildcard pattern may include the...
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.
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.
A...
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.
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...
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
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.
Tip 1 : Keep it simple in one page
Tip 2 : Use novoresume.com for nice templates
Tip 3 : Mention your projects and experience clearly.
based on 1 interview
Interview experience
Solution Engineer
46
salaries
| ₹0 L/yr - ₹0 L/yr |
Customer Success Manager
25
salaries
| ₹0 L/yr - ₹0 L/yr |
Business Development Representative
23
salaries
| ₹0 L/yr - ₹0 L/yr |
Project Manager
20
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Development Engineer II
20
salaries
| ₹0 L/yr - ₹0 L/yr |
Freshworks
Zoho
Druva
Postman