Upload Button Icon Add office photos

Filter interviews by

Clear (1)

Evolent Health International Software Developer Interview Questions and Answers

Updated 10 Oct 2024

Evolent Health International Software Developer Interview Experiences

1 interview found

Interview experience
1
Bad
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Not Selected

I applied via Naukri.com and was interviewed in Sep 2024. There were 2 interview rounds.

Round 1 - Technical 

(2 Questions)

  • Q1. Basic to intermediate.net, EF, SQL, C#, OOP
  • Q2. Basics of .Net Core
Round 2 - Technical 

(1 Question)

  • Q1. Deep into.net and sql

Interview Preparation Tips

Interview preparation tips for other job seekers - Interviewers were good and friendly, but HR's does not have any management.

I completed 2 tech rounds, shortlisted in both of them and then HR is saying that my experience is low for the position so they will not move forward. Seriously W.T.F..

And after that HR is not picking up calls
Even while scheduling interviews there were 3-4 rescheduled.

Interview questions from similar companies

I applied via Naukri.com and was interviewed before May 2021. There were 3 interview rounds.

Round 1 - Technical 

(1 Question)

  • Q1. Java Collection, OOPS, Seralization
Round 2 - Technical 

(1 Question)

  • Q1. Java OOPS, Collection, threading, SQL
Round 3 - HR 

(1 Question)

  • Q1. Nothing specific, Salary Negotiations.

Interview Preparation Tips

Interview preparation tips for other job seekers - overall good experience and process was quick

Interview Questionnaire 

1 Question

  • Q1. Basic OOPS questions like 4 pillars of OOPS and their real life applications. Abstract class. DBMS Inner join and Outer join.

I applied via Naukri.com and was interviewed before Apr 2020. There was 1 interview round.

Interview Questionnaire 

1 Question

  • Q1. Technical questions

Interview Preparation Tips

Interview preparation tips for other job seekers - I have visited interview location on morning 7am DLF block Hyderabad. Buy my interview was taken in evening 6:45pm. That was not an interview test it was a patience test.

Interview Questionnaire 

1 Question

  • Q1. What is meant by javascript closure? And why do we use it?
  • Ans. 

    A closure is a function that has access to its outer function's variables, even after the outer function has returned.

    • A closure is created when a function is defined inside another function.

    • It allows for private variables and functions in JavaScript.

    • Closures are used for data hiding, encapsulation, and creating modules.

    • Example: function outer() { var x = 10; function inner() { console.log(x); } return inner; } var clos

  • Answered by AI

Skills evaluated in this interview

I applied via Recruitment Consultant and was interviewed before Jun 2020. There were 3 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. DBMS questions

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare thoroughly

I was interviewed before Jan 2021.

Round 1 - Face to Face 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

The interviewer asked me 2 questions related to DS/Algo in this round . Both the questions were of Easy-Medium difficulty and I was also required to code them in a production ready manner.

  • Q1. 

    Maximum Sum Path in a Binary Tree Problem Statement

    You are provided with a binary tree consisting of N nodes where each node has an integer value. The task is to determine the maximum sum achievable by a...

  • Ans. 

    Find the maximum sum achievable by a simple path between any two nodes in a binary tree.

    • Traverse the binary tree to find all possible paths and calculate their sums.

    • Keep track of the maximum sum encountered during traversal.

    • Consider paths that may include the same node twice.

    • Implement a recursive function to explore all possible paths.

    • Handle cases where nodes have negative values.

  • Answered by AI
  • Q2. 

    Intersection of Two Arrays Problem Statement

    Given two arrays A and B with sizes N and M respectively, both sorted in non-decreasing order, determine their intersection.

    The intersection of two arrays in...

  • Ans. 

    The problem involves finding the intersection of two sorted arrays efficiently.

    • Use two pointers to iterate through both arrays simultaneously.

    • Compare elements at the pointers and move the pointers accordingly.

    • Handle cases where elements are equal, and update the intersection array.

    • Return the intersection array as the result.

  • Answered by AI
Round 2 - Face to Face 

(3 Questions)

Round duration - 50 Minutes
Round difficulty - Medium

This round had 2 questions of DS/Algo to solve under 50 minutes and one question related to Operating Systems.

  • Q1. 

    Next Greater Element Problem Statement

    You are provided with an array or list ARR containing N positive integers. Your task is to determine the Next Greater Element (NGE) for each element in the array.

    T...

  • Ans. 

    Find the Next Greater Element for each element in an array.

    • Iterate through the array from right to left

    • Use a stack to keep track of elements with no greater element to the right

    • Pop elements from the stack until finding a greater element or stack is empty

  • Answered by AI
  • Q2. 

    Number In Arithmetic Progression Problem

    Given three integers X, C, and Y, where X is the first term of an arithmetic sequence with a common difference of C, determine if Y is part of this arithmetic sequ...

  • Ans. 

    Check if a given number is part of an arithmetic sequence with a given first term and common difference.

    • Calculate the arithmetic sequence using the formula: nth term = X + (n-1) * C

    • Check if Y is equal to any term in the sequence to determine if it belongs to the sequence

    • Return 'True' if Y belongs to the sequence, otherwise return 'False'

  • Answered by AI
  • Q3. Can you define process and threads in operating systems?
  • Ans. 

    Processes are instances of programs in execution, while threads are smaller units within a process that can execute independently.

    • A process is a program in execution, consisting of code, data, and resources.

    • Threads are smaller units within a process that can execute independently.

    • Processes have their own memory space, while threads share the same memory space within a process.

    • Processes are heavyweight, while threads ar...

  • Answered by AI
Round 3 - Face to Face 

(3 Questions)

Round duration - 50 Minutes
Round difficulty - Medium

This round had 2 questions of DSA of Easy-Medium difficulty and at the end I was asked a Puzzle to check my general problem solving ability.

  • Q1. 

    Max Product Subset Problem Statement

    Given an array/list arr of size n, determine the maximum product possible by taking any subset of the array/list arr. Return the result modulo 10^9+7 since the product ...

  • Ans. 

    Find the maximum product of a subset of an array modulo 10^9+7.

    • Iterate through the array and keep track of the maximum positive product and minimum negative product encountered so far.

    • Handle cases where the array contains zeros separately.

    • Return the maximum product modulo 10^9+7.

  • Answered by AI
  • Q2. 

    Populating Next Right Pointers in Each Node

    Given a complete binary tree with 'N' nodes, your task is to determine the 'next' node immediately to the right in level order for each node in the given tree.

    ...
  • Ans. 

    Implement a function to update 'next' pointers in a complete binary tree.

    • Iterate level by level using a queue

    • Connect nodes at each level using 'next' pointers

    • Handle null nodes appropriately

    • Ensure the tree is a complete binary tree

  • Answered by AI
  • Q3. You have two wires of different lengths that are both capable of burning for exactly one hour when ignited at both ends. How can you measure a time interval of 45 minutes using these two wires?
Round 4 - Face to Face 

(2 Questions)

Round duration - 50 Minutes
Round difficulty - Medium

This round consisted of 2 questions from DSA where I was first asked to explain my approach to the interviewer with proper complexity analysis and then code the problems. The interviewer was quite friendly and also provided me some hints when I was stuck.

  • Q1. 

    Stack with getMin Operation

    Create a stack data structure that supports not only the usual push and pop operations but also getMin(), which retrieves the minimum element, all in O(1) time complexity witho...

  • Ans. 

    Implement a stack with push, pop, top, isEmpty, and getMin operations in O(1) time complexity without using extra space.

    • Use two stacks - one to store the actual elements and another to store the minimum element at each level.

    • When pushing an element, check if it is smaller than the current minimum and update the minimum stack accordingly.

    • When popping an element, also pop from the minimum stack if the popped element is t...

  • Answered by AI
  • Q2. 

    Split Array Into Maximum Subarrays Problem Statement

    You are given an integer array arr of size N. Your task is to split the array into the maximum number of subarrays such that the first and last occurre...

  • Ans. 

    Given an array, split it into maximum subarrays with first and last occurrence of each element in a single subarray.

    • Iterate through the array and keep track of the first and last occurrence of each element.

    • Use a hashmap to store the indices of each element.

    • Split the array whenever the last occurrence of an element is found.

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAAdobe interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 4 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

I was interviewed before Mar 2021.

Round 1 - Coding Test 

(1 Question)

Round duration - 60 minutes
Round difficulty - Medium

This was a test round where 10 aptitude based questions were to be solved in 60 minutes

  • Q1. You have 5 pirates and 100 gold coins. The challenge is to determine how the pirates will divide the coins among themselves based on their ranking and the rules they follow.
Round 2 - Face to Face 

(4 Questions)

Round duration - 60 minutes
Round difficulty - Medium

They took us to the lab for this on and we were each given a paper with a program on it. It was all mixed as in each person got a different paper, You have around an hour to finish coding. after which you have to explain your code. They also gave wrong or incorrect inputs and see how your code handles these exceptions.

  • Q1. 

    Reverse the String Problem Statement

    You are given a string STR which contains alphabets, numbers, and special characters. Your task is to reverse the string.

    Example:

    Input:
    STR = "abcde"
    Output:
    "e...
  • Ans. 

    Reverse a given string containing alphabets, numbers, and special characters.

    • Iterate through the string from the end to the beginning and append each character to a new string.

    • Use built-in functions like reverse() or StringBuilder in languages like Python or Java for efficient reversal.

    • Handle special characters and numbers along with alphabets while reversing the string.

    • Ensure to consider the constraints provided in th...

  • Answered by AI
  • Q2. 

    K Largest Elements Problem Statement

    Given an unsorted array containing 'N' integers, you are required to find 'K' largest elements from the array and return them in non-decreasing order.

    Input:

    The fir...
  • Ans. 

    Implement a function to find K largest elements in an unsorted array in non-decreasing order.

    • Create a min heap of size K and insert the first K elements of the array

    • For each remaining element, if it is larger than the root of the heap, replace the root with the element and heapify

    • Finally, the heap will contain the K largest elements in non-decreasing order

  • Answered by AI
  • Q3. 

    Remove Character from String Problem Statement

    Given a string str and a character 'X', develop a function to eliminate all instances of 'X' from str and return the resulting string.

    Input:

    The first lin...
  • Ans. 

    Develop a function to remove all instances of a given character from a string.

    • Iterate through the string and build a new string excluding the specified character.

    • Use a StringBuilder or similar data structure for efficient string manipulation.

    • Handle edge cases like empty string or character not found in the input string.

    • Ensure the function completes within the given time constraint.

  • Answered by AI
  • Q4. 

    Triangle of Numbers Pattern

    Ninja is tasked with printing a triangle pattern based on a given number 'N' for any test case.

    Example:

    Input:
    N = 4
    Output:
       1
    232
    34545
    4567654

    Explanation:

    The pat...

  • Ans. 

    Print a triangle pattern of numbers based on a given number 'N'.

    • Iterate through each row and column to determine the numbers to print

    • Use a combination of spaces and numbers to align the pattern correctly

    • Increment the numbers in each row based on the row number

  • Answered by AI
Round 3 - Face to Face 

(4 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Compared to the other round this is more tech oriented. Lot more tech questions. It is of normal difficulty and is not that hard to clear, you only need to know the basics.
Very basic of Data Structure and Oracle knowledge enough. Lots of simple questions from data structures(insert into heaps etc). They did not ask to write code for DS, but rather to explain the logic through diagrams. For some complicated question, they expect how much you brainstorm ideas in solving

  • Q1. 

    Convert Binary Tree to Mirror Tree

    Convert a given binary tree into its mirror tree, where the left and right children of all non-leaf nodes are interchanged.

    Input:

    An integer ‘T’ denoting the number o...
  • Ans. 

    Convert a binary tree into its mirror tree by interchanging left and right children of non-leaf nodes.

    • Traverse the tree in postorder fashion and swap the left and right children of each node.

    • Use recursion to solve the problem efficiently.

    • Modify the binary tree in place without creating a new tree.

  • Answered by AI
  • Q2. 

    Heap Sort Problem Statement

    Given an array ARR consisting of N integers, your task is to use the Heap sort algorithm to arrange the array in non-decreasing order.

    Input:

    The first line of the input cont...
  • Ans. 

    Implement the Heap sort algorithm to arrange an array in non-decreasing order.

    • Implement the Heap sort algorithm to sort the given array in non-decreasing order

    • Use a max heap to sort the array in non-decreasing order

    • Time complexity of Heap sort is O(n log n)

  • Answered by AI
  • Q3. What is indexing in the context of databases?
  • Ans. 

    Indexing in databases is a technique used to improve the speed of data retrieval by creating a data structure that allows for quick lookups.

    • Indexes are created on specific columns in a database table to speed up queries that search for data in those columns.

    • Indexes work similar to the index of a book, allowing the database to quickly locate the desired data without having to scan the entire table.

    • Examples of indexes in...

  • Answered by AI
  • Q4. Which data structure is better for your use case: a B Tree or a Hash Table?
  • Ans. 

    Hash Table is better for fast lookups and insertions, while B Tree is better for range queries and ordered traversal.

    • Use Hash Table for fast lookups and insertions with O(1) average time complexity.

    • Use B Tree for range queries and ordered traversal with O(log n) time complexity.

    • Consider the size of the dataset and the specific operations needed to determine the best data structure.

  • Answered by AI
Round 4 - HR 

Round duration - 30 minutes
Round difficulty - Easy

This round lasted for around 30 minutes. It more of a character analysis round with a lot of HR type questions.

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAAthenahealth interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 6 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

I was interviewed before Mar 2021.

Round 1 - Coding Test 

(1 Question)

Round duration - 60 minutes
Round difficulty - Easy

10 Aptitude questions with difficulty level hard were asked in this test.

  • Q1. What is the minimum number of planes required to go around the world?
  • Ans. 

    The minimum number of planes required to go around the world is one.

    • One plane can fly around the world without needing to stop.

    • The plane can refuel mid-air or carry enough fuel for the entire journey.

    • Examples: Non-stop flights like the Boeing 787 Dreamliner or Airbus A350 can circumnavigate the globe with one plane.

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Technical Interview round with questions based on data structures and algorithms. Questions about previous projects done and my roles on it and my leadership capabilities. Few technical questions from Threads and multi-processing.

  • Q1. 

    Search in a Row-wise and Column-wise Sorted Matrix Problem Statement

    You are given an N * N matrix of integers where each row and each column is sorted in increasing order. Your task is to find the positi...

  • Ans. 

    Given a sorted N * N matrix, find the position of a target integer 'X'.

    • Start from the top-right corner of the matrix and compare the target with the element at that position.

    • Based on the comparison, move left or down in the matrix to narrow down the search.

    • Repeat the process until the target is found or the search goes out of bounds.

    • Return the position of the target if found, else return {-1, -1}.

  • Answered by AI
  • Q2. 

    Rectangular Numbers Problem Statement

    Ninja has a number 'N'. Your task is to generate a pattern where the outer rectangle is filled with the number 'N', and as you move inward, the numbers decrease conse...

  • Ans. 

    Generate a pattern with outer rectangle filled with number 'N' and decreasing consecutively inward.

    • Start by filling the outermost rectangle with the number 'N'.

    • Decrease the numbers consecutively as you move inward towards the center.

    • Continue this pattern until you reach the center of the rectangle.

  • Answered by AI
Round 3 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

DSA based questions were asked in this round. Questions on implementation of Linux directory structure were also asked.

  • Q1. 

    Binary Array Sorting Problem Statement

    You are provided with a binary array, i.e., an array containing only 0s and 1s. Your task is to sort this binary array and return it after sorting.

    Input:

     The fir...
  • Ans. 

    Yes, the binary array sorting problem can be solved in linear time and constant space using a single traversal.

    • Use two pointers approach to swap 0s to the left and 1s to the right.

    • Maintain two pointers, one for 0s and one for 1s, and swap elements accordingly.

    • Example: Input: [1, 0, 1, 0, 1], Output: [0, 0, 1, 1, 1]

  • Answered by AI
  • Q2. 

    Next Greater Element Problem Statement

    You are given an array arr of length N. For each element in the array, find the next greater element (NGE) that appears to the right. If there is no such greater ele...

  • Ans. 

    The task is to find the next greater element for each element in an array to its right, if no greater element exists, return -1.

    • Iterate through the array from right to left and use a stack to keep track of elements.

    • Pop elements from the stack until a greater element is found or the stack is empty.

    • Store the next greater element for each element in the output array.

  • Answered by AI
  • Q3. What is the difference between Binary Search Trees (BST) and Tries?
  • Ans. 

    BST is a binary tree structure where each node has at most two children, while Tries are tree structures used for storing strings.

    • BST is used for searching, inserting, and deleting elements in a sorted manner.

    • Tries are used for storing and searching strings efficiently.

    • BST has a hierarchical structure with left and right child nodes.

    • Tries have nodes representing characters, forming a tree-like structure for strings.

    • Exa...

  • Answered by AI
Round 4 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

This was a technical round. Questions about previous projects and current one were asked. I was also asked about aptitude problems from the first round and how I understood and approached towards solution?

  • Q1. 

    N Queens Problem

    Given an integer N, find all possible placements of N queens on an N x N chessboard such that no two queens threaten each other.

    Explanation:

    A queen can attack another queen if they ar...

  • Ans. 

    The N Queens Problem involves finding all possible placements of N queens on an N x N chessboard without threatening each other.

    • Use backtracking algorithm to explore all possible configurations.

    • Keep track of rows, columns, and diagonals to ensure queens do not threaten each other.

    • Generate valid configurations recursively and backtrack when a solution is not possible.

  • Answered by AI
  • Q2. 

    Form a Triangle Problem Statement

    You are provided with an integer array/list ARR of length N. Your task is to determine if it is possible to construct at least one non-degenerate triangle using the value...

  • Ans. 

    Check if it is possible to form a non-degenerate triangle using the sides provided in the array.

    • Check if the sum of any two sides is greater than the third side for all combinations.

    • If any such combination exists, return true; otherwise, return false.

    • Handle multiple test cases as per the constraints provided.

  • Answered by AI
Round 5 - HR 

Round duration - 30 minutes
Round difficulty - Easy

Behavioral questions and team skills were discussed in this round.

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAAthenahealth interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 4 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 Questionnaire 

12 Questions

  • Q1. Given a binary tree and an integer x, return whether the binary tree has a path from root to a leaf whose values sum to x
  • Q2. Gievn a binary tree and return all root to leaf node pathss row,col and value
  • Ans. 

    Return all root to leaf node paths in a binary tree with row, col and value.

    • Traverse the binary tree recursively and keep track of the current path.

    • When a leaf node is reached, add the path to the result array.

    • Include row, col and value of each node in the path.

    • Use an array of strings to store the paths.

  • Answered by AI
  • Q3. He then asked me to give test cases for testing this program
  • Q4. Given two unsorted arrays of numbers and asked me to find the intersection
  • Q5. GetMax() function for a stack in O(1)
  • Ans. 

    To get max value from a stack in O(1), maintain a separate stack to keep track of maximum values.

    • Create a separate stack to keep track of maximum values

    • Push the maximum value onto the stack whenever a new maximum is encountered

    • Pop the maximum value stack whenever the top element of the main stack is popped

    • Return the top element of the maximum value stack to get the maximum value in O(1)

  • Answered by AI
  • Q6. GetMax() function for a queue in O(1)
  • Ans. 

    To get max element from a queue in O(1) time complexity

    • Maintain a separate variable to keep track of the maximum element in the queue

    • Update the maximum element variable whenever a new element is added or removed from the queue

    • Return the maximum element variable when getMax() function is called

  • Answered by AI
  • Q7. Given an array in which consecutive elements differ by 1, i.e. a[i] – a[i + 1] = 1 or -1, and an element x, find the element in the array
  • Q8. Given an array, find the Next Greatest Element to the right for each element
  • Ans. 

    Find the Next Greatest Element to the right for each element in an array of strings.

    • Iterate through the array from right to left

    • Use a stack to keep track of elements

    • Pop elements from stack until a greater element is found

    • If no greater element is found, assign -1

    • Return the result array

  • Answered by AI
  • Q9. Given an expression, remove unnecessary parenthesis. For example if (((a + b)) * c) is given make it (a + b) * c, as it evaluates in the same way without those parenthesis also
  • Ans. 

    To remove unnecessary parenthesis from an expression, we need to apply a set of rules to identify and eliminate them.

    • Identify and remove parenthesis around single variables or constants

    • Identify and remove parenthesis around expressions with only one operator

    • Identify and remove parenthesis around expressions with operators of equal precedence

    • Identify and remove parenthesis around expressions with operators of different ...

  • Answered by AI
  • Q10. Given an array of integers, find the maximum product which can be formed by three numbers
  • Ans. 

    Find the maximum product of three integers in an array.

    • Sort the array in descending order.

    • Check the product of the first three numbers and the product of the first and last two numbers.

    • Return the maximum of the two products.

  • Answered by AI
  • Q11. Given an array of integers, find the length of the longest consecutive sub array which forms an AP
  • Ans. 

    Find length of longest consecutive sub array forming an AP from given array of integers.

    • Sort the array in ascending order

    • Iterate through the array and find the longest consecutive sub array forming an AP

    • Use a variable to keep track of the length of the current consecutive sub array forming an AP

    • Use another variable to keep track of the length of the longest consecutive sub array forming an AP seen so far

  • Answered by AI
  • Q12. Given a binary tree, connect all the nodes at the same level. Each node will have a next pointer; you have to make it point to the next node to its right in the same level. If there is no such node, make ...

Interview Preparation Tips

Skills: Algorithm, Data structure
College Name: NA

Skills evaluated in this interview

Contribute & help others!
anonymous
You can choose to be anonymous

Evolent Health International Interview FAQs

How many rounds are there in Evolent Health International Software Developer interview?
Evolent Health International interview process usually has 2 rounds. The most common rounds in the Evolent Health International interview process are Technical.
What are the top questions asked in Evolent Health International Software Developer interview?

Some of the top questions asked at the Evolent Health International Software Developer interview -

  1. Basic to intermediate.net, EF, SQL, C#, ...read more
  2. Deep into.net and ...read more
  3. Basics of .Net C...read more

Recently Viewed

INTERVIEWS

London Stock Exchange Group

No Interviews

CAMPUS PLACEMENT

Dr. APJ Abdul Kalam Women's Institute of Technology

INTERVIEWS

London Stock Exchange Group

5.6k top interview questions

CAMPUS PLACEMENT

Sri Krishna Engineering College, Chennai

INTERVIEWS

London Stock Exchange Group

5.6k top interview questions

INTERVIEWS

London Stock Exchange Group

No Interviews

INTERVIEWS

London Stock Exchange Group

No Interviews

INTERVIEWS

London Stock Exchange Group

No Interviews

INTERVIEWS

Velocity Software Solutions

No Interviews

INTERVIEWS

Velocity Software Solutions

No Interviews

Tell us how to improve this page.

Evolent Health International Software Developer Interview Process

based on 1 interview

Interview experience

1
  
Bad
View more
Evolent Health International Software Developer Salary
based on 16 salaries
₹6 L/yr - ₹16 L/yr
46% more than the average Software Developer Salary in India
View more details

Evolent Health International Software Developer Reviews and Ratings

based on 1 review

4.0/5

Rating in categories

3.0

Skill development

5.0

Work-life balance

5.0

Salary

4.0

Job security

4.0

Company culture

3.0

Promotions

4.0

Work satisfaction

Explore 1 Review and Rating
Analyst
80 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Engineer
70 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Claims Adjudicator
69 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Analyst
64 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Software Engineer
50 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Evolent Health International with

Oracle Cerner

3.7
Compare

McKesson

4.5
Compare

Veradigm

4.0
Compare

Athenahealth Technology

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