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).
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
Top trending discussions
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 appeared for an interview in May 2022.
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
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...
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.
Round duration - 50 mins
Round difficulty - Easy
I was asked to design url shortner
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
Round duration - 50 mins
Round difficulty - Medium
This was hiring manager round
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
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
Tip 1 : Prepare resume iteratively
Tip 2 : show ur resume to seniors and ask for suggestions
I appeared for an interview in Apr 2021.
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.
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.
Use a set to store distinct elements for efficient processing.
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...
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
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.
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
Tip 1 : Have some projects.
Tip 2 : Do a course from Coding Ninjas.
Tip 1 : Keep it short
Tip 2 : Add skills iff you are sure
I appeared for an interview in Apr 2021.
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.
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 there are less than 3 elements in the array.
Consider edge cases like negative integers and duplicates.
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 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
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.
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
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.
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.
I applied via Company Website and was interviewed in Aug 2023. There were 4 interview rounds.
based on 1 interview
1 Interview rounds
based on 3 reviews
Rating in categories
Software Development Engineer
126
salaries
| ₹6 L/yr - ₹17.5 L/yr |
Lead Software Engineer
74
salaries
| ₹14.8 L/yr - ₹35 L/yr |
Software Developer
62
salaries
| ₹6.2 L/yr - ₹15.3 L/yr |
Senior Software Engineer
56
salaries
| ₹11.5 L/yr - ₹26 L/yr |
Associate Product Manager
55
salaries
| ₹10 L/yr - ₹22.2 L/yr |
Paytm
Mobikwik
HighRadius
AGS Transact Technologies