Freecharge Reactjs Developer Interview Questions and Answers

Round duration - 75 Minutes
Round difficulty - Medium

The round consisted of 2 Coding based based questions.
These question were easy for as I have already done this while preparing.

Q1. 
Flip Equivalent Binary Tree Problem
Determine whether two binary trees, given by their roots 'ROOT1' and 'ROOT2', are flip equivalent. A tree can be transformed into a flip equivalent through any number o...read more
Ans. 
The problem is to determine if two binary trees are flip equivalent after performing flip operations on one of the trees.
• Perform a depth-first search (DFS) on both trees simultaneously

• At each node, check if the values are equal and the left and right subtrees are either both null or both not null

• If the above conditions are met, recursively check the flip equivalence of the left and right subtrees

• If any of the condition...read more
Answered by AI
Add your answer
Q2. 
Split Array Into Increasing Subsequences Problem Statement
You are provided with an integer array ARR of size N sorted in ascending order. Your task is to determine if it is possible to split this array i...read more
Ans. 
The task is to determine if an integer array can be split into one or more increasing subsequences with a length of at least 3.
• Check if the array can be split into increasing subsequences by iterating through the array.

• Keep track of the current subsequence and its length while iterating.

• If the difference between the current element and the previous element is not 1, start a new subsequence.

• If the length of any subseque...read more
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

The interview started a bit late as I it to be at 11:30 am but started at 12:15pm So Had to wait. Apart from these the overall experience was great and the interviewer was also kind and had a smiling face.

Q1. 
Ninja and Alternating Largest Problem Statement
Ninja is given a sequence of numbers and needs to rearrange them so that every second element is greater than its neighbors on both sides.
Example:
Input:
...read more
Ans. 
The task is to rearrange the given array such that every second element is greater than its left and right element.
• Iterate through the array and check if every second element is greater than its left and right element

• If not, swap the current element with its adjacent element to satisfy the condition

• Continue this process until the entire array satisfies the condition

• Return 1 if the array satisfies the condition, else re...read more
Answered by AI
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

10:30 PM 
Interviewer was Cool.

Round duration - 5 minutes
Round difficulty - Easy

At 10:00 am

Q1. Questions based on DSA
Add your answer

Q1. Java specific Interview
Add your answer

Q1. Hiring Manager Interview
Add your answer

Q1. Project discussion
Add your answer

Q1. Tell about yourself
Add your answer
Q2. Past experience
Add your answer
Q3. Last ctc salary
Ans. 
Discussing last CTC salary helps gauge expectations and market alignment for the Team Lead role.
• CTC stands for Cost to Company, which includes all benefits and allowances.

• For example, if my last CTC was $80,000, it included base salary, bonuses, and health benefits.

• It's important to consider the entire compensation package, not just the base salary.

• I believe in transparency regarding salary discussions to ensure mutual...read more
Answered by AI
Add your answer

Q1. DSA Round & Introduction Round
Add your answer
Q2. DP Question related to subsequence
Add your answer

Q1. Design Parking Lot
Ans. 
Design a parking lot system with multiple levels and spots for cars.
• Create a class for ParkingLot with attributes like levels, spots per level, etc.

• Implement methods for parking a car, removing a car, checking availability, etc.

• Consider implementing a ticketing system for tracking parked cars.

• Utilize data structures like arrays, lists, or maps to manage parking spots efficiently.
Answered by AI
Add your answer
Q2. Sort Numbers with large file
Ans. 
Use external sorting algorithm like merge sort to efficiently sort numbers in a large file.
• Break the large file into smaller chunks that can fit into memory

• Sort each chunk individually using a sorting algorithm like merge sort

• Merge the sorted chunks back together to get the final sorted result
Answered by AI
Add your answer

Moderate coding which will be easy if you are a computer science student

Q1. Tell me about yourself
Add your answer
Q2. What is your favourite subject
Add your answer