Filter interviews by
I appeared for an interview in Dec 2021.
Round duration - 90 Minutes
Round difficulty - Medium
Online questions of coding, logical and tools knowledge
Was time based, and lengthy
Given an array or list of integers 'ARR', identify the second largest element in 'ARR'.
If a second largest element does not exist, return -1.
ARR = [2,...
Find the second largest element in an array of integers.
Iterate through the array to find the largest and second largest elements.
Handle cases where all elements are identical.
Return -1 if a second largest element does not exist.
Round duration - 90 Minutes
Round difficulty - Easy
Was pure technical
Framework designs are the structure and organization of a software framework, including its components and interactions.
Framework designs define the overall architecture of a software system
They include the arrangement of components, their relationships, and the flow of data
Examples of framework designs include Model-View-Controller (MVC) and Service-Oriented Architecture (SOA)
Round duration - 60 Minutes
Round difficulty - Hard
Technical
Given an array of integers ARR
of size N
and an integer target
, find three integers in ARR
such that their sum is closest to the target
. If there are two closest sums, return...
Find three integers in an array whose sum is closest to a target integer.
Iterate through all possible triplets in the array to find the closest sum to the target.
Keep track of the closest sum found so far and update it if a closer sum is found.
Return the closest sum found after iterating through all triplets.
Round duration - 60 Minutes
Round difficulty - Hard
HR stuff
Tip 1 : Prepare for coding logics
Tip 2 : Prepare for Algos
Tip 1 : Mention all skills in bold
Tip 2 : Mention all languages and tools keywords
Top trending discussions
I appeared for an interview before Mar 2016.
Behavioural and culture fit
Simple algorithm question about sorting
The time complexity of the quicksort algorithm is O(n log n).
Quicksort has an average time complexity of O(n log n).
The best case time complexity of quicksort is O(n log n) when the pivot element divides the array into two equal halves.
The worst case time complexity of quicksort is O(n^2) when the pivot element is the smallest or largest element in the array.
posted on 16 Sep 2022
I applied via Campus Placement and was interviewed before Sep 2021. There were 2 interview rounds.
It had more than 30 aptitude questions and 2 coding questions
Joins, Jobs, stored procedures,cursors.
posted on 13 Aug 2023
I applied via Campus Placement and was interviewed before Aug 2022. There were 3 interview rounds.
It was quantitative aptitude test with some coding questions
Curd operation with SQL connectivity
Island Perimeter and Number of Provinces. Basic Leetcode question
I applied via Recruitment Consulltant and was interviewed in Nov 2021. There were 3 interview rounds.
Basic data structure related coding questions like creating a linked list and adding items to it median.
Max heap implementation.
Concurrency related questions.
Senior Analyst
2.7k
salaries
| ₹3.5 L/yr - ₹13.5 L/yr |
Software Engineer
990
salaries
| ₹8 L/yr - ₹29.6 L/yr |
Operations Analyst
780
salaries
| ₹2 L/yr - ₹6 L/yr |
Associate Vice President
727
salaries
| ₹13 L/yr - ₹44 L/yr |
Analyst
632
salaries
| ₹1.4 L/yr - ₹7.1 L/yr |
HDFC Bank
ICICI Bank
Axis Bank
Kotak Mahindra Bank