Freecharge SDE (Software Development Engineer) Interview Questions and Answers

Q1. FindPath leetcode question
Add your answer

Q1. It was an MCQ Round and the questions were a mixture of CS fundamentals topics.
Add your answer

This round contained 2 coding questions.

Q1. This was a one on one coding round where I was asked 3 questions that were of Easy to Medium level of LeetCode.
Add your answer

Q1. HR round was more of a technical interview round where I was asked about my android projects and some core android topics since both me and my interviewer were Android Developers.
Add your answer

15 MCQs and 2 coding questions were given. MCQs include questions from topics like dbms, system design, oops etc.
1st coding question was of dp and 2nd was of a good question of graph.

Q1. Create a linked list from scratch and then delete a given node. Then print the linked list.
Ans. 
Create and delete a node in a linked list and print the updated list.
• Create a Node class with data and next pointer attributes

• Create a LinkedList class with head attribute and methods to add, delete and print nodes

• To delete a node, traverse the list and update the next pointer of the previous node to skip the node to be deleted

• Print the list by traversing and printing the data of each node
Answered by AI
Add your answer
Q2. Reverse first K(given) characters of string.
Ans. 
Reverse the first K characters of a given string.
• Take the first K characters of the string.

• Reverse the selected substring.

• Concatenate the reversed substring with the rest of the original string.
Answered by AI
Add your answer

Round duration - 90 mins
Round difficulty - Hard

There were questions related to DP and DFS.

 

Q1. 
Trapping Rain Water Problem Statement
You are given a long type array/list ARR of size N, representing an elevation map. The value ARR[i] denotes the elevation of the ith bar. Your task is to determine th...read more
Ans. 
Calculate the total amount of rainwater that can be trapped between given elevations in an array.
• Iterate through the array and calculate the maximum height on the left and right of each bar.

• Calculate the amount of water that can be trapped at each bar by taking the minimum of the maximum heights on the left and right.

• Sum up the trapped water at each bar to get the total trapped water for the entire array.
Answered by AI
Add your answer

Round duration - 60 mins
Round difficulty - Medium

At first, I was asked about the different projects that I have done so far. We had a detailed discussion on the same.
He also checked my OOP concepts

Q1. Can you describe the process of designing an LRU Cache from scratch during your System Design Round?
Ans. 
Designing an LRU Cache involves implementing a data structure that stores a fixed number of items and removes the least recently used item when full.
• Start by defining the data structure for the cache, typically using a combination of a hashmap and a doubly linked list.

• Implement methods for getting and setting key-value pairs in the cache.

• When a new item is added to the cache, check if it exceeds the maximum capacity. I...read more
Answered by AI
Add your answer
Q2. 
Reverse Linked List Problem Statement
Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.
Input:
The first line of input is an intege...read more
Ans. 
Reverse a singly linked list by altering the links between nodes.
• Iterate through the linked list and reverse the links between nodes

• Use three pointers to keep track of the current, previous, and next nodes

• Update the links between nodes to reverse the list

• Return the head of the reversed linked list
Answered by AI
Add your answer
Q3. 
Middle of a Linked List
You are given the head node of a singly linked list. Your task is to return a pointer pointing to the middle of the linked list.
If there is an odd number of elements, return the ...read more
Ans. 
Return the middle element of a singly linked list, or the one farther from the head if there are even elements.
• Traverse the linked list with two pointers, one moving twice as fast as the other

• When the fast pointer reaches the end, the slow pointer will be at the middle

• If there are even elements, return the one that is farther from the head node

• Handle edge cases like linked list of size 1 or empty list
Answered by AI
Add your answer

Round duration - 60 mins
Round difficulty - Medium

It is HR + Technical round
asked about the Behavioural questions and how you justify yourself in an argument .questions related to current technology.
They gave me feedback on how well I had performed so far and gave me suggestions on what more can I do to further improve myself.

Moderate coding which will be easy if you are a computer science student

Q1. Tell me about yourself
Add your answer
Q2. What is your favourite subject
Add your answer