Cigna Associate Quality Assurance Engineer Interview Questions and Answers

Easy to medium, can solve with leetcode medium

Q1. Number of islands count
Ans. 
Count the number of islands in a grid of '1's and '0's
• Iterate through the grid and for each '1' encountered, perform a depth-first search to mark all connected '1's as visited

• Increment the island count for each new island found

• Ensure to handle boundary cases and check for visited nodes
Answered by AI
Add your answer
Q2. First and last index of a particular element in an array
Ans. 
Find the first and last index of a specific element in an array of strings.
• Iterate through the array and keep track of the index of the first and last occurrence of the element.

• Return the first and last index once the iteration is complete.

• Example: Array ['apple', 'banana', 'apple', 'orange'], element 'apple' - First index: 0, Last index: 2.
Answered by AI
Add your answer

Q1. Focus on algorithms - trees, graphs. Questions on improving algorithm performance. Converting algorithm to code.
Add your answer

Q1. Tell me about yourself
Add your answer

45 min round. Similar to Leetcode medium level question.

45 min coding round, 2 question asked

Q1. System design of proximity service
Ans. 
Design a system for proximity service
• Utilize geolocation data to track user locations

• Implement algorithms to calculate proximity between users

• Use real-time updates to notify users of nearby contacts
Answered by AI
Add your answer

Q1. Behavioral questions
Add your answer

Leetcode question on DFS and BFS. Passed

Develop a ml model to predict pass/no pass decision.

Implement boolean canConstruct(String targetString, String[] dict) which returns true if we can construct the targetString by concatenating the words given in the dictionary

Q1. Implement key value store
Ans. 
Implement a key value store for storing and retrieving data efficiently.
• Use a hash table or a balanced tree data structure to store key-value pairs.

• Implement functions for inserting, updating, deleting, and retrieving key-value pairs.

• Consider implementing features like transactions, concurrency control, and data persistence.

• Example: Implement a simple key value store using a hash table in Python.
Answered by AI
Add your answer

Q1. DSA - level order traversal, sliding window.
Add your answer

Q1. Atomic transaction in distributed system
Ans. 
Atomic transactions ensure that all operations in a transaction are completed successfully or none at all in a distributed system.
• Atomic transactions guarantee that all operations within a transaction are either all successful or all rolled back.

• In distributed systems, atomic transactions are crucial for maintaining data consistency across multiple nodes.

• ACID properties (Atomicity, Consistency, Isolation, Durability) a...read more
Answered by AI
Add your answer

Asked basic sorting and searching algorithms

Q1. Asked questions about sql and Java
Add your answer