A

Amdocs

7 questions tracked5 with solutions
πŸ”
Frequency scoreSorted highest β†’ lowest frequencyβœ“ Our Solution = we have a detailed walkthrough

Showing 7 of 7 questions

1
MediumNumber of Divisible Substrings
100
Hash TableStringCountingPrefix Sum
2
MediumDesign a 3D Binary Matrix with Efficient Layer Tracking
100
ArrayHash TableDesignHeap (Priority Queue)+2
3
EasyBackspace String Compareβœ“ Our Solution
63
Two PointersStringStackSimulation
4
MediumSecond Highest Salaryβœ“ Our Solution
63
Database
5
HardBuild Array Where You Can Find The Maximum Exactly K Comparisonsβœ“ Our Solution
63
Dynamic ProgrammingPrefix Sum
6
MediumGenerate Parenthesesβœ“ Our Solution
63
StringDynamic ProgrammingBacktracking
7
EasyRotate Stringβœ“ Our Solution
63
StringString Matching