Filter interviews by
Be the first one to contribute and help others!
I applied via Referral and was interviewed in Jul 2022. There were 2 interview rounds.
I applied via Approached by Company and was interviewed before Sep 2021. There were 2 interview rounds.
I applied via Walk-in and was interviewed in Sep 2022. There were 2 interview rounds.
I appeared for an interview before Feb 2024.
I am drawn to your company's commitment to innovation and growth, and I believe my skills align well with the opportunities here.
I am impressed by the company's track record of success and growth
I see great potential for career advancement and development within the organization
I believe my experience and skills make me a strong fit for the branch manager role here
I have over 5 years of experience in banking operations, team management, and customer service.
Managed a team of 15 employees in a busy bank branch, ensuring daily operations ran smoothly
Implemented new customer service strategies that resulted in a 20% increase in customer satisfaction
Led training sessions for new employees on banking procedures and compliance regulations
Assignment was given
I applied via Campus Placement and was interviewed in Feb 2021. There was 1 interview round.
Journal entries in trading are used to record financial transactions and events.
Journal entries are used to record transactions such as purchases, sales, and expenses.
They are used to keep track of the financial health of a company.
Examples of journal entries in trading include recording the purchase of inventory, recording the sale of goods, and recording expenses such as rent and utilities.
Journal entries are typical...
I appeared for an interview before Jun 2021.
Round duration - 90 Minutes
Round difficulty - Medium
Round duration - 60 Minutes
Round difficulty - Medium
Your task is to determine if a given binary tree with 'N' nodes is a valid Binary Search Tree (BST). A BST is defined by the following properties:
Validate if a given binary tree is a valid Binary Search Tree (BST) based on its properties.
Check if the left subtree of a node has only nodes with data less than the node's data.
Verify if the right subtree of a node has only nodes with data greater than the node's data.
Ensure that both the left and right subtrees are also binary search trees.
Implement a validation function for a BST.
Output 'true' if the binary tree is
Round duration - 60 Minutes
Round difficulty - Easy
Tip 1 : Pratice regularly atleast 5 problem . Make it habit .Try to cover Leetcode medium questions as many as possible
Tip 2 : Be through with your projects . At some point interviewer will ask you some project related questions
Tip 3 : Be strong in your CS fundamentals.
Tip 1 : Do not put irrelevant information such as DOB
Tip 2 : Put only those skill which you can defend in cross questioning
I applied via LinkedIn and was interviewed before Feb 2021. There were 2 interview rounds.
Program Manager
4
salaries
| ₹6 L/yr - ₹15 L/yr |
Portfolio Manager
4
salaries
| ₹14.2 L/yr - ₹24 L/yr |
Senior Manager
4
salaries
| ₹10 L/yr - ₹16 L/yr |
Legal Manager
4
salaries
| ₹15 L/yr - ₹17 L/yr |
Senior Manager Legal
4
salaries
| ₹15.1 L/yr - ₹18 L/yr |
Nomura Holdings
Blackrock
Muthoot Homefin India
Adarsh Credit Co-Operative Society