i
Freecharge
Filter interviews by
I applied via Campus Placement and was interviewed in Jun 2024. There were 2 interview rounds.
The aptitude test was medium level.
Find pairs in array that sum up to a given target value.
Iterate through the array and store each element in a hash set.
For each element, check if the target value minus the current element exists in the hash set.
Return the pair of elements that sum up to the target value.
Check if two strings are anagram of each other
Create character count arrays for both strings
Compare the character count arrays to check if they are equal
Example: 'listen' and 'silent' are anagrams
Top trending discussions
posted on 31 May 2022
I was interviewed in May 2022.
Round duration - 90 minutes
Round difficulty - Medium
Timings: it was late night. I started the test at 10 pm
Check if a given binary tree is a Partial Binary Search Tree (BST). A Partial BST adheres to the following properties:
Round duration - 45 minutes
Round difficulty - Medium
It was the interviw round.
the environment was good.
the interviewer was very nice to me.
You are provided with two sorted linked lists. Your task is to merge them into a single sorted linked list and return the head of the combined linked list.
...Tip 1 : Please have a strong hold on data structures mainly linked lists, arrays, maths, stacks, trees
Tip 2 : Must explore about DBMS. Means SQL, writing efficient queries, about indexing and other SQL backend process.
Tip 3 : Should work on spring boot. try build some project using spring boot with java (Gradle) as Jupiter's backend tech is mainly based on spring boot with java.
Tip 1 : Mention only those skills on which you have worked on properly. no need to flood the resume with skills about which you need a little.
Tip 2 : Must mention the links of projects which you have worked on.
I was interviewed in May 2022.
Round duration - 60 Minutes
Round difficulty - Medium
This round was scheduled with the SDE-2, we started with the introduction than he jumped to the dsa questions. First question he asked me was leetcode 3 sum problem, we discussed the approach than I wrote the code for that problem. Second question was of arrays and maps I didn't remember the exact question but that was also some modified version of k sum subarray. Than he asked many questions related to oops, I answered most of them than he asked me for any qiuestions and we dropped the call.
Given an array or list ARR
consisting of N
integers, your task is to identify all distinct triplets within the array that sum up to a specified number K
.
A t...
You are provided with an array arr
of size N
and an integer K
. Your objective is to compute the maximum sum of a subset of the array such that this sum does not exceed K
.
In this approach, we will iterate over all the possible subsets of the given array, and then we will find the maximum sum subset whose sum is not greater than K.
The total number of subsets of an array is 2^N or 1 << N in the bitshift operator.
Algorithm:
Round duration - 40 Minutes
Round difficulty - Medium
This round was arranged with the Engineering Manager, we started with the introduction then he asked me to explain my project, I did that. After that he asked me one pattern question, I coded that than he asked me one more array question of finding mean, mode, median, I partially solved that question. Than he asked me for any questions and we dropped the call.
Create a grid pattern of size R rows and C columns, where each cell contains a diamond-like shape of size S. The diamond shape is made with characters ‘/’ and ‘\’ for the bord...
Approach: Since each diamond’s size is (2 * s) * (2 * s). So the total size of the grid will be (2 * s * r) * (2 * s * c). So we will iterate in all the points on the grid and use some basic algebra(modular arithmetics) to find the diamond to which this point belongs. Then we can identify the type of location(i.e. either this point is a boundary or not) as we can divide the diamond into four equal parts(top-...
Given an integer array ARR
of size N
, you need to compute the following three statistical measures:
mean()
to calculate the mean o...I really didn't remember the eaxct approach that I used.
Tip 1 : Practice at least 300 Questions from leetcode
Tip 2 : Prepare your project.
Tip 1 : Add at least 4 projects.
Tip 2 : Add your coding profiles and GPA.
posted on 24 Nov 2021
I applied via Internshala and was interviewed in May 2021. There were 4 interview rounds.
I was interviewed in Nov 2020.
Round duration - 60 minutes
Round difficulty - Easy
I had the flexibility to schedule it according to my time zone as the internship was Singapore based so I scheduled it at 9 am in the morning. The environment was similar to pair programming where the interviewer was a software enginner at stripe and asked me to code on any IDE with my screen share enabled. He shared the question on some online coding platform so it depends on you whether you want to use the coding platform or your own IDE. My language was python. The question was to figure out the optimal way to set the servers so that the servers are down for the minimum. One interesting part was to write the unit tests according to check the code on various test cases. I didn't know unit testing in python that time so it left a bad impression definitely. Other than the interviewer was really nice. After the interview ended, he told me about my shortcomings and also told me to learn about unit tests and testing.
Your task is to determine if two given strings are anagrams of each other. Two strings are considered anagrams if you can rearrange the letters of one string to form the...
The task is to determine whether two given strings form an anagram pair or not.
Check if the lengths of the two strings are equal. If not, they cannot be anagrams.
Create a frequency map of characters for both strings.
Compare the frequency maps of both strings. If they are equal, the strings are anagrams.
Return True if the strings are anagrams, False otherwise.
Tip 1 : Have a good LinkedIn profile
Tip 2 : Have good projects on Github
Tip 3 : Practice coding questions
Tip 1 : In projects, mention the tech stack used
Tip 2 : Keep it simple and concise preferably 1 page
I have worked on various projects including developing web applications, creating mobile apps, and implementing machine learning algorithms.
Developed a web application for a retail company to manage inventory and sales data
Created a mobile app for a fitness tracking platform to track user's exercise routines
Implemented machine learning algorithms for a recommendation system in an e-commerce website
Had a overall personality, technical & problem solving test with AVP
posted on 5 Jun 2024
I applied via Referral and was interviewed in Sep 2023. There were 3 interview rounds.
Java 8, Mysql, sprin, c, c++
posted on 15 Oct 2020
I applied via Naukri.com and was interviewed before Oct 2019. There was 1 interview round.
Error codes are unique identifiers assigned to specific errors in software programs.
Error codes help identify the cause of a problem in software.
They are typically numeric or alphanumeric codes.
Error codes are often displayed to users when an error occurs.
Examples: 404 - Page Not Found, 500 - Internal Server Error
Interview experience
based on 2 reviews
Rating in categories
Software Development Engineer
126
salaries
| ₹4.7 L/yr - ₹17.1 L/yr |
Lead Software Engineer
74
salaries
| ₹14.8 L/yr - ₹35 L/yr |
Software Developer
55
salaries
| ₹6.2 L/yr - ₹14.2 L/yr |
Senior Software Engineer
54
salaries
| ₹11.5 L/yr - ₹27.5 L/yr |
Associate Product Manager
53
salaries
| ₹9 L/yr - ₹22 L/yr |
Paytm
Mobikwik
PhonePe
Google Pay