Filter interviews by
I applied via LinkedIn and was interviewed in Feb 2023. There were 2 interview rounds.
I was interviewed before Nov 2023.
It was python + sql Hackerrank assesment
My solution involves writing SQL queries to extract, manipulate, and analyze data from databases.
Use SELECT statement to retrieve data from tables
Utilize WHERE clause to filter data based on specific conditions
Aggregate functions like SUM, AVG, COUNT can be used for calculations
JOIN tables to combine data from multiple sources
Use GROUP BY to group data based on certain columns
ORDER BY to sort data in ascending or desce
posted on 23 Jan 2022
I applied via Recruitment Consultant and was interviewed before Jan 2021. There were 4 interview rounds.
posted on 27 Aug 2021
I applied via LinkedIn and was interviewed in Jul 2021. There were 6 interview rounds.
Red-black tree is a self-balancing binary search tree with O(log n) complexity for insertion, deletion, and search.
Red-black tree is a type of binary search tree with additional properties to ensure balance.
It has two types of nodes - red and black - with specific rules for their placement.
The tree is balanced by performing rotations and color flips during insertion and deletion.
Complexity of insertion, deletion, and s...
I applied via Recruitment Consultant and was interviewed in Jul 2021. There were 4 interview rounds.
I applied via Naukri.com and was interviewed before Mar 2021. There were 4 interview rounds.
I applied via Walk-in and was interviewed in May 2022. There were 2 interview rounds.
based on 1 interview
Interview experience
Software Developer
9
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Delivery Manager
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Executive
6
salaries
| ₹0 L/yr - ₹0 L/yr |
Analyst
6
salaries
| ₹0 L/yr - ₹0 L/yr |
Verifone
Worldline
PayPal
Adyen