Filter interviews by
Clear (1)
The aptitude round consists of approx 20 q's, out of which half the q's were based on LR and aptitude and half based on computer fundamentals.
The coding test consisted of 4 q's. The selection criteria was to complete at least 3 q's.
I am a passionate software engineer with experience in developing web applications using various technologies.
Experienced in developing web applications using HTML, CSS, JavaScript, and frameworks like React and Angular
Proficient in backend development with Node.js and databases like MongoDB and MySQL
Familiar with version control systems like Git and project management tools like Jira
I applied via Campus Placement
Consisted of basic dsa questions and time complexity questions
4 dsa questions to be solved in one hour
Top trending discussions
I applied via Campus Placement and was interviewed before Nov 2023. There was 1 interview round.
1hr aptitude + coding
posted on 15 Sep 2024
OOPS (Object-Oriented Programming) is a programming paradigm based on the concept of objects, which can contain data and code.
OOPS focuses on creating objects that interact with each other to solve problems.
It involves concepts like classes, objects, inheritance, polymorphism, and encapsulation.
For example, a class 'Car' can have objects like 'Toyota', 'Honda', etc., each with their own properties and methods.
Inheritan...
DS/ALGO and problem-solving was asked in round one
I applied via Company Website and was interviewed before Jan 2021. There were 4 interview rounds.
I applied via Approached by Company and was interviewed in Jun 2024. There was 1 interview round.
I was interviewed in Mar 2021.
Round duration - 90 minutes
Round difficulty - Medium
Started with projects discussion and internships and moved forward with coding problems.
It started at around 6:00 PM and lasted for 90 minutes approximately
The interviewer was very cool, he even gave me some tips on improving myself further at the end of the interview.
Given a string S
of length N
and an integer K
, find the length of the longest substring that contains at most K
distinct characters.
The first...
Find the length of the longest substring with at most K distinct characters in a given string.
Use a sliding window approach to keep track of the characters and their counts within the window.
Maintain a hashmap to store the characters and their frequencies.
Update the window size and characters count as you iterate through the string.
Return the maximum window size encountered for each test case.
Given an array of integers with numbers in random order, write a program to find and return the number which appears the most frequently in the array.
If multip...
Find the number with the maximum frequency in an array of integers.
Iterate through the array and keep track of the frequency of each number using a hashmap.
Find the number with the maximum frequency and return it.
If multiple elements have the same maximum frequency, return the one that appears first.
Ninja wants to travel from his house to his best friend's house. The locations of the houses are on a 2D coordinate plane, where Ninja's house is located at the origin (0...
Determine if Ninja can reach his friend's house with even x-coordinate without using modulus operator.
Check if the x-coordinate is even or odd by using bitwise AND operation with 1.
Return 1 if x-coordinate is even, else return 0.
Handle multiple test cases by iterating through each input.
Round duration - 60 minutes
Round difficulty - Easy
I was asked a coding question then, a system design question and some basic operating systems and oops questions
Given an array ARR
of size 'N', where each integer is in the range from 0 to N - 1, identify all elements that appear more than once.
Return the duplicate elements in any orde...
Find duplicates in an array of integers within a specified range.
Iterate through the array and keep track of the count of each element using a hashmap.
Return elements with count greater than 1 as duplicates.
Time complexity can be optimized to O(N) using a set to store seen elements.
Designing a Google Search Engine involves creating a web crawler, indexing system, and ranking algorithm.
Develop a web crawler to discover and retrieve web pages.
Implement an indexing system to store and organize the content of web pages.
Design a ranking algorithm to determine the relevance of search results.
Include features like autocomplete, spell check, and personalized search results.
Optimize for speed and scalabil...
Tip 1 : Practice data structures problems
Tip 2 : Read about System Designs
Tip 3 : Study the popular algorithms
Tip 1 : Mention your projects
Tip 2 : Mention your internships
based on 2 interviews
Interview experience
based on 2 reviews
Rating in categories
Customer Relationship Manager
49
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Manager
35
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
25
salaries
| ₹0 L/yr - ₹0 L/yr |
Credit Analyst
17
salaries
| ₹0 L/yr - ₹0 L/yr |
Credit Manager
17
salaries
| ₹0 L/yr - ₹0 L/yr |
Paytm
PhonePe
Mobikwik
Freecharge