i
Freecharge
Filter interviews by
I applied via Campus Placement and was interviewed in Sep 2022. There were 3 interview rounds.
The first round consists of Aptitude with some DBMS and cloud questions also there are 2 coding questions also there.
Finding the stock price with maximum profit.
Calculate the difference between each day's stock price and the minimum stock price seen so far.
Find the maximum difference calculated in the previous step.
The maximum difference is the maximum profit that can be made.
Add the maximum difference to the minimum stock price to get the stock price with maximum profit.
To count the number of zeroes at the end of an array.
Loop through the array from the end and count the number of zeroes until a non-zero element is encountered.
Use a while loop to keep dividing the last element by 10 until it is not divisible by 10 to count the number of zeroes.
If the array is sorted in non-increasing order, use binary search to find the last non-zero element and subtract its index from the length of t
I applied via Campus Placement and was interviewed in Sep 2022. There were 5 interview rounds.
My first round consists of Aptitude with some technical question and 2 coding questions(one of Dynamic programming).
What people are saying about Freecharge
I applied via Campus Placement and was interviewed in Jul 2021. There were 3 interview rounds.
The interviewee was asked about linked lists, finding the median of two sorted arrays, and printing the left view of a tree.
For linked lists, the interviewee should be familiar with the basic operations such as insertion, deletion, and traversal.
To find the median of two sorted arrays, the interviewee should know how to merge the arrays and find the middle element(s).
Printing the left view of a tree involves traversing...
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.
Auto complete Input Search box with Dropdown
I appeared for an interview before Feb 2024.
I applied via LinkedIn and was interviewed before Jun 2022. There were 4 interview rounds.
based on 1 interview
1 Interview rounds
based on 3 reviews
Rating in categories
Software Development Engineer
127
salaries
| ₹4.7 L/yr - ₹18.2 L/yr |
Lead Software Engineer
76
salaries
| ₹14.8 L/yr - ₹35 L/yr |
Senior Software Engineer
66
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