Online Assessment Strategy
OA Format
Most OAs have 2-4 sections:
- Coding (60-90 min): 2-4 problems, easy to hard
- MCQs (15-30 min): CS fundamentals, aptitude, output prediction
- Debugging (15-30 min): Find and fix bugs in given code
- SQL (15-30 min): Write queries (some companies)
Coding Round Strategy
Time Management (3-problem OA, 75 min)
- Read all problems first (5 min)
- Problem 1 (easy): 15 min — get it right, this is free points
- Problem 2 (medium): 25 min — most impactful
- Problem 3 (hard): 25 min — partial credit possible
- Review: 5 min — check edge cases
Problem-Solving Approach
- Read carefully: Note constraints, input format, edge cases
- Think of brute force: State it, then optimize
- Plan before coding: Data structure + algorithm
- Code cleanly: Readable variable names, comments
- Test: Sample cases + edge cases (empty, single, max)
Common OA Patterns
| Pattern | Frequency | Key Insight |
|---|---|---|
| Arrays/Strings | Very common | Two pointers, sliding window |
| HashMap | Very common | Counting, lookup |
| BFS/DFS | Common | Graph traversal |
| DP | Common | Optimal substructure |
| Sorting + Greedy | Common | Sort first, then greedy |
| Binary Search | Medium | On answer space |
MCQ Strategy
- CS Fundamentals: OS (processes, threads, scheduling), DBMS (SQL, normalization), Networks (TCP/IP, HTTP)
- Aptitude: Percentages, ratios, probability, logical reasoning
- Output Prediction: Trace through code carefully
- Time: ~1 min per question, skip and return to hard ones
Common Platforms
| Platform | Tips |
|---|---|
| HackerRank | Read problem statements carefully, edge cases matter |
| CodeSignal | Arcade mode practice, time management crucial |
| HackerEarth | Similar to HackerRank, practice previous contests |
| AMCAT | Adaptive testing, can’t go back to previous questions |
| Mettl | Mixed format, read instructions carefully |
Practice Strategy
- LeetCode: 150-200 problems (Easy 30%, Medium 60%, Hard 10%)
- Company-specific: LeetCode tagged problems
- Timed practice: Simulate OA conditions
- Mock tests: Use platform mock tests
- Review: After each practice, review optimal solutions
Interview Questions
Q: How do you approach a problem you’ve never seen before? A: (1) Identify the pattern (array? graph? string?), (2) think of similar problems I’ve solved, (3) start with brute force, (4) identify the bottleneck, (5) consider better data structures (hash map, heap, stack), (6) test with examples.
Q: How do you handle time pressure in OAs? A: (1) Read all problems first, (2) start with the easiest, (3) don’t get stuck > 10 min on one problem, (4) get partial credit (brute force > no solution), (5) leave time for testing edge cases.