Verizon Data Services India interview experience Real time questions & tips from candidates to crack your interview
SDE - 2
Verizon Data Services India
3 rounds | 5 Coding
problems
Selected Interview preparation journey
Preparation
Duration: 2 months
Topics: Data Structure and Algorithm, Object-oriented programming, Computer networks, System Design, Operating systems , DBMS
Tip 1 : Make you Data Structure and algorithms , Problem solving strong ( use to do some dsa problems on code studio and leetcode daily.
Tip 2 : Practiced Quality questions and mostly asked questions list available on codestudio( used company tags and topic tags) as quality matters more than quantity of questions .
Tip 3 : Give mock interviews, this really helped me as it gives you clearity and builds confidence.
Tip 4 : Read respective company’s interview experiences available on codestudio and other websites before going to actual interview, as this gives you idea about level of interviews and you can prepare beforehand.
Tip 5 : after solving dsa problem .Try to look in discussion section too as you can get more optimised or more efficient approach used by others to solve the problem.
Tip 6 : Prepare important concepts from Operating system,DBMS,System design too as that might also be asked.
Tip 7 : Do atleast 2 quality projects.
Not a Tip But : Lot of quality content available online, whenever felt like stuck with some concepts take help from senior or colleagues ( I use to watch coding ninja shorts by parikh jain whenever felt demotivated or stuck with concepts)
Application process
Where: Linkedin
Eligibility: 1+Years of experience and expertise in java
Tip 1 : Have a concise resume , don't fill your resume with unnecessary details like your address, relationship status etc.
Tip 2 : Resume should not be more than 2 pages( try to make it very concise in 1 page)
Interview rounds
01
Round
Medium
Video Call
Duration40 Minutes
Interview date2 Dec 2021
Coding problem2
It was more based on DSA,Projects and java
1. Longest Consecutive Sequence
Moderate
40m average time
70% success
0/80
Asked in companies
You are given an unsorted array/list 'ARR' of 'N' integers. Your task is to return the length of the longest consecutive sequence.
The consecutive sequence is in the form ['NUM', 'NUM' + 1, 'NUM' + 2, ..., 'NUM' + L] where 'NUM' is the starting integer of the sequence and 'L' + 1 is the length of the sequence.
Note:
If there are any duplicates in the given array we will count only one of them in the consecutive sequence.
For example-
For the given 'ARR' [9,5,4,9,10,10,6].
Output = 3
The longest consecutive sequence is [4,5,6].
Follow Up:
Can you solve this in O(N) time and O(N) space complexity?
Problem approach
You may start with slower approach like brute force- We can simply sort the array and run a for loop to find the longest consecutive sequence.) but I used hashing directly to save time. We will first push all the elements in the HashSet. Then we will run a for loop and check for any number(x) if it is the starting number of the consecutive sequence by checking if the HashSet contains (x-1) or not. If ‘x’ is the starting number of the consecutive sequence we will keep searching for the numbers y = x+1, x+2, x+3, ….. And stop at the first ‘y’ which is not present in the HashSet. Using this we can calculate the length of the longest consecutive subsequence.
2. Java based Questions
Garbage collectors in Java. Java 8 new features ( functional interface, stream API). Asked me to write code using Java 8 features to find the highest salaried employee from each department in the office. Discussed basic OOPS concepts. Exception handling hierarchy. Serialization in java, Interface vs abstract classes and use cases. Moved to spring boot architecture and spring vs spring boot, Deadlocks and its prevention.
Problem approach
revise basic concepts in java. Get yourself aware of the tech stacks you have used.
02
Round
Medium
Video Call
Duration55 Minutes
Interview date2 Dec 2021
Coding problem2
Managerial round
1. Puzzle
There are 25 horses among which you need to find out the fastest 3 horses. You can conduct race among at most 5 to find out their relative speed. At no point you can find out the actual speed of the horse in a race. Find out the minimum no. of races which are required to get the top 3 horses.
Ans.7
Problem approach
Tip 1 : Think out loud.
Tip 2 : Ask interview if you have doubts.
2. System Design Question
Explain SOLID principles. Asked about my current projects and my role (spring boot questions like dependency injection, circular dependency and resolution).I was asked to design a parking lot system taking care of solid principles ( had less time left just a discussed an overview).
Problem approach
Tip 1 : If you get stuck somewhere ask interviewer.
Tip 2 : Think out loud.
03
Round
Easy
HR Round
Duration15 Minutes
Interview date6 Dec 2021
Coding problem1
telephonic
1. Basic HR questions
Asked about my introduction, why Verizon? Past experiences.
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
What is recursion?
Choose another skill to practice
Similar interview experiences
SDE - 1
3 rounds | 3 problems
Interviewed by Verizon Data Services India
Selected 
1272 views
0 comments
0 upvotes
SDE - 1
4 rounds | 8 problems
Interviewed by Amazon
Selected 8518 views
0 comments
0 upvotes
SDE - Intern
1 rounds | 3 problems
Interviewed by Amazon
Selected 3320 views
0 comments
0 upvotes
SDE - 2
4 rounds | 6 problems
Interviewed by Expedia Group
Selected 2581 views
0 comments
0 upvotes
Companies with similar interview experiences
SDE - 2
5 rounds | 12 problems
Interviewed by Walmart
Selected 29570 views
8 comments
0 upvotes
SDE - 2
3 rounds | 4 problems
Interviewed by HashedIn
Selected 9584 views
0 comments
0 upvotes
SDE - 2
3 rounds | 5 problems
Interviewed by Amazon
Rejected
6678 views
1 comments
0 upvotes