Freecharge interview experience Real time questions & tips from candidates to crack your interview

SDE - 1

Freecharge
upvote
share-icon
2 rounds | 5 Coding problems

Interview preparation journey

expand-icon
Journey
I recently joined Freecharge through an on-campus placement. I started by preparing for DSA, focusing mainly on medium to hard problems. Alongside, I concentrated on key subjects like DBMS and OOPs. I also practiced aptitude regularly. Consistent practice and focused preparation helped me successfully crack the interview.
Application story
I found the job opportunity through my college’s placement cell during an on-campus drive. After submitting my application, I received a call for the initial screening round. The process was well-organized, with clear communication from the recruiters. The interviews were scheduled promptly, allowing me to prepare effectively with sufficient notice. Overall, the application journey was smooth and motivating.
Why selected/rejected for the role?
I cleared all the interview rounds by showcasing strong problem-solving skills and core knowledge. I joined as an intern, performed consistently, and was later converted into a full-time employee.
Preparation
Duration: 5 months
Topics: Data Structures, Algorithms, DBMS, OOPs, Aptitude
Tip
Tip

Tip 1: Practice coding problems regularly, starting from easy to hard levels.

Tip 2: Focus on thoroughly understanding core concepts in DBMS and OOPs.

Tip 3: Take timed mock tests to improve speed and accuracy in aptitude.

Application process
Where: Campus
Eligibility: No criteria, (Salary Package - 9 LPA)
Resume Tip
Resume tip

Tip 1: Use a two-column resume.

Tip 2: Don’t mention everything, and avoid including anything you don’t know.

Interview rounds

01
Round
Easy
Online Coding Test
Duration60 Minutes
Interview date19 Dec 2024
Coding problem2

Two coding questions were asked.

1. Batch Quality Control

Easy
0/40
Asked in company
Freecharge

You are working at a factory that produces electronic components. Each component is assigned a unique serial number. As part of a new quality control initiative, a component is flagged for inspection if its serial number is evenly divisible by a specific integer K.


You are given a batch of N components, represented by an array A of their serial numbers, and a single integer K. Your task is to count how many components in this batch need to be flagged for inspection.


Problem approach
  • Read the number of elements in the array.
  • Read all the elements of the array.
  • Read the value of K.
  • Initialize a counter to zero.
  • Iterate through each element in the array one by one.
  • For each element, check if it is divisible by K.
  • If it is divisible, increment the counter by one.
  • After checking all elements, output the final value of the counter.
Try solving now

2. Maximum Subarray Sum

Moderate
35m average time
81% success
0/80
Asked in companies
HCL TechnologiesInformaticaSamsung

You are given an array 'arr' of length 'n', consisting of integers.


A subarray is a contiguous segment of an array. In other words, a subarray can be formed by removing 0 or more integers from the beginning and 0 or more integers from the end of an array.


Find the sum of the subarray (including empty subarray) having maximum sum among all subarrays.


The sum of an empty subarray is 0.


Example :
Input: 'arr' = [1, 2, 7, -4, 3, 2, -10, 9, 1]

Output: 11

Explanation: The subarray yielding the maximum sum is [1, 2, 7, -4, 3, 2].
Problem approach

Use Kadane’s Algorithm.

Try solving now
02
Round
Medium
Face to Face
Duration45 minutes
Interview date26 Dec 2024
Coding problem3

The round had three parts: a graph-based DSA question, a DBMS query, and an in-depth OOPs question. It was technical and focused on core concepts.

1. Course Schedule II

Hard
50m average time
50% success
0/120
Asked in companies
AppleUberPhonePe

You have been given ‘N’ courses and some courses may have prerequisites. Now consider a matrix ‘PREREQUISITES’ of size 'M' x 2 which represents that you must complete the course 'PREREQUISITES[i][1]' before the course 'PREREQUISITES[i][0]'.


Your task is to return the order of courses you should take to finish all courses.


Note:
If it is impossible to finish all courses, return an empty array. If there are multiple answers, return any one.


For example:
Input:
3 2
1 2
2 3

There are three courses to take. To start with, First course 3 is taken. Then course 2 is taken for which course 3 must be completed. 

At last course 1 is taken for which course 2 must be completed. So the correct course order is [3,2,1].    
Problem approach

Coding Problem — Graph (Topological Sort).

Try solving now

2. DBMS +OOPS

3. Puzzle

Given 3 bulbs, and their switches are placed in another room.
One of the bulbs is not working.
How will you identify which bulb is connected to which switch, considering both the switches and the bulbs are in different rooms?

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

What is recursion?

Choose another skill to practice
Similar interview experiences
company logo
SDE - 1
3 rounds | 3 problems
Interviewed by Freecharge
2905 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 2 problems
Interviewed by Freecharge
1610 views
0 comments
0 upvotes
company logo
SDE - Intern
3 rounds | 5 problems
Interviewed by Freecharge
1041 views
0 comments
0 upvotes
company logo
SDE - Intern
2 rounds | 4 problems
Interviewed by Freecharge
674 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
114579 views
24 comments
0 upvotes
company logo
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
57824 views
5 comments
0 upvotes
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
34961 views
7 comments
0 upvotes