Upload Button Icon Add office photos
Engaged Employer

i

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

Freecharge Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Freecharge Reactjs Developer Interview Questions, Process, and Tips

Updated 23 Aug 2024

Freecharge Reactjs Developer Interview Experiences

1 interview found

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
-
Result
Not Selected

I appeared for an interview in Jul 2024.

Round 1 - Technical 

(4 Questions)

  • Q1. Explain Virtual Dom
  • Ans. 

    Virtual DOM is a lightweight copy of the actual DOM, used for efficient updates and rendering in React applications.

    • Virtual DOM is a concept in React where a lightweight copy of the actual DOM is created and updated in memory.

    • When changes are made to the state of a component, React compares the virtual DOM with the actual DOM and only updates the necessary parts, minimizing performance impact.

    • This process of updating t...

  • Answered by AI
  • Q2. Explain New Features in ReactJS
  • Ans. 

    ReactJS has introduced new features like Hooks, Context API, Suspense, and Concurrent Mode.

    • Introduction of Hooks allows functional components to have state and lifecycle methods.

    • Context API provides a way to pass data through the component tree without having to pass props down manually at every level.

    • Suspense enables components to suspend rendering while waiting for something to load, like data from an API.

    • Concurrent ...

  • Answered by AI
  • Q3. Explain High Order Components using the example
  • Ans. 

    High Order Components are functions that take a component and return a new component with additional functionality.

    • HOCs are used to share code between components.

    • They can be used for adding authentication, logging, or other functionalities to components.

    • Example: a HOC that adds a loading spinner while data is being fetched.

  • Answered by AI
  • Q4. Explain the reducer method in js using the example
  • Ans. 

    Reducer method in JavaScript is used to manage state changes in applications by taking the current state and an action as input and returning a new state.

    • Reducer function takes two parameters - the current state and an action

    • It then determines how the state should change based on the action type

    • The reducer function returns a new state based on the action type

  • Answered by AI

Skills evaluated in this interview

Interview questions from similar companies

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
4-6 weeks
Result
Selected Selected

I applied via Job Portal and was interviewed before Sep 2023. There were 4 interview rounds.

Round 1 - Coding Test 

Medium level leet code questions

Round 2 - One-on-one 

(1 Question)

  • Q1. Low Leven system design of Instagram.
  • Ans. 

    Low level system design of Instagram involves designing the core components like database, storage, caching, and networking.

    • Use sharding to distribute data across multiple database servers for scalability.

    • Implement a caching layer using Redis or Memcached to improve performance.

    • Utilize a content delivery network (CDN) for faster content delivery to users.

    • Design a fault-tolerant storage system to ensure data durability ...

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

(1 Question)

  • Q1. Creating a high level design of a message queue system
  • Ans. 

    Designing a message queue system for efficient communication between components

    • Define the requirements and constraints of the system

    • Choose a suitable messaging protocol (e.g. AMQP, MQTT)

    • Design the message format and structure

    • Implement mechanisms for message persistence and delivery guarantees

    • Consider scalability and fault tolerance

    • Use appropriate data structures and algorithms for efficient message handling

  • Answered by AI
Round 4 - HR 

(2 Questions)

  • Q1. What are your goals ?
  • Ans. 

    My goal is to continuously improve my technical skills, contribute to impactful projects, and eventually move into a leadership role.

    • Continuously improve technical skills through learning new technologies and best practices

    • Contribute to impactful projects by delivering high-quality code and solutions

    • Work towards moving into a leadership role by taking on more responsibilities and mentoring junior team members

  • Answered by AI
  • Q2. Why you choose jupiter
  • Ans. 

    I chose Jupiter because of its strong gravitational pull and potential for scientific exploration.

    • Jupiter's large size and mass make it a key player in shaping the solar system

    • Its strong magnetic field and radiation belts provide valuable insights for space research

    • Jupiter's moons, like Europa and Io, offer unique environments for potential exploration missions

  • Answered by AI

Skills evaluated in this interview

I appeared for an interview in Apr 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 90 minutes
Round difficulty - Medium

Timing was 9 PM. Platform was not good. Platform was very lagging so overall it was bad experience.

  • 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.

    • Use a set to store distinct elements for efficient processing.

  • Answered by AI
  • Q2. 

    Longest Palindromic Substring Problem Statement

    You are provided with a string STR of length N. The task is to find the longest palindromic substring within STR. If there are several palindromic substring...

  • Ans. 

    Find the longest palindromic substring in a given string.

    • Iterate through the string and expand around each character to find palindromes

    • Keep track of the longest palindrome found so far

    • Return the longest palindromic substring

  • Answered by AI
  • Q3. 

    Ninja and Geometry Problem Statement

    In this problem, Ninja is provided with two lines on a 2D plane. The first line 'AB' is determined by two points A and B. The second line 'PQ' is determined by two poi...

  • Ans. 

    Calculate the intersection point of two lines on a 2D plane with precision up to six decimal places.

    • Implement a function to calculate the intersection point of two lines on a 2D plane

    • Handle precision up to six decimal places in the output

    • Return -1.000000 -1.000000 if the lines do not intersect

    • Ensure the lines 'AB' and 'PQ' are distinct

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAJupiter Money interview preparation:Topics to prepare for the interview - Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic ProgrammingTime required to prepare for the interview - 1.5 monthsInterview preparation tips for other job seekers

Tip 1 : Have some projects.
Tip 2 : Do a course from Coding Ninjas.

Application resume tips for other job seekers

Tip 1 : Keep it short
Tip 2 : Add skills iff you are sure

Final outcome of the interviewRejected

Skills evaluated in this interview

I appeared for an interview in Apr 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 90 minutes
Round difficulty - Medium

Timing was 9 PM. Platform was not good. Platform was very lagging so overall it was bad experience.

  • 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 there are less than 3 elements in the array.

    • Consider edge cases like negative integers and duplicates.

  • Answered by AI
  • Q2. 

    Longest Palindromic Substring Problem Statement

    You are provided with a string STR of length N. The goal is to identify the longest palindromic substring within this string. In cases where multiple palind...

  • Ans. 

    Identify the longest palindromic substring in a given string.

    • Iterate through each character in the string and expand around it to find palindromes

    • Keep track of the longest palindrome found so far

    • Return the longest palindromic substring with the smallest start index

  • Answered by AI
  • Q3. 

    Ninja and Geometry Problem Statement

    In this problem, Ninja is provided with two lines on a 2D plane. The first line 'AB' is determined by two points A and B. The second line 'PQ' is determined by two poi...

  • Ans. 

    Calculate the intersection point of two lines on a 2D plane with precision up to six decimal places.

    • Implement a function to calculate the intersection point of two lines on a 2D plane

    • Handle precision up to six decimal places in the output

    • Return -1.000000 -1.000000 if the lines do not intersect

    • Ensure the lines 'AB' and 'PQ' are distinct

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Chitkara University. Eligibility criteriaAbove 7 CGPAJupiter Money interview preparation:Topics to prepare for the interview - Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic ProgrammingTime required to prepare for the interview - 2.5 monthsInterview preparation tips for other job seekers

Tip 1 : Have some projects.
Tip 2 : Do a course from Coding Ninjas.

Application resume tips for other job seekers

Tip 1 : Keep it short.
Tip 2 : Do not put false things.

Final outcome of the interviewRejected

Skills evaluated in this interview

I appeared for an interview in Apr 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 90 minutes
Round difficulty - Hard

Timing was 9 PM. Platform was not good. Platform was very lagging so overall it was bad experience.

  • 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 using a set to ensure distinct elements in the array.

  • Answered by AI
  • Q2. 

    Longest Palindromic Substring Problem Statement

    You are provided with a string STR of length N. The goal is to identify the longest palindromic substring within this string. In cases where multiple palind...

  • Ans. 

    Identify the longest palindromic substring in a given string.

    • Iterate through the string and expand around each character to find palindromes

    • Keep track of the longest palindrome found

    • Return the longest palindromic substring with the smallest start index

  • Answered by AI
  • Q3. 

    Ninja and Geometry Problem Statement

    In this problem, Ninja is provided with two lines on a 2D plane. The first line 'AB' is determined by two points A and B. The second line 'PQ' is determined by two poi...

  • Ans. 

    Calculate the intersection point of two lines on a 2D plane with precision up to six decimal places.

    • Use the formula for finding the intersection point of two lines in 2D space.

    • Handle precision issues that may arise due to floating-point arithmetic.

    • Return -1.000000 -1.000000 if the lines do not intersect.

    • Ensure the lines 'AB' and 'PQ' are distinct.

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAJupiter Money interview preparation:Topics to prepare for the interview - Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic ProgrammingTime required to prepare for the interview - 2.5 monthsInterview preparation tips for other job seekers

Tip 1 : Have some projects.
Tip 2 : Do a course from Coding Ninjas.
 

Application resume tips for other job seekers

Tip 1 : Keep it short.
Tip 2 : Do not put false things.

Final outcome of the interviewRejected

Skills evaluated in this interview

I appeared for an interview in May 2022.

Round 1 - Coding Test 

(1 Question)

Round duration - 50 mins
Round difficulty - Medium

First round was coding round, where i was asked 2 DS algo questions, 1 was easy and other was of medium difficulty

  • Q1. 

    Shortest Path in a Binary Matrix Problem Statement

    Given a binary matrix of size N * M where each element is either 0 or 1, find the shortest path from a source cell to a destination cell, consisting only...

  • Ans. 

    Find the shortest path in a binary matrix from a source cell to a destination cell consisting only of 1s.

    • Use Breadth First Search (BFS) algorithm to find the shortest path.

    • Keep track of visited cells to avoid revisiting them.

    • Update the path length as you traverse through the matrix.

    • Return -1 if no valid path exists.

  • Answered by AI
Round 2 - Coding Test 

(1 Question)

Round duration - 50 mins
Round difficulty - Easy

I was asked to design url shortner

  • Q1. Can you explain how you would design a URL shortener?
  • Ans. 

    Design a URL shortener system

    • Generate a unique short code for each URL

    • Store the mapping of short code to original URL in a database

    • Redirect users from short URL to original URL when accessed

    • Consider implementing features like custom short codes, expiration dates, and analytics

    • Ensure scalability and performance by using distributed systems and caching

  • Answered by AI
Round 3 - Video Call 

(1 Question)

Round duration - 50 mins
Round difficulty - Medium

This was hiring manager round

  • Q1. Can you discuss a coding problem you encountered, your past projects, and any behavioral questions related to your experiences?
  • Ans. 

    Discussed coding problem, past projects, and behavioral questions in SDE - 1 interview.

    • Coding problem: Discussed how I optimized a sorting algorithm in a previous project.

    • Past projects: Talked about a web application I developed using React and Node.js.

    • Behavioral questions: Shared how I handled a conflict within a team during a project.

    • Example: Explained how I implemented a feature in a mobile app that improved user en

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in BangaloreEligibility criteriaNAJupiter Money interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, Operating System, DBMS, OOPSTime required to prepare for the interview - 2 monthsInterview preparation tips for other job seekers

Tip 1 : Prepare DS and algo well(i prepared from GFG)
Tip 2 : Must know basics of DBMS and OS
Tip 3 : Be confident and genuine

Application resume tips for other job seekers

Tip 1 : Prepare resume iteratively
Tip 2 : show ur resume to seniors and ask for suggestions

Final outcome of the interviewSelected

Skills evaluated in this interview

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

I applied via Company Website and was interviewed in Aug 2023. There were 4 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Don’t add your photo or details such as gender, age, and address in your resume. These details do not add any value.
View all tips
Round 2 - Technical 

(1 Question)

  • Q1. 1 - Easy Medium Question. Discuss the approach with interviewer and then implement it. The code should work, thats important.
Round 3 - Technical 

(1 Question)

  • Q1. LLD round to design Chess.
Round 4 - One-on-one 

(1 Question)

  • Q1. Hiring manager round. Grilling on resume and past experience questions
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

Easy Medium questions

Round 2 - Design Test 

(1 Question)

  • Q1. Asked to design Basic Facebook.

I appeared for an interview in Mar 2021.

Round 1 - Video Call 

(3 Questions)

Round duration - 90 minutes
Round difficulty - Medium

Started with projects discussion and internships and moved forward with coding problems.
It started at around 6:00 PM and lasted for 90 minutes approximately
The interviewer was very cool, he even gave me some tips on improving myself further at the end of the interview.

  • Q1. 

    Longest Substring with At Most K Distinct Characters

    Given a string S of length N and an integer K, find the length of the longest substring that contains at most K distinct characters.

    Input:

    The first...
  • Ans. 

    Find the length of the longest substring with at most K distinct characters in a given string.

    • Use a sliding window approach to keep track of the characters and their counts within the window.

    • Maintain a hashmap to store the characters and their frequencies.

    • Update the window size and characters count as you iterate through the string.

    • Return the maximum window size encountered for each test case.

  • Answered by AI
  • Q2. 

    Maximum Frequency Number Problem Statement

    Given an array of integers with numbers in random order, write a program to find and return the number which appears the most frequently in the array.

    If multip...

  • Ans. 

    Find the number with the maximum frequency in an array of integers.

    • Iterate through the array and keep track of the frequency of each number using a hashmap.

    • Find the number with the maximum frequency and return it.

    • If multiple elements have the same maximum frequency, return the one that appears first.

  • Answered by AI
  • Q3. 

    Ninja and Bombs Problem Statement

    Ninja wants to travel from his house to his best friend's house. The locations of the houses are on a 2D coordinate plane, where Ninja's house is located at the origin (0...

  • Ans. 

    Determine if Ninja can reach his friend's house with even x-coordinate without using modulus operator.

    • Check if the x-coordinate is even or odd by using bitwise AND operation with 1.

    • Return 1 if x-coordinate is even, else return 0.

    • Handle multiple test cases by iterating through each input.

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

I was asked a coding question then, a system design question and some basic operating systems and oops questions

  • Q1. 

    Find Duplicates in an Array

    Given an array ARR of size 'N', where each integer is in the range from 0 to N - 1, identify all elements that appear more than once.

    Return the duplicate elements in any orde...

  • Ans. 

    Find duplicates in an array of integers within a specified range.

    • Iterate through the array and keep track of the count of each element using a hashmap.

    • Return elements with count greater than 1 as duplicates.

    • Time complexity can be optimized to O(N) using a set to store seen elements.

  • Answered by AI
  • Q2. Can you design a Google Search Engine?
  • Ans. 

    Designing a Google Search Engine involves creating a web crawler, indexing system, and ranking algorithm.

    • Develop a web crawler to discover and retrieve web pages.

    • Implement an indexing system to store and organize the content of web pages.

    • Design a ranking algorithm to determine the relevance of search results.

    • Include features like autocomplete, spell check, and personalized search results.

    • Optimize for speed and scalabil...

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaNo CriteriaMobiKwik interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, OOPS, System Design, Operating SystemsTime required to prepare for the interview - 1 monthInterview preparation tips for other job seekers

Tip 1 : Practice data structures problems
Tip 2 : Read about System Designs
Tip 3 : Study the popular algorithms

Application resume tips for other job seekers

Tip 1 : Mention your projects
Tip 2 : Mention your internships

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview in Mar 2022.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 minutes
Round difficulty - Medium

Only Java allowed

  • Q1. 

    Sort 0 and 1 Problem Statement

    Given an integer array ARR of size N containing only integers 0 and 1, implement a function to sort this array. The solution should scan the array only once without using an...

  • Ans. 

    Sort an array of 0s and 1s in linear time without using additional arrays.

    • Iterate through the array and maintain two pointers, one for 0s and one for 1s.

    • Swap elements at the two pointers based on the current element being 0 or 1.

    • Continue this process until the entire array is sorted in place.

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Basic intro and coding questions

  • Q1. 

    Valid Perfect Square Check

    An integer N is provided, and the task is to determine if N is a perfect square. A perfect square refers to an integer which can be expressed as the square of another integer.

    ...

  • Ans. 

    Implement a function to check if a given integer is a perfect square.

    • Create a function that takes an integer as input and returns true if it is a perfect square, false otherwise.

    • Iterate through possible square roots of the input integer and check if the square of the root equals the input.

    • Return true if a perfect square is found, false otherwise.

  • Answered by AI
  • Q2. 

    Merge Sort Problem Statement

    Given a sequence of numbers 'ARR', your task is to return a sorted sequence of 'ARR' in non-descending order using the Merge Sort algorithm.

    Example:

    Input:
    ARR = [5, 3, 8,...
  • Ans. 

    Implement Merge Sort algorithm to sort a given sequence of numbers in non-descending order.

    • Merge Sort is a divide-and-conquer algorithm that splits the array into two halves, recursively sorts each half, and then merges the sorted halves back together.

    • Time complexity of Merge Sort is O(n log n) in the worst case scenario.

    • It is a stable sorting algorithm, meaning that the relative order of equal elements is preserved.

    • Ex...

  • Answered by AI
Round 3 - Video Call 

(1 Question)

Round duration - 60 minutes
Round difficulty - Medium

More difficult than the previous round

  • Q1. 

    Bottom View of Binary Tree Problem Statement

    Given a binary tree, the task is to print its bottom view from left to right. Assume the left and the right child nodes make a 45-degree angle with their paren...

  • Ans. 

    The task is to print the bottom view of a binary tree from left to right.

    • Traverse the binary tree in level order and keep track of the horizontal distance of each node from the root.

    • Store the nodes at each horizontal distance in a map, updating it as you traverse the tree.

    • After traversal, extract the bottom-most nodes at each horizontal distance to get the bottom view sequence.

  • Answered by AI
Round 4 - Face to Face 

(2 Questions)

Round duration - 70 minutes
Round difficulty - Medium

There were no DSA questions. My interviews were based on android app development. The interviewer presented scenarios and asked how will you solve them. No particular correct answer was expected just the best approach as per me.

  • Q1. How would you implement multiple RecyclerViews on a magnified screen in an Android application?
  • Ans. 

    Implement multiple RecyclerViews on a magnified screen in an Android app by adjusting item sizes and spacing.

    • Adjust item sizes and spacing based on screen magnification level

    • Use nested RecyclerViews or custom layouts to display multiple lists

    • Implement custom item decorators to manage spacing between RecyclerViews

    • Consider using a GridLayoutManager with custom span sizes for each RecyclerView

  • Answered by AI
  • Q2. How would you implement various activities related to cart functionality in an e-commerce application?
  • Ans. 

    Implementing cart functionality in an e-commerce application involves managing user interactions, updating quantities, handling discounts, and processing orders.

    • Create a data structure to store cart items, quantities, and prices.

    • Implement add to cart, remove from cart, and update quantity functionalities.

    • Handle discounts, promotions, and coupon codes.

    • Calculate total price, including taxes and shipping costs.

    • Implement c...

  • Answered by AI
Round 5 - HR 

Round duration - 30 minutes
Round difficulty - Easy

HR asked questions about why Mobikwik, what's your goal, how are you a good fit, etc.

Interview Preparation Tips

Eligibility criteriaCGPA - 7 & above, Active backlogs - NoneMobiKwik interview preparation:Topics to prepare for the interview - Basic DSA, Arrays, String, Trees, Problem SolvingTime required to prepare for the interview - 1 monthInterview preparation tips for other job seekers

Tip 1 : Prepare advanced array questions
Tip 2 : Trees basic to medium questions
Tip 3 : Optimize solutions

Application resume tips for other job seekers

Tip 1 : Internship experience
Tip 2 : Personal Projects (remember proper details)

Final outcome of the interviewSelected

Skills evaluated in this interview

Freecharge Interview FAQs

How many rounds are there in Freecharge Reactjs Developer interview?
Freecharge interview process usually has 1 rounds. The most common rounds in the Freecharge interview process are Technical.
What are the top questions asked in Freecharge Reactjs Developer interview?

Some of the top questions asked at the Freecharge Reactjs Developer interview -

  1. Explain High Order Components using the exam...read more
  2. Explain the reducer method in js using the exam...read more
  3. Explain New Features in Reac...read more

Tell us how to improve this page.

Freecharge Reactjs Developer Interview Process

based on 1 interview

Interview experience

4
  
Good
View more

Interview Questions from Similar Companies

Paytm Interview Questions
3.3
 • 753 Interviews
PhonePe Interview Questions
4.0
 • 303 Interviews
HighRadius Interview Questions
2.9
 • 184 Interviews
Razorpay Interview Questions
3.6
 • 148 Interviews
Rupeek Interview Questions
3.7
 • 61 Interviews
PayU Payments Interview Questions
3.5
 • 54 Interviews
BankBazaar Interview Questions
3.4
 • 50 Interviews
ACKO Interview Questions
3.7
 • 49 Interviews
View all
Software Development Engineer
124 salaries
unlock blur

₹6 L/yr - ₹18.2 L/yr

Lead Software Engineer
77 salaries
unlock blur

₹14.8 L/yr - ₹34 L/yr

Software Developer
62 salaries
unlock blur

₹6.2 L/yr - ₹15.3 L/yr

Senior Software Engineer
55 salaries
unlock blur

₹11.5 L/yr - ₹26 L/yr

Associate Product Manager
52 salaries
unlock blur

₹9 L/yr - ₹22 L/yr

Explore more salaries
Compare Freecharge with

Paytm

3.3
Compare

Mobikwik

3.6
Compare

HighRadius

2.9
Compare

AGS Transact Technologies

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