Upload Button Icon Add office photos

Filter interviews by

Cigna Service Advisor Interview Questions and Answers

Updated 8 Jul 2024

Cigna Service Advisor Interview Experiences

1 interview found

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(2 Questions)

  • Q1. Basic question around your skill set
  • Q2. Business values about your previous projects

Interview questions from similar companies

Intern Interview Questions & Answers

Droom user image Anonymous

posted on 5 May 2017

I appeared for an interview in Oct 2016.

Interview Questionnaire 

2 Questions

  • Q1. What do you know about our company and product
  • Ans. 

    I'm sorry, I don't have access to the internet to research the company and product.

    • Answered by AI
    • Q2. Tell us all you know about Droom
    • Ans. 

      Droom is an online marketplace for buying and selling new and used vehicles.

      • Founded in 2014 by Sandeep Aggarwal

      • Offers a wide range of vehicles including cars, bikes, and scooters

      • Provides services such as vehicle history reports and inspections

      • Has over 6,500 certified dealers and over 50,000 listings

      • Operates in India and Singapore

    • Answered by AI

    Interview Preparation Tips

    Round: Resume Shortlist
    Experience: The company needed people with a few extracurriculars to fit into their company culture. Thus they selected students with a good technical background and extracurricular skillset
    Tips: Mention the extracurriculars well and your learnings from each of them.

    Round: Technical Interview
    Experience: The company needed people with a few extracurriculars to fit into their company culture. Thus they selected students with a good technical background and extracurricular skillset
    Tips: Mention the extracurriculars well and your learnings from each of them.

    Round: Technical Interview
    Experience: Seems like an HR question, but is a product based question for the company. So now, when they call it technical, it is because their product is the website that they manage. So I started talking about Droom's vision and mission.
    I spoke of a few features that would help customers. I also spoke of the tools that were useful for customer experience. I also mentioned the speed and quality of the site.
    Tips: Here be careful as you need to answer in the technical sense. Starting with when the company was started/ the location will not help build a point. Start off with the product. Also feel free to point out negatives, but make sure you sandwich it between smoother and better things.

    Interview Preparation Tips

    Round: Resume Shortlist
    Experience: You need to submit your CV and they shortlist you on this basis.Fast and accurate coding.
    Tips: Clearly specify any technical achievement.

    Round: Coding
    Experience: You are given 4 hours to solve a few algorithmic questions.Start practicing for this from sometime earlier.
    Tips: There are puzzles available on the Facebook page.

    Round: Technical Interview
    Experience: Three interviews. All almost exclusively technical with 1-2 HR questions.
    The questions are mainly algorithmic in nature and you need to code online while talking to them.
    Tips: Be as accurate and clean with your code as possible.

    General Tips: Be creative while answering the questions. They might ask you questions like 'What changes would you want to make to Facebook?'.
    Prepare algorithmic questions for the interviews. Most companies like Facebook, Google, Microsoft and others focus on this.
    Technical projects or internships will be beneficial.
    Qualifying for or winning programming contests like overnite is very beneficial. Involvement in Social/Cultural activities or sports is not really essential.
    Skill Tips: Being good at writing fast and correct code in any language helps a lot.
    Skills: Programming
    College Name: IIT KHARAGPUR

    Interview Questionnaire 

    8 Questions

    • Q1. Given two “ids” and a function getFriends(id) to get the list of friends of that person id, write a function that returns the list of mutual friends
    • Ans. 

      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

    • Answered by AI
    • Q2. Given an “id” and a function getFriends(id) to get the list of friends of that person id, write a function that returns the list of “friends of friends” in the order of decreasing number of mutual friends,...
    • Ans. 

      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

    • Answered by AI
    • Q3. Given a number of time slots – start time and end time,“a b”, find any specific time with the maximum number of overlapping. After solving the problem I had to prove my solution
    • Ans. 

      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

    • Answered by AI
    • Q4. Given an array of Integers, find the Longest sub-array whose elements are in Increasing Order
    • Ans. 

      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

    • Answered by AI
    • Q5. Given an array of Integers, find the length of Longest Increasing Subsequence and print the sequence.
    • Ans. 

      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...

    • Answered by AI
    • Q6. Given a Sorted Array which has been rotated, write the code to find a given Integer
    • Ans. 

      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.

    • Answered by AI
    • Q7. You have a number of incoming Integers, all of which cannot be stored into memory. We need to print largest K numbers at the end of input
    • Ans. 

      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.

    • Answered by AI
    • Q8. Implement LRU Cache
    • Ans. 

      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

    • Answered by AI

    Interview Preparation Tips

    Round: ONLINE CODING ROUND
    Experience: Facebook visited our campus in July, 2012. We had an online coding round hosted on InterviewStreet. We were asked to solve just one problem. The given problem boils down to : Given a undirected graph, source and destination, write the code to find the total number of distinct nodes visited, considering all possible paths.
    Tips: Those shortlisted had to fly to Delhi for a Personal Interview. There were four rounds of interview, each of 45 minutes. The questions were simple. But just solving the given problem wasn't enough.

    There was much more interaction and short questions asked related to the problem

    Round: Technical Interview
    Experience: The above mentioned questions wer asked in the interview. For every solution I was asked to write the code on paper. The code should also include the implementation of the data structures used (I used heaps - so I was asked to implement heaps ). They are looking for someone with good problem solving skills and conceptually sound in data structures

    College Name: BIT MESRA

    Skills evaluated in this interview

    Interview Questionnaire 

    3 Questions

    • Q1. Some question on KMP
    • Q2. Simulation Question
    • Q3. Topological Sort Question

    Interview Preparation Tips

    Round: Test
    Experience: Simple
    Tips: Online Coding Questions
    Duration: 60 minutes

    Round: Technical Interview
    Experience: Moderately difficult
    Tips: Thorough understanding of all the algorithms is required.

    Round: Technical Interview
    Experience: Easy
    Tips: Need to start a question afresh without attacking it the way you have solved questions in the past

    Round: Technical Interview
    Experience: Easy/moderately difficult
    Tips: The idea was not that easy to click.

    Skills: Coding
    College Name: IIT BOMBAY
    Motivation: Facebook has revolutionised social networking.

    I appeared for an interview before Dec 2020.

    Round 1 - Face to Face 

    (2 Questions)

    Round duration - 60 Minutes
    Round difficulty - Medium

    This was a Data Structures and Algorithms round with preety good questions . I was expected to come up with an efficient approach and code it as well .

    • Q1. 

      K Closest Points to Origin Problem Statement

      Your house is located at the origin (0,0) of a 2-D plane. There are N neighbors living at different points on the plane. Your goal is to visit exactly K neighb...

    • Ans. 

      Find the K closest points to the origin in a 2-D plane using Euclidean Distance.

      • Calculate the Euclidean Distance of each point from the origin

      • Sort the points based on their distances

      • Return the first K points as the closest neighbors

    • Answered by AI
    • Q2. 

      Power Set Generation

      Given a sorted array of 'N' integers, your task is to generate the power set for this array. Each subset of this power set should be individually sorted.

      A power set of a set 'ARR' i...

    • Ans. 

      Generate the power set of a sorted array of integers with individually sorted subsets.

      • Use recursion to generate all possible subsets by including or excluding each element in the array.

      • Sort each subset before adding it to the power set.

      • Handle base cases for empty array and single element array.

      • Ensure the subsets are unique by using a set data structure.

      • Time complexity can be exponential due to the nature of generating

    • Answered by AI
    Round 2 - Face to Face 

    (2 Questions)

    Round duration - 50 Minutes
    Round difficulty - Hard

    This was also a DSA round where I was asked to code only one of the questions but I eventually ended up coding both as I had some spare time and explained my approches very smoothly to the interviewer . This round went preety well .

    • Q1. 

      Roman Numeral to Integer Conversion

      Convert a string representing a Roman numeral into its integer equivalent and return the result.

      Explanation:

      Roman numerals are represented by seven different symbol...

    • Ans. 

      Convert a Roman numeral string to its integer equivalent.

      • Create a mapping of Roman numeral symbols to their integer values.

      • Iterate through the input string and add the corresponding integer values.

      • Handle cases where subtraction is needed (e.g., IV = 4, IX = 9).

    • Answered by AI
    • Q2. 

      Pair Sum Problem Statement

      You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.

      Note:
      ...
    • Ans. 

      Find pairs of elements in an array that sum up to a given value, sorted in a specific order.

      • Iterate through the array and for each element, check if the complement (S - current element) exists in a hash set.

      • If the complement exists, add the pair to the result list.

      • Sort the result list based on the criteria mentioned in the question.

      • Return the sorted list of pairs.

    • Answered by AI
    Round 3 - Face to Face 

    (2 Questions)

    Round duration - 50 Minutes
    Round difficulty - Medium

    This was also a DSA round with 2 questions . One was implementation heavy and the other was related to recursion and so I handled it carefully so that my code does not run into TLE or Segmentation Fault.

    • Q1. 

      Arithmetic Expression Evaluation Problem Statement

      You are provided with a string expression consisting of characters '+', '-', '*', '/', '(', ')' and digits '0' to '9', representing an arithmetic express...

    • Ans. 

      Evaluate arithmetic expressions in infix notation with given operators and precedence rules.

      • Parse the infix expression to postfix using a stack.

      • Evaluate the postfix expression using a stack.

      • Handle operator precedence and parentheses while evaluating.

      • Ensure no division by zero cases and operands fit in 32-bit integer.

    • Answered by AI
    • Q2. 

      Remove Duplicates from Sorted Array Problem Statement

      You are given a sorted integer array ARR of size N. Your task is to remove the duplicates in such a way that each element appears only once. The outpu...

    • Ans. 

      Remove duplicates from a sorted array in-place with O(1) extra memory.

      • Use two pointers - one for iterating through the array and another for placing unique elements.

      • Compare current element with next element to identify duplicates and skip them.

      • Update array in-place by moving unique elements to the front.

      • Return the length of the array after removal of duplicates.

    • Answered by AI
    Round 4 - Face to Face 

    (2 Questions)

    Round duration - 50 Minutes
    Round difficulty - Medium

    This was a typical System Design round where I was asked about the various features of Facebook and what sort of data structures and algorithms are used in implementing them .

    • Q1. How does Facebook store likes and dislikes?
    • Ans. 

      Facebook stores likes and dislikes using a combination of databases and algorithms.

      • Likes and dislikes are stored in databases such as MySQL or Cassandra.

      • Algorithms are used to analyze user behavior and recommend content based on likes and dislikes.

      • User interactions with posts, pages, and ads are tracked to determine likes and dislikes.

      • Likes and dislikes may also be used to personalize the user's feed and target ads mor

    • Answered by AI
    • Q2. How does Facebook implement graph search?
    • Ans. 

      Facebook implements graph search using a graph database to efficiently search for connections between users and their interests.

      • Facebook uses a graph database to store connections between users, pages, groups, etc.

      • The graph search algorithm traverses the graph to find relevant connections based on user queries.

      • It takes into account factors like user relationships, interests, and interactions to provide personalized sea

    • Answered by AI
    Round 5 - Face to Face 

    (2 Questions)

    Round duration - 50 Minutes
    Round difficulty - Medium

    This was a preety intense round as I was grilled more on my System Design concepts but eventually I was able to asnwers all the questions with some help from the interviewer.

    • Q1. What is Hadoop and why is it used?
    • Ans. 

      Hadoop is a framework for distributed storage and processing of large data sets.

      • Hadoop is used for storing and processing big data across a distributed network of computers.

      • It is based on the MapReduce programming model, which allows for parallel processing of data.

      • Hadoop consists of HDFS for storage and YARN for resource management.

      • It is used for tasks like data warehousing, log processing, recommendation systems, and...

    • Answered by AI
    • Q2. How does Facebook Chat work?
    • Ans. 

      Facebook Chat works by using a combination of websockets, long polling, and push technology to deliver real-time messaging.

      • Facebook Chat uses websockets for real-time communication between the client and server.

      • Long polling is used to check for new messages when websockets are not supported.

      • Push technology is used to notify users of new messages even when the chat window is not open.

      • Messages are stored in a database an...

    • Answered by AI

    Interview Preparation Tips

    Eligibility criteriaAbove 7 CGPAFacebook interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 5 MonthsInterview preparation tips for other job seekers

    Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
    Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
    Tip 3 : Do at-least 2 good projects and you must know every bit of them.

    Application resume tips for other job seekers

    Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
    Tip 2 : Every skill must be mentioned.
    Tip 3 : Focus on skills, projects and experiences more.

    Final outcome of the interviewSelected

    Skills evaluated in this interview

    Interview Preparation Tips

    Round: Test
    Tips: Just try coding as much as you can in the four years of graduation.

    Round: Interview
    Experience: Three Coding Interview and a Behavioral Interview were conducted.
    Tips: Try to get some prior knowledge about the company's infrastructure.w

    General Tips: Practice as much problems as you can online or offline.
    Skill Tips: Coding is the key for any software company.
    Skills: Coding
    College Name: IIT KHARAGPUR
    Motivation: Its the best in business

    I applied via Recruitment Consultant and was interviewed in Aug 2019. There were 5 interview rounds.

    Interview Questionnaire 

    1 Question

    • Q1. Basic Questions only, Oops concept, Android basic questions, work manager related, MVVM pattern, why kotlin?

    Interview Preparation Tips

    Interview preparation tips for other job seekers - It is a well-motivated place in terms of work, they are really making the best use of technology that they can. The interview can be clarified by someone who has clear basics of technology, how things are really moving in technology. They are only examining the basics of technology.

    I applied via Company Website and was interviewed in Apr 2021. There were 3 interview rounds.

    Interview Questionnaire 

    3 Questions

    • Q1. Ds algo questions
    • Q2. Js basics
    • Q3. React.js

    Interview Preparation Tips

    Interview preparation tips for other job seekers - It was good you should mainly focus on Ds algo part and basics of Js or other technology for which you are applying .

    Interview Questionnaire 

    1 Question

    • Q1. Three 2d matrix questions in first round from leetcode. One was simple dp question. Two questions in second round one questions was on trees. One questions was of strings. In third round which was engineer...

    Cigna Interview FAQs

    How many rounds are there in Cigna Service Advisor interview?
    Cigna interview process usually has 1 rounds. The most common rounds in the Cigna interview process are Technical.

    Tell us how to improve this page.

    Cigna Service Advisor Interview Process

    based on 1 interview

    Interview experience

    5
      
    Excellent
    View more

    Interview Questions from Similar Companies

    Facebook Interview Questions
    4.3
     • 52 Interviews
    MagicPin Interview Questions
    2.6
     • 50 Interviews
    Shaadi.com Interview Questions
    3.3
     • 27 Interviews
    HealthKart Interview Questions
    4.0
     • 26 Interviews
    Tokopedia Interview Questions
    4.1
     • 25 Interviews
    Meritto Interview Questions
    3.6
     • 22 Interviews
    JUSPAY Interview Questions
    3.1
     • 21 Interviews
    Droom Interview Questions
    3.7
     • 19 Interviews
    AstroTalk Interview Questions
    3.4
     • 18 Interviews
    View all
    Application Development Analyst
    11 salaries
    unlock blur

    ₹11 L/yr - ₹16 L/yr

    Senior Claims Representative
    10 salaries
    unlock blur

    ₹4 L/yr - ₹6.5 L/yr

    Senior Analyst
    10 salaries
    unlock blur

    ₹12 L/yr - ₹25 L/yr

    Application Development - Senior Analyst
    9 salaries
    unlock blur

    ₹17 L/yr - ₹24.2 L/yr

    Architect
    9 salaries
    unlock blur

    ₹42.8 L/yr - ₹46.3 L/yr

    Explore more salaries
    Compare Cigna with

    Anthem

    3.6
    Compare

    UnitedHealth

    4.0
    Compare

    Aetna

    4.9
    Compare

    Humana

    4.6
    Compare
    Did you find this page helpful?
    Yes No
    write
    Share an Interview