Filter interviews by
I applied via LinkedIn and was interviewed in Aug 2024. There were 2 interview rounds.
Dataweave logic questions
I applied via Approached by Company and was interviewed before Oct 2022. There were 4 interview rounds.
Pair programming with engineer
Kubernetes is used for container orchestration, scaling, and management in cloud-native applications.
Automating deployment, scaling, and management of containerized applications
Ensuring high availability and fault tolerance
Facilitating easy scaling of applications based on demand
Managing updates and rollbacks seamlessly
Supporting multi-cloud deployments
Example: Running microservices architecture on Kubernetes for a sca
Top trending discussions
I applied via Campus Placement and was interviewed in Jan 2016. There were 3 interview rounds.
I applied via Campus Placement and was interviewed in Dec 2016. There were 5 interview rounds.
To find a loop in a linked list, we use Floyd's cycle-finding algorithm.
Floyd's cycle-finding algorithm uses two pointers, one moving at twice the speed of the other.
If there is a loop in the linked list, the two pointers will eventually meet.
To detect the meeting point, we reset one of the pointers to the head of the linked list and move both pointers at the same speed.
The meeting point is the start of the loop.
LRU, MRU and LFU are caching algorithms used to manage memory in computer systems.
LRU stands for Least Recently Used and removes the least recently used items from the cache when the cache is full.
MRU stands for Most Recently Used and removes the most recently used items from the cache when the cache is full.
LFU stands for Least Frequently Used and removes the least frequently used items from the cache when the cache i...
posted on 13 Jun 2024
I applied via Company Website and was interviewed in May 2024. There was 1 interview round.
The task was a Codility type
I was interviewed before Mar 2021.
To check if a number is a power of 2, we can use bitwise operations.
A power of 2 has only one bit set to 1, so we can use the bitwise AND operator to check if the number is a power of 2.
If n is a power of 2, then n & (n-1) will be 0.
For example, 8 (1000 in binary) is a power of 2, and 8 & 7 (0111 in binary) is 0.
Sort a stack without using another data structure
Use recursion to pop the top element and insert it at the bottom of the remaining stack
Repeat until the stack is sorted in ascending order
Time complexity: O(n^2), space complexity: O(n) due to recursion
Check if array has continuous increasing and decreasing values
Loop through the array and check if each element is greater than the previous one
Once you find the maximum element, check if the remaining elements are in decreasing order
If yes, return true else false
Design a cricinfo (LLD)
Identify the entities: players, teams, matches, scorecards, tournaments, etc.
Define the relationships between entities
Create a database schema to store the data
Implement APIs to fetch and update data
Design a UI to display the information
Consider scalability and performance
Ensure data security and privacy
posted on 18 Mar 2024
I applied via Company Website and was interviewed in Feb 2024. There were 3 interview rounds.
Basic question asked
Object-oriented programming paradigm that focuses on objects and classes for code organization and reusability.
Encapsulation: bundling data and methods that operate on the data into a single unit (object)
Inheritance: ability of a class to inherit properties and behavior from another class
Polymorphism: ability to present the same interface for different data types
posted on 6 Oct 2024
I applied via Company Website and was interviewed in Mar 2024. There was 1 interview round.
based on 2 interviews
Interview experience
based on 3 reviews
Rating in categories
Senior Analyst
25
salaries
| ₹0 L/yr - ₹0 L/yr |
IT System Administrator
18
salaries
| ₹0 L/yr - ₹0 L/yr |
Team Lead
17
salaries
| ₹0 L/yr - ₹0 L/yr |
Analyst
15
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Associate
13
salaries
| ₹0 L/yr - ₹0 L/yr |
Palo Alto Networks
Gen
Trend Micro
McAfee