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

# SDE - 1

Amdocs
2 rounds | 3 Coding problems

## Interview preparation journey

Journey
I started my journey from a government school were i was first introduce with the computer when i was at my 11 th standard now i am a software developer.
Application story
This company visited our campus for hiring their only i applied for the same it has many round starting with online assessment at the starting.
Why selected/rejected for the role?
I was not able to provide all the answers upto the points and hence i am not able to get through the interview .
Preparation
Duration: 4 months
Topics: Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming
Tip

Tip 1 : Mention some good projects on resume
Tip 2 : Be confident
Tip 3 : Good with computer science basics and ds and algo

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

Tip 1 : Good Projects
Tip 2 : Having some achievements is plus point

## Interview rounds

01
Round
Easy
Video Call
Duration45 mins
Interview date22 Oct 2022
Coding problem2

### 1. All Prime Numbers less than or equal to N

Moderate
10m average time
90% success
0/80

#### Note:

``1) A prime numb...``
View more
Problem approach

Given an integer N, print all the prime numbers that lie in the range 2 to N (both inclusive).
Print the prime numbers in different lines.

### 2. Most Frequent Word

Easy
15m average time
85% success
0/40

#### You are given two strings 'A' and 'B' of words. Your task is to find out the most frequent and lexicographically smallest word in string 'A', which is not...

View more
Problem approach

You are given two strings 'A' and 'B' of words. Your task is to find out the most frequent and lexicographically smallest word in string 'A', which is not present in string 'B'. If no such word is present in 'A', then return -1.

02
Round
Medium
Video Call
Duration45 mins
Interview date22 Oct 2022
Coding problem1

### 1. Find all occurrences

Moderate
35m average time
60% success
0/80

#### You are given a 'M' x 'N' matrix of characters, 'CHARACTER_MAT...

View more
Problem approach

You are given a 'M' x 'N' matrix of characters, 'CHARACTER_MATRIX' and a string 'WORD'. Your task is to find and print all occurrences of the string in the given character matrix. You are allowed to search the string in all eight possible directions, i.e. North, South, East, West, North-East, North-West, South-East, South-West.
Note: There should not be any cycle in the output path. The enti...

View more

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

What is the result of 4 % 2?

Start a Discussion
Similar interview experiences
SDE - 1
3 rounds | 4 problems
Interviewed by Amdocs
1434 views
SDE - 1
1 rounds | 2 problems
Interviewed by Amdocs
887 views
SDE - 1
3 rounds | 4 problems
Interviewed by Amdocs
1072 views
SDE - 1
3 rounds | 5 problems
Interviewed by Amdocs
744 views
Companies with similar interview experiences
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
103832 views
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
49225 views
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
30722 views