Amdocs interview experience Real time questions & tips from candidates to crack your interview

SDE - 1

Amdocs
upvote
share-icon
1 rounds | 2 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 3 months
Topics: Data Structures, Algorithms, Dynamic Programming, OOPS, DBMS
Tip
Tip

Tip 1 : You should be very fluent in each and every data structure that you have studied so that you are able to answer even the trickiest question by knowing the basics. This will happen only if you have tried enough questions on different platforms.
Tip 2 : Object Oriented Programming is the easiest and the most underrated concept. In every interview I have given so far, they have asked me the OOPs concepts. I have learnt and understood each and every basic concept of OOPs, primarily from the videos of Coding Ninjas which have polished my skill in this area and now I can answer any question of this topic. 
Tip 3 : The projects that you have done in your college life should be on your tips. You should know each and every little detail of it, and sometimes the interviewer may also ask what would happen if you changed some things in your project, so you should be clear with it's working and how would your project work after changing some specifications.

Application process
Where: Campus
Eligibility: 6 CGPA
Resume Tip
Resume tip

Tip 1 : Highlight your technical skills and write only the things from which you will be comfortable answering from.
Tip 2 : Try to maximize the number of technical achievements on the resume and minimize the extra curricular part.

Interview rounds

01
Round
Medium
Online Coding Interview
Duration120 minutes
Interview date1 Oct 2020
Coding problem2

Timing was in the afternoon. 
The platform was easy to operate and worked on considerable speed. 
Both the webcam and audio was supposed to be ON during the test duration.
We could switch between the questions of the same section in case we wanted to change the answers.

1. Maximum Points On Straight Line

Hard
10m average time
90% success
0/120
Asked in companies
UberAdobeApple

You are given a 2-D plane, and some 'N' integer coordinates in the form of (X, Y), where 'X' is the x-coordinate and 'Y' is the y-coordinate, all of which lie on that plane. You need to find the maximum number of coordinates among these which can form a straight line.

Note:
1. All the coordinates are integer coordinates.
2. There can be two identical coordinates.
Try solving now

2. Minimum Spanning Tree

Moderate
34m average time
0/80
Asked in companies
AmazonWells FargoMicrosoft

You are given an undirected, connected and weighted graph G(V, E), consisting of V number of vertices (numbered from 0 to V-1) and E number of edges.

Find and print the total weight of the Minimum Spanning Tree (MST) using Kruskal's algorithm.

By definition, a minimum weight spanning tree is a subset of the edges of a connected, edge-weighted undirected graph that connects all the vertices together, without any cycles and with the minimum possible total edge weight.

Try solving now

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 select an element by class name in CSS?

Choose another skill to practice
Similar interview experiences
company logo
SDE - 1
3 rounds | 4 problems
Interviewed by Amdocs
1733 views
0 comments
0 upvotes
company logo
SDE - 1
2 rounds | 3 problems
Interviewed by Amdocs
1092 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 4 problems
Interviewed by Amdocs
1448 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 5 problems
Interviewed by Amdocs
1041 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
109753 views
24 comments
0 upvotes
company logo
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
53699 views
5 comments
0 upvotes
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
32963 views
6 comments
0 upvotes