i
Freecharge
Filter interviews by
I applied via Job Portal and was interviewed in Dec 2024. There was 1 interview round.
Search for target element in a rotated sorted array.
Use binary search to find the pivot point where rotation happens.
Divide the array into two subarrays and perform binary search on the appropriate subarray.
Handle cases where the target element is on the left or right side of the pivot.
What people are saying about Freecharge
I applied via LinkedIn and was interviewed in Feb 2024. There was 1 interview round.
Sort array of cards in red, blue, green colors.
Use a custom sorting function to sort the array based on color order.
Assign a numerical value to each color (e.g. red: 0, blue: 1, green: 2) and sort based on these values.
Implement a sorting algorithm like bubble sort or quicksort to rearrange the array based on color order.
Freecharge interview questions for designations
I appeared for an interview before Sep 2020.
Round duration - 90 minutes
Round difficulty - Easy
Nice environment
Given a binary tree with integer values in its nodes, your task is to print the zigzag traversal of the tree.
In zigzag order, level 1 is printed from left to right...
Implement a function to print the zigzag traversal of a binary tree.
Traverse the tree level by level, alternating the direction of traversal for each level.
Use a queue to keep track of nodes at each level.
Print the nodes in zigzag order as per the given pattern.
Round duration - 90 minutes
Round difficulty - Medium
Nice Environment
Given a positive integer N
, your task is to identify all prime numbers less than or equal to N
.
A prime number is a natural number greater than 1 that has no po...
Identify all prime numbers less than or equal to a given positive integer N.
Iterate from 2 to N and check if each number is prime
Use the Sieve of Eratosthenes algorithm for better efficiency
Optimize by only checking up to the square root of N for divisors
DBMS was used to store and manage data in the project, handled problems by optimizing queries and database design.
Used DBMS to store and manage project data efficiently
Optimized queries for better performance
Designed database schema to handle data effectively
Resolved concurrency issues by implementing proper locking mechanisms
Tip 1 : Do atleast 1 good projects
Tip 2 : Practice Atleast 300 Questions
Tip 3 : Should be able to explain your project
Tip 1 : Always be true with the resume
Tip 2 : Do not put false things on resume.
I applied via Referral and was interviewed in Sep 2023. There was 1 interview round.
Asked to write an in memory SQL database. Time was 1.5 hours. I made the mistake of choosing C++ and writing the code to make it very flexible and extensible. This led to me not being able to complete the task in the given time.
Tip: practice LLD round in a high level language like Python or Typescript. Speed is very important.
Blood relation, coding and decoding, number system , percentage
I appeared for an interview in Apr 2021.
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.
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 using a set to ensure distinct elements in the array.
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...
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
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...
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.
Tip 1 : Have some projects.
Tip 2 : Do a course from Coding Ninjas.
Tip 1 : Keep it short.
Tip 2 : Do not put false things.
based on 5 interviews
Interview experience
based on 13 reviews
Rating in categories
Software Development Engineer
127
salaries
| ₹4.7 L/yr - ₹18.2 L/yr |
Lead Software Engineer
75
salaries
| ₹14.8 L/yr - ₹35 L/yr |
Senior Software Engineer
65
salaries
| ₹11.5 L/yr - ₹26 L/yr |
Software Developer
63
salaries
| ₹6.2 L/yr - ₹15.2 L/yr |
Associate Product Manager
56
salaries
| ₹10 L/yr - ₹22.6 L/yr |
Paytm
Mobikwik
HighRadius
AGS Transact Technologies