Filter interviews by
HashMap is a data structure that stores key-value pairs and uses hashing to efficiently retrieve values.
HashMap internally uses an array of linked lists to store key-value pairs.
When a key-value pair is added, the key is hashed to determine the index in the array where it will be stored.
If multiple keys hash to the same index, a linked list is used to handle collisions.
HashMap uses the hashCode() method of keys to...
A trading process involves buying and selling financial instruments in the market.
Research and analysis of market trends and opportunities
Placing buy or sell orders through a trading platform
Monitoring and managing open positions
Executing trades based on predetermined strategies
Recording and analyzing trade data for performance evaluation
GC stands for Garbage Collection, a process in programming languages where unused memory is automatically reclaimed.
Types of GC include: Mark and Sweep, Reference Counting, Generational, and Incremental.
Mark and Sweep: Identifies and removes unreachable objects.
Reference Counting: Keeps track of the number of references to an object and deletes it when the count reaches zero.
Generational: Divides objects into diff...
JIT compiler stands for Just-In-Time compiler, which compiles code during runtime instead of ahead of time.
JIT compiler improves performance by compiling code on the fly as it is needed
It converts bytecode into native machine code for execution
Examples include Java HotSpot JIT compiler and .NET JIT compiler
Futures are financial contracts that obligate the buyer to purchase an asset or the seller to sell an asset at a predetermined future date and price.
Futures are standardized contracts traded on exchanges, where the buyer agrees to purchase an asset at a future date for a price agreed upon today.
They are commonly used in commodities, currencies, and financial instruments trading.
Futures allow investors to hedge aga...
JIT compiler stands for Just-In-Time compiler, which compiles code during runtime instead of ahead of time.
JIT compiler improves performance by compiling code on the fly as it is needed
It converts bytecode into native machine code for execution
Examples include Java HotSpot JIT compiler and .NET JIT compiler
A trading process involves buying and selling financial instruments in the market.
Research and analysis of market trends and opportunities
Placing buy or sell orders through a trading platform
Monitoring and managing open positions
Executing trades based on predetermined strategies
Recording and analyzing trade data for performance evaluation
I applied via Recruitment Consulltant and was interviewed before Sep 2023. There were 4 interview rounds.
3 coding questions on hacekrank platform
HashMap is a data structure that stores key-value pairs and uses hashing to efficiently retrieve values.
HashMap internally uses an array of linked lists to store key-value pairs.
When a key-value pair is added, the key is hashed to determine the index in the array where it will be stored.
If multiple keys hash to the same index, a linked list is used to handle collisions.
HashMap uses the hashCode() method of keys to calc...
Top trending discussions
I appeared for an interview before Mar 2016.
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.
HackerEarth / Hacker rank Test
Using dynamic programming to find the lowest cost for metro passes based on given days.
Create an array to store the minimum cost for each day.
Iterate through each day and calculate the minimum cost based on 1, 7, or 30 day pass.
Update the minimum cost for each day using dynamic programming.
Return the minimum cost for the total number of days needed.
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.
I applied via Naukri.com and was interviewed in May 2024. There were 3 interview rounds.
DSA , LLD on bar raiser
DSA, SQL and discussions around projects
posted on 10 Mar 2022
Topic wt is ms office
Eassys dscover the basic structure of all essaysand see what a goo d essay introduction and conclusion look like
Joins, Jobs, stored procedures,cursors.
based on 2 interview experiences
Difficulty level
Duration
based on 23 reviews
Rating in categories
Assistant Vice President
2.7k
salaries
| ₹25 L/yr - ₹43 L/yr |
Senior Analyst
1.3k
salaries
| ₹5 L/yr - ₹11.3 L/yr |
Assistant Manager
1.2k
salaries
| ₹11 L/yr - ₹19 L/yr |
Process Advisor
1k
salaries
| ₹3.3 L/yr - ₹7.2 L/yr |
Vice President
806
salaries
| ₹42.6 L/yr - ₹72.4 L/yr |
Deutsche Bank
Accenture
Amazon
Deloitte