Question 1

Number of Divisible Substrings — Amdocs Interview Question

Accepted Answer

"Number of Divisible Substrings" is a medium difficulty problem asked at Amdocs interviews. It covers the following topics: Hash Table, String, Counting, Prefix Sum. You can practice it on LeetCode: https://leetcode.com/problems/number-of-divisible-substrings

Question 2

Design a 3D Binary Matrix with Efficient Layer Tracking — Amdocs Interview Question

Accepted Answer

"Design a 3D Binary Matrix with Efficient Layer Tracking" is a medium difficulty problem asked at Amdocs interviews. It covers the following topics: Array, Hash Table, Design, Heap (Priority Queue), Matrix, Ordered Set. You can practice it on LeetCode: https://leetcode.com/problems/design-a-3d-binary-matrix-with-efficient-layer-tracking

Question 3

Backspace String Compare — Amdocs Interview Question

Accepted Answer

"Backspace String Compare" is a easy difficulty problem asked at Amdocs interviews. It covers the following topics: Two Pointers, String, Stack, Simulation. You can practice it on LeetCode: https://leetcode.com/problems/backspace-string-compare

Question 4

Second Highest Salary — Amdocs Interview Question

Accepted Answer

"Second Highest Salary" is a medium difficulty problem asked at Amdocs interviews. It covers the following topics: Database. You can practice it on LeetCode: https://leetcode.com/problems/second-highest-salary

Question 5

Build Array Where You Can Find The Maximum Exactly K Comparisons — Amdocs Interview Question

Accepted Answer

"Build Array Where You Can Find The Maximum Exactly K Comparisons" is a hard difficulty problem asked at Amdocs interviews. It covers the following topics: Dynamic Programming, Prefix Sum. You can practice it on LeetCode: https://leetcode.com/problems/build-array-where-you-can-find-the-maximum-exactly-k-comparisons

Question 6

Generate Parentheses — Amdocs Interview Question

Accepted Answer

"Generate Parentheses" is a medium difficulty problem asked at Amdocs interviews. It covers the following topics: String, Dynamic Programming, Backtracking. You can practice it on LeetCode: https://leetcode.com/problems/generate-parentheses

#	Question Title	Difficulty	Frequency	Topics
1	Number of Divisible Substrings	MEDIUM	100.0	Hash TableStringCounting+1
2	Design a 3D Binary Matrix with Efficient Layer Tracking	MEDIUM	100.0	ArrayHash TableDesign+3
3	Backspace String Compare	EASY	63.4	Two PointersStringStack+1
4	Second Highest Salary	MEDIUM	63.4	Database
5	Build Array Where You Can Find The Maximum Exactly K Comparisons	HARD	63.4	Dynamic ProgrammingPrefix Sum
6	Generate Parentheses	MEDIUM	63.4	StringDynamic ProgrammingBacktracking
7	Rotate String	EASY	63.4	StringString Matching

Explore 450+ Companies

Companies

Amdocs

Amdocs Interview Questions

Ai Assistant Kas

Explore 450+ Companies

Companies

AA CompaniesBrowse companies

BB CompaniesBrowse companies

CC CompaniesBrowse companies

DD CompaniesBrowse companies

EE CompaniesBrowse companies

FF CompaniesBrowse companies

GG CompaniesBrowse companies

HH CompaniesBrowse companies

II CompaniesBrowse companies

JJ CompaniesBrowse companies

KK CompaniesBrowse companies

LL CompaniesBrowse companies

MM CompaniesBrowse companies

NN CompaniesBrowse companies

OO CompaniesBrowse companies

PP CompaniesBrowse companies

QQ CompaniesBrowse companies

RR CompaniesBrowse companies

SS CompaniesBrowse companies

TT CompaniesBrowse companies

UU CompaniesBrowse companies

VV CompaniesBrowse companies

WW CompaniesBrowse companies

XX CompaniesBrowse companies

YY CompaniesBrowse companies

ZZ CompaniesBrowse companies

Amdocs

Amdocs Interview Questions

Ai Assistant Kas