Filter interviews by
I was interviewed in Nov 2020.
Round duration - 90 Minutes
Round difficulty - Hard
The Test Was Conducted On HackerEarth. It Had 2 Sections. Section-A Had 30 Multiple Choice Questions & Section-B Had 2 Programming Questions.
The MCQs Were On Java, Python, MongoDB, MySQL, JSON, Cloud Computing, JavaScript & C++ With the Majority Of Them On Java.
Half Of The Questions Were Theory-Based And The Other Half Were Output Based On JAVA & C++. I Would Highly Recommend Having An Excellent Knowledge Of Both JAVA & C++ To Ace Up The Online Round.
The 2 Programming Questions In Section-B Were Of 20 & 50 Marks Respectively. The 1st Question Was Easy And I Was Able To Solve It Easily. It Was Based On Number Theory. The 2nd Question Was Really Hard And Was A String Pattern Matching Question Quite Similar To The Z-Algorithm. Solving The 2nd Question Is Like A Bonus Because This Question Carries The Highest Marks. I Was Able To Solve Both The Questions.
You are provided with a string S
of length N
and a string P
of length M
. Your objective is to determine the number of times P
appears in S
in linear time.
...
A basic approach is to check all substrings of string ‘S’ and see if that substring is equal to ‘P’ or not. Let’s see how we’ll do this.
Round duration - 30 Minutes
Round difficulty - Medium
The Interview Round Was Conducted On 18th November 2020. It Was Both A Managerial Round & HR Round And Was Conducted On Webex. Every Candidate Was Assigned A Time Slot And An Interviewer. My Interviewer Was Very Friendly.
Tip 1 : Have A Strong Knowledge Of JAVA Since It’s A Bank And They Prefer JAVA Candidates.
Tip 2 : Have Good Projects On Any One Of Major Technologies Like AI, Block-Chain Since The Students Who Were Finally Selected Had Really Good Projects On These Technologies.
Tip 3 : Have A Strong Knowledge Of OOPS And Databases(Both SQL & NoSQL).
Tip 4 : Having Basic Knowledge Of JavaScript Is Also Recommended.
Tip 1 : Be Thorough With Your Resume & Only Mention Those Points & Projects In Your Resume With Which You Are Most Confident To Be Questioned On.
Tip 2 : Have Good Projects On Any One Of Major Technologies Like AI, Block-Chain Since The Students Who Were Finally Selected Had Really Good Projects On These Technologies.
I applied via campus placement at National Institute of Technology (NIT), Raipur and was interviewed in Dec 2023. There were 4 interview rounds.
3 questions - DFS, Greedy and Priority Queue
Max heap is a data structure where the parent node is always greater than or equal to its child nodes.
Start by creating an array to store the elements of the max heap.
Insert elements into the array and maintain the heap property by swapping elements if necessary.
Implement functions like insert, extractMax, and heapify to maintain the max heap structure.
Example: If we have elements 10, 7, 15, 3, 8, the max heap would be
Find the second largest number in an array of strings.
Convert the array of strings to an array of integers.
Sort the array in descending order.
Return the second element in the sorted array.
posted on 22 Oct 2023
I applied via Naukri.com and was interviewed before Oct 2022. There were 4 interview rounds.
posted on 31 Aug 2022
I applied via Campus Placement and was interviewed before Aug 2021. There were 2 interview rounds.
Assistant Vice President
2.3k
salaries
| ₹17 L/yr - ₹45 L/yr |
Senior Analyst
1.1k
salaries
| ₹3 L/yr - ₹11.2 L/yr |
Assistant Manager
983
salaries
| ₹6.7 L/yr - ₹25 L/yr |
Process Advisor
930
salaries
| ₹1 L/yr - ₹8.3 L/yr |
Analyst
825
salaries
| ₹11.4 L/yr - ₹22 L/yr |
Deutsche Bank
Accenture
Amazon
Deloitte