Ernst & Young (EY) interview experience Real time questions & tips from candidates to crack your interview
SDE - 1
Ernst & Young (EY)
2 rounds | 3 Coding
problems
Selected Interview preparation journey
Preparation
Duration: 1.5 months
Topics: DS , OOPS , programming language , DBMS , OS
Tip 1 : Be confident at one Language
Tip 2 : Should be strong technical concepts
Application process
Where: Campus
Eligibility: 7 cgpa throughout
Tip 1 : It should be of one page
Tip 2 : Don't put fake things
Interview rounds
01
Round
Easy
Video Call
Duration50 minutes
Interview date1 Jul 2021
Coding problem2
This round is purely technical , Interviewer asked me questions regarding my core technical subjects.
1. Frequency In A Sorted Array
Easy
15m average time
85% success
0/40
Asked in companies
You are given a sorted array 'ARR' and a number 'X'. Your task is to count the number of occurrences of 'X' in 'ARR'.
Note :
1. If 'X' is not found in the array, return 0.
2. The given array is sorted in non-decreasing order.
Problem approach
Tip 1 : Apply linear approach for this problem
Tip 2 : Do more array problems to result a grip on these problems
2. Bubble Sort
Easy
10m average time
90% success
0/40
Asked in companies
Bubble Sort is one of the sorting algorithms that works by repeatedly swapping the adjacent elements of the array if they are not in sorted order.
You are given an unsorted array consisting of N non-negative integers. Your task is to sort the array in non-decreasing order using the Bubble Sort algorithm.
For Example:
Bubble Sort implementation for the given array: {6,2,8,4,10} is shown below :-
Problem approach
Tip 1 : Divide by finding the number of the position midway between and . Do this step the same way we found the midpoint in binary search: add and , divide by 2, and round down.
Tip 2 : Conquer by recursively sorting the subarrays in each of the two subproblems created by the divide step. That is, recursively sort the subarray array[p..q] and recursively sort the subarray array[q+1..r].
Tip 3 : Combine by merging the two sorted subarrays back into the single sorted subarray array[p..r].
02
Round
Easy
HR Round
Duration15 minutes
Interview date4 Jul 2021
Coding problem1
1. Basic HR Questions
Introduce yourself.
Why should we hire you?
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
How do you remove whitespace from the start of a string?
Choose another skill to practice
Similar interview experiences
SDE - 1
3 rounds | 3 problems
Interviewed by Ernst & Young (EY)
Selected 
2674 views
0 comments
0 upvotes
SDE - 1
3 rounds | 5 problems
Interviewed by Ernst & Young (EY)
Selected 1250 views
0 comments
0 upvotes
SDE - 1
3 rounds | 5 problems
Interviewed by Ernst & Young (EY)
Selected 1204 views
0 comments
0 upvotes
SDE - 1
3 rounds | 6 problems
Interviewed by Ernst & Young (EY)
Selected 2507 views
0 comments
0 upvotes
Companies with similar interview experiences
SDE - 1
2 rounds | 3 problems
Interviewed by BNY Mellon
Selected 6366 views
3 comments
0 upvotes
SDE - 1
3 rounds | 6 problems
Interviewed by BNY Mellon
Selected 0 views
0 comments
0 upvotes
SDE - 1
3 rounds | 5 problems
Interviewed by CIS - Cyber Infrastructure
Selected 2198 views
0 comments
0 upvotes