Filter interviews by
I applied via Naukri.com and was interviewed in Jan 2024. There were 2 interview rounds.
Write a program to find the missing number among 1-100 integers in an array.
Iaac (Infrastructure as Code) offers numerous benefits in terms of scalability, efficiency, and consistency.
Scalability: Iaac allows for easily scaling infrastructure resources up or down based on demand.
Efficiency: By automating the provisioning and management of infrastructure, Iaac reduces manual effort and speeds up deployment processes.
Consistency: Iaac ensures that infrastructure configurations are consistent acr...
CI and CD have different components that enable continuous integration and continuous delivery of software.
CI (Continuous Integration) components include version control system, build server, and automated testing tools.
CD (Continuous Delivery) components include deployment automation, release management, and monitoring tools.
Examples of CI components are Git, Jenkins, and JUnit.
Examples of CD components are Docker, Ku
Various checks are performed on artifacts to ensure their quality and reliability.
Visual inspection for any physical defects or abnormalities
Functional testing to verify proper operation
Performance testing to assess speed, efficiency, and accuracy
Compatibility testing to ensure compatibility with other systems or components
Security testing to identify vulnerabilities and ensure data protection
Usability testing to evalu...
I applied via LinkedIn and was interviewed in Jun 2024. There were 5 interview rounds.
1 hour - NodeJS Based
High level system design involves creating an overall architecture for a software system.
Identify the main components of the system
Define the interactions between the components
Consider scalability, reliability, and performance
Use diagrams to visualize the design
Example: Designing a social media platform with user profiles, posts, and messaging functionality
Low level system design involves designing the internal components of a software system.
Focus on the architecture of the system at a detailed level
Consider how different components interact with each other
Optimize for performance and efficiency
Think about scalability and maintainability
Examples: designing a database schema, creating algorithms for data processing
I applied via LinkedIn and was interviewed in Aug 2024. There was 1 interview round.
A time series based problem statement given.
Asked to solve 3 small problem of logical thinking in programming language of chice
Bazaarvoice interview questions for popular designations
I applied via Referral and was interviewed before Sep 2023. There was 1 interview round.
Java coding - median number
I applied via Campus Placement and was interviewed before May 2020. There were 5 interview rounds.
I applied via Naukri.com and was interviewed in Jun 2020. There were 4 interview rounds.
I applied via Campus Placement and was interviewed before Jun 2021. There were 2 interview rounds.
Current affairs - relevant things going on in the world especially financial/Fintech domain
To check if a directed graph is cyclic or not
Use Depth First Search (DFS) algorithm to traverse the graph
Maintain a visited set to keep track of visited nodes
Maintain a recursion stack to keep track of nodes in the current DFS traversal
If a node is visited and is already in the recursion stack, then the graph is cyclic
If DFS traversal completes without finding a cycle, then the graph is acyclic
Return a random byte from a stream of bytes with equal probability.
Create a variable to store the count of bytes read
Create a variable to store the current random byte
For each byte read, generate a random number between 0 and the count of bytes read
If the random number is 0, store the current byte as the random byte
Return the random byte
Check if a binary tree is a binary search tree or not.
Traverse the tree in-order and check if the values are in ascending order.
For each node, check if its value is greater than the maximum value of its left subtree and less than the minimum value of its right subtree.
Use recursion to check if all nodes in the tree satisfy the above condition.
Algorithm to find Nth-to-Last element in a singly linked list of unknown length
Traverse the list and maintain two pointers, one at the beginning and one at Nth node from beginning
Move both pointers simultaneously until the second pointer reaches the end of the list
The first pointer will be pointing to the Nth-to-Last element
If N=0, return the last element
Parse the list only once
Print all possible permutations of an array of integers
Use recursion to swap elements and generate permutations
Start with the first element and swap it with each subsequent element
Repeat the process for the remaining elements
Stop when all elements have been swapped with the first element
Print each permutation as it is generated
Design a stack that prints the minimum element pushed in O(1)
Use two stacks, one for storing elements and another for storing minimums
When pushing an element, compare it with the top of minimum stack and push the smaller one
When popping an element, pop from both stacks
To get the minimum element, just return the top of minimum stack
To find the starting point of a loop in a linked list, use Floyd's cycle-finding algorithm.
Use two pointers, one moving at twice the speed of the other.
When they meet, move one pointer to the head of the list and keep the other at the meeting point.
Move both pointers one step at a time until they meet again, which is the starting point of the loop.
To find a number in a matrix where all rows and columns are sorted non-decreasingly. Complexity of the solution.
Use binary search to find the number in each row and column
Start from the top-right corner or bottom-left corner to optimize search
Time complexity: O(m log n) or O(n log m) depending on the starting corner
based on 8 interviews
Interview experience
based on 11 reviews
Rating in categories
8-13 Yrs
Not Disclosed
Senior Software Engineer
11
salaries
| ₹22 L/yr - ₹34 L/yr |
Software Engineer
10
salaries
| ₹10.8 L/yr - ₹20 L/yr |
Associate Software Engineer
9
salaries
| ₹8 L/yr - ₹10.8 L/yr |
Senior Product Manager
8
salaries
| ₹25 L/yr - ₹36 L/yr |
Scrum Master
8
salaries
| ₹9 L/yr - ₹28 L/yr |
Yodlee
Fingent
Bravura Solutions
TEOCO Software