i
Eduvanz
Filter interviews by
I applied via Referral and was interviewed in Jul 2023. There were 3 interview rounds.
posted on 4 Nov 2024
I applied via LinkedIn and was interviewed in Oct 2024. There were 3 interview rounds.
Questions were based on basic aptitude like seating arrangement
posted on 17 Apr 2024
I applied via Referral and was interviewed before Apr 2023. There were 2 interview rounds.
They have problem of K sorted array and you need to make an sorted array of it.
I applied via Campus Placement and was interviewed in May 2024. There were 2 interview rounds.
We in group of 10 were given a topic on which 2 feature to select out of 4 for a project, it lasted about 10 minutes, was ok
Given a case study of a company, analyze it in 10 minutes and then questions were asked, i don't think it was useful for a Developer Role
Maths and communication based questions
Estimate and SQL and coding was there
posted on 28 May 2022
OOPs concepts include encapsulation, inheritance, polymorphism, and abstraction. Microservices are small, independent services that communicate with each other.
OOPs concepts help in creating modular and reusable code.
Encapsulation ensures that data is hidden and can only be accessed through defined methods.
Inheritance allows a class to inherit properties and methods from a parent class.
Polymorphism allows objects to ta...
posted on 17 Apr 2024
I applied via Campus Placement and was interviewed before Apr 2023. There were 4 interview rounds.
25 question were asked
Java coding and Java oops concepts
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 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
based on 1 interview
Interview experience
based on 2 reviews
Rating in categories
Relationship Manager
39
salaries
| ₹2.5 L/yr - ₹6 L/yr |
Assistant Manager
38
salaries
| ₹3 L/yr - ₹6.2 L/yr |
Senior Analyst
30
salaries
| ₹3.2 L/yr - ₹7 L/yr |
Analyst
24
salaries
| ₹2 L/yr - ₹7.7 L/yr |
Senior Executive
17
salaries
| ₹3 L/yr - ₹5.3 L/yr |
Kissht Finance
BharatPe
VSoft Technologies
Innoviti Technologies Private Limited