Keyboard shortcuts

Press or to navigate between chapters

Press S or / to search in the book

Press ? to show this help

Press Esc to hide this help

Coding Assessments

Online coding assessments (OAs) are the first technical filter for most companies. Performing well here determines whether you reach the interview stage.

Major Platforms

PlatformUsed ByFormatTime Limit
HackerRankGoldman Sachs, Cisco, Dell2-4 coding problems60-120 min
CodeSignalMeta, Uber, Zoom2-4 problems (GCA/general)70-120 min
LeetCodeVarious (via hiring modules)1-4 problemsVaries
CodilitySamsung, HP, Cerner2-3 problems60-90 min
HackerEarthIndian startups, service companies2-4 problems60-120 min

Common Question Types

CategoryFrequencyExamples
Arrays/StringsVery HighTwo pointers, sliding window, subarrays
Hash MapsVery HighFrequency counting, anagrams, complements
Trees/GraphsHighTraversals, BFS/DFS, LCA
Dynamic ProgrammingMediumKnapsack variants, LCS, edit distance
Math/LogicMediumNumber theory, bit manipulation
SQL (for data roles)MediumJoins, aggregations, window functions

Assessment Strategies

Before the Assessment

  • Verify the allowed languages and IDE restrictions.
  • Practice on the specific platform to learn its interface.
  • Prepare a local template with common imports and utility functions.

During the Assessment

  1. Read all problems first and solve the easiest to secure partial points.
  2. Start with brute force, then optimize. Partial credit is common.
  3. Test edge cases — empty input, single element, duplicates, negative numbers.
  4. Manage time — spend no more than 25 minutes per problem before moving on.

Time Allocation (4 problems, 90 min)

ProblemSuggested TimeTarget
Easiest15 minFull solution
Easy-Medium20 minFull solution
Medium25 minOptimize or partial
Hard30 minBrute force or partial

Anti-Cheat Measures

Companies employ several measures to ensure fairness:

MeasureDescription
Tab/window monitoringDetects switching tabs or applications
Copy-paste detectionFlags pasted code from external sources
Webcam proctoringRecords video during the assessment
Question variationEach candidate gets slightly different problems
Plagiarism detectionCompares submissions across candidates

Practice Plan

WeekFocusProblems
1Arrays, strings, hash maps30
2Linked lists, stacks, queues20
3Trees, BST, graphs BFS/DFS25
4Dynamic programming basics20
5Mock assessments on platform3-4 full tests

Interview Tips

  • Don’t panic if you can’t solve the hardest problem — most candidates can’t.
  • Write clean, readable code; automated reviews penalize messy submissions.
  • If stuck, implement brute force and move on — partial credit adds up.
  • Practice typing speed; slow typing costs points on timed assessments.

Cross-references