Your invisible AI for any online exam

Online Assessments

HireVue, CodeSignal, Codility, HackerRank — proctored assessments with time pressure. Screen capture reads the problem statement directly from the testing platform.

"Given an array of integers, return indices of the two numbers such that they add up to a specific target." (HackerRank proctored)

Use a hash map. Single pass: for each num, check if (target - num) exists in the map. If yes, return both indices. If no, store num:index. O(n) time, O(n) space.

Multiple Choice Exams

Certification exams, professional licensing, university tests — any MCQ format. AI reads all options via OCR and identifies the correct answer with reasoning.

"Which of the following is NOT a valid HTTP status code? A) 200 B) 301 C) 418 D) 512"

D) 512. 200 = OK, 301 = Moved Permanently, 418 = I'm a Teapot (RFC 2324). 512 is not a standard HTTP status code. The 5xx range goes up to 511 (Network Authentication Required).

Written Answer Exams

Essay-type questions, short answer formats, case study responses. AI generates structured, well-reasoned answers with proper academic framing.

"Explain the trade-offs between microservices and monolithic architecture. (10 marks)"

Microservices: independent deployment, tech diversity, fault isolation, team autonomy. Monolith: simpler debugging, no network latency between services, easier data consistency. Trade-offs: microservices add operational complexity (service discovery, distributed tracing, eventual consistency) but enable horizontal scaling of individual components. Choose monolith for small teams, microservices when org scales beyond 3-4 teams.

Timed Quizzes

Speed matters when you have 60 seconds per question. Screen capture + OCR + AI response in under 95ms gives you the edge on rapid-fire quiz formats.

"What is the time complexity of inserting into a balanced BST?"

O(log n). A balanced BST (AVL/Red-Black) maintains height ~ log n, so insertion traverses at most log n levels, plus O(1) rotations for rebalancing.

Coding Assessments

Screen capture reads the full problem statement, constraints, and examples. AI returns the optimal solution with code, complexity analysis, and edge cases to watch for.

"Implement a function that finds the longest palindromic substring. Constraints: 1 <= s.length <= 1000"

Expand around center approach. For each index, expand outward checking odd and even length palindromes. Track longest found. O(n^2) time, O(1) space. Edge cases: single char (return it), all same chars, empty string.