Faster and better experience!
Filter interviews by
ELK stack is a popular open-source log management solution consisting of Elasticsearch, Logstash, and Kibana.
ELK stack stands for Elasticsearch, Logstash, and Kibana.
Elasticsearch is a distributed search and analytics engine for storing and searching data.
Logstash is a data processing pipeline that ingests, transforms, and enriches data.
Kibana is a data visualization tool used to analyze and visualize the data stored i...
Rate your
company
🤫 100% anonymous
How was your last interview experience?
I applied via Approached by Company and was interviewed in Jul 2024. There was 1 interview round.
I had to make a tough decision when prioritizing features for a tight deadline project.
Prioritized features based on impact and feasibility
Communicated with stakeholders to explain the decision-making process
Managed expectations and ensured alignment with project goals
I addressed the issue directly with the teammate and worked together to identify areas for improvement.
Had a one-on-one conversation with the teammate to discuss performance concerns
Provided constructive feedback and set clear expectations for improvement
Offered support and resources to help the teammate succeed
Monitored progress and provided ongoing feedback and guidance
Celebrated improvements and successes to boost m
I have extensive experience with various design patterns such as Singleton, Factory, Observer, and MVC.
Implemented Singleton pattern to ensure only one instance of a class exists
Utilized Factory pattern to create objects without specifying the exact class
Implemented Observer pattern for event handling and notifications
Utilized MVC pattern for separating concerns in a software application
Cigna interview questions for popular designations
I applied via LinkedIn
SQL, Python, like case about window function
I applied via Recruitment Consulltant and was interviewed in Mar 2024. There were 2 interview rounds.
Coding mainly on LinkedList and Strings
I applied via Naukri.com and was interviewed in May 2024. There was 1 interview round.
English grammar test
I applied via Recruitment Consultant and was interviewed before Sep 2020. There were 4 interview rounds.
Top trending discussions
Function to return mutual friends given two ids and getFriends(id) function
Call getFriends(id) for both ids to get their respective friend lists
Iterate through both lists and compare to find mutual friends
Return the list of mutual friends
Function to return list of friends of friends in decreasing order of mutual friends
Use a set to store all friends of friends
Iterate through the list of friends of the given id
For each friend, iterate through their list of friends and count mutual friends
Sort the set of friends of friends by decreasing number of mutual friends
Given time slots, find a specific time with maximum overlap. Prove solution.
Create a list of all start and end times
Sort the list in ascending order
Iterate through the list and keep track of the number of overlaps at each time
Return the time with the maximum number of overlaps
Prove solution by testing with different input sizes and edge cases
Find the longest sub-array with increasing order of integers.
Iterate through the array and keep track of the current sub-array's start and end indices.
Update the start index whenever the current element is smaller than the previous element.
Update the end index whenever the current element is greater than or equal to the next element.
Calculate the length of the sub-array and compare it with the longest sub-array found s
Find the length of longest increasing subsequence and print the sequence from an array of integers.
Use dynamic programming to solve the problem
Create an array to store the length of longest increasing subsequence ending at each index
Traverse the array and update the length of longest increasing subsequence for each index
Print the sequence by backtracking from the index with the maximum length
Time complexity: O(n^2)
Exam...
Code to find a given integer in a rotated sorted array.
Use binary search to find the pivot point where the array is rotated.
Divide the array into two subarrays and perform binary search on the appropriate subarray.
Handle edge cases such as the target integer not being present in the array.
Use a min-heap to keep track of the largest K numbers seen so far.
Create a min-heap of size K.
For each incoming integer, add it to the heap if it's larger than the smallest element in the heap.
If the heap size exceeds K, remove the smallest element.
At the end, the heap will contain the largest K numbers in the input.
LRU Cache is a data structure that stores the most recently used items and discards the least recently used items.
Use a doubly linked list to keep track of the order of items in the cache
Use a hash map to store the key-value pairs for fast access
When an item is accessed, move it to the front of the linked list
When the cache is full, remove the least recently used item from the back of the linked list and the hash map
based on 12 interviews
Interview experience
Application Development Analyst
11
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Analyst
10
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Claims Representative
9
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Customer Service Representative
8
salaries
| ₹0 L/yr - ₹0 L/yr |
IT Help Desk Support Engineer
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Anthem
UnitedHealth
Aetna
Humana