Wipro does not publish a Turbo-specific syllabus; the aptitude and essay topics are those of Elite NTH, and the coding problems come from the same pool — but Turbo shortlists are built from the top of that pool. Prepare the standard list below, then go deeper on the coding topics marked as Turbo emphasis.
Quantitative Ability (16 questions)
Number system, LCM & HCF, divisibility, percentages, profit & loss, simple & compound interest, ratio & proportion, ages, averages, mixtures, time & work, pipes & cisterns, time–speed–distance (trains, boats, circular tracks), permutations & combinations, probability, algebra, mensuration and data interpretation.
Logical Reasoning (14 questions)
Number and letter series (including "find the wrong number"), coding–decoding, blood relations, direction sense, seating and linear arrangements, syllogisms, statement–assumption and statement–conclusion, data sufficiency, analogies, and visual / pattern puzzles.
Verbal Ability (18 questions)
Reading comprehension, synonyms and antonyms, sentence completion, error identification, sentence rearrangement (para-jumbles), active / passive voice, direct / indirect speech, articles and prepositions, idioms and phrasal verbs.
Written Communication (1 essay)
200–400 words on a general or current-affairs prompt (social media, education in India, GST, work from home, AI in the workplace). Intro–pros–cons–conclusion structure, under five grammar or spelling errors. Topics and a scoring guide are on the WriteX page.
Coding (2 problems) — with Turbo emphasis
| Topic | Typical problems | Turbo emphasis |
|---|---|---|
| Arrays & hashing | Two sum, missing number, majority element, counting pairs | Hash-map O(n) instead of nested loops |
| Strings | Longest substring without repeats, anagram grouping, longest common prefix, backspace compare | Sliding window, two pointers, frequency arrays |
| Stacks & queues | Valid parentheses, next greater element | Monotonic stack, amortised O(n) reasoning |
| Searching & sorting | Binary search, count inversions | Merge-sort based counting, O(n log n) |
| DP-lite & greedy | Maximum subarray sum (Kadane), counting valleys, sock merchant | Single-pass state, clear base cases |
| Maths | GCD / LCM, primes, palindromes, Pascal's triangle, factorial | Euclid, sieve, 64-bit overflow awareness |
| Linked lists & trees | Cycle detection, lowest common ancestor | Appear rarely in the OA; expect them in the business discussion |
Everything in the aptitude and essay columns is covered, with Elite-level practice sets, on the Wipro Elite syllabus page. The Turbo pages add a separate, non-overlapping question set.