Nykaa 2024 aptitude
Quantitative, reasoning, and verbal drills with solutions
Nykaa Placement Papers 2024
Overview
This page collects Nykaa placement papers from 2024 with practice questions, worked solutions, and the exam pattern students reported that cycle. Use it when you want drive history: what the first round looked like, which topics repeated, and how to approach solutions. Work the sets below under a timer, then compare with newer material so your prep matches both established Nykaa patterns and recent shifts.
Download / jump links
Nykaa 2024 coding
DSA practice aligned to Nykaa online assessments
Nykaa interview experience
Round structure and tips from student reports
Nykaa prep guide
Study plan and weekly schedule
Nykaa Aptitude Mock Quiz
Timed placement-style MCQs with score and explanations after you submit. Use it to check speed and accuracy before the real test.
Questions15
Time10 min
Quantitative
Five friends A, B, C, D, E are sitting in a row. A is not at either end. B is to the right of A. C is between A and D. Who is sitting at the rightmost position?
Correct answer: B
Verbal
Problem: Choose the correct sentence: a) Neither the students nor the teacher were present b) Neither the students nor the teacher was present c) Neither the students or the teacher was present
With "neither...nor", the verb agrees with the subject closer to it. "Teacher" is singular, so "was" is correct.
Reasoning
If BOOK is coded as 43 (sum of letter positions), PEN is coded as:
P+E+N = 16+5+14 = 35.
Reasoning
Statement: "Use our product for better results."
Both assumptions are implicit in the statement
Quantitative
CP = ₹800, SP = ₹920. Profit %:
Profit 120 on 800 = 15%.
Quantitative
A and B can complete a work in 12 days; B and C in 15 days; A and C in 20 days. How long will A, B, and C together take to complete the work?
(A+B)'s 1 day work = 1/12 (B+C)'s 1 day work = 1/15 (A+C)'s 1 day work = 1/20 Adding: 2(A+B+C)'s 1 day work = 1/12 + 1/15 + 1/20 = (5+4+3)/60 = 12/60 = 1/5 (A+B+C)'s 1 day work = 1/10 Time taken = 10 days
Quantitative
If the sum of three consecutive integers is 72, what is the smallest of these integers?
Let the integers be x, x+1, and x+2. x + (x + 1) + (x + 2) = 72 3x + 3 = 72 3x = 69 x = 23 Therefore, the integers are 23, 24, and 25.
Reasoning
Find the missing number: 5, 11, 23, 47, 95, ?
Correct answer: 191
Reasoning
In a row of 40 students, A is 11th from left and B is 31st from right. How many between A and B?
B from left = 40−31+1 = 10th. A is 11th. They are adjacent → 0 between.
Verbal
Problem: Find the synonym of "ABUNDANT": a) Scarce b) Plentiful c) Limited d) Rare
Abundant means existing in large quantities, so "Plentiful" is the synonym.
Quantitative
A train 120 m long crosses a pole in 8 s. Speed in km/h:
Speed = 120/8 = 15 m/s = 54 km/h.
Verbal
A person who loves books is a:
Correct term: Bibliophile.
Reasoning
If RED is 27 and BLUE is 40 (sum of positions), GREEN is:
G+R+E+E+N = 7+18+5+5+14 = 49.
Verbal
Problem: Choose the correct sentence: a) The data are incorrect b) The data is incorrect c) The datas are incorrect
"Data" can be singular or plural, but in modern usage, it's often treated as singular. "The data is incorrect" is more commonly accepted.
Quantitative
Water tax is increased by 20% but its consumption is decreased by 20%. The increase or decrease in the expenditure is:
Correct answer: 4% decrease
Your score
0/15(0%)
Review
Nykaa exam pattern 2024
| Section | What shows up | Prep focus |
|---|---|---|
| Online assessment | Coding and/or MCQ filter | Weekly timed mocks |
| Technical rounds | DSA, CS fundamentals, projects | Live problem solving |
| HR / hiring manager | Motivation and communication | Specific, evidence-based answers |
First round: Nykaa Online Assessment
Skills emphasized: DSA, ecommerce systems
Languages: Java, Python, JavaScript
Sample Nykaa questions with solutions
These are practice-style questions aligned to patterns students report for Nykaa drives around 2024. They are not leaked live papers. Work them timed, then read the solutions only after you have an answer.
Quantitative aptitude (2024)
Q1: Pipe fill
Problem: Pipe A fills a tank in 6 hours and pipe B in 8 hours. How long do they take together to fill it?
Solution: Combined rate = 1/6 + 1/8 = 4/24 + 3/24 = 7/24. Time = 24/7 hours ≈ 3 hours 26 minutes.
Answer: 24/7 hours
Q2: Simple interest
Problem: Find the simple interest on ₹8000 at 10% per annum for 2 years.
Solution: SI = (P × R × T) / 100 = (8000 × 10 × 2) / 100 = ₹1600.
Answer: ₹1600
Q3: Percentage recover
Problem: If 30% of a number is 150, what is the number?
Solution: 0.3x = 150 → x = 150 / 0.3 = 500.
Answer: 500
Q4: Average after replace
Problem: The average of five numbers is 20. One number 30 is replaced by 10. What is the new average?
Solution: Old sum = 5 × 20 = 100. New sum = 100 − 30 + 10 = 80. New average = 80 / 5 = 16.
Answer: 16
Q5: Series n(n+1)
Problem: Find the next term: 2, 6, 12, 20, 30, ?
Solution: Pattern: 1×2, 2×3, 3×4, 4×5, 5×6, 6×7. Next = 6 × 7 = 42.
Answer: 42
Q6: Deck probability
Problem: What is the probability of drawing an ace from a standard 52-card deck?
Solution: There are 4 aces in 52 cards. Probability = 4/52 = 1/13.
Answer: 1/13
Q7: Net percent change
Problem: A number is increased by 20% and then decreased by 20%. What is the net percentage change?
Solution: Start with 100 → 120 → 96. Net change = 4% decrease. Formula: successive +a then −a gives −(a²/100)% = −4%.
Answer: 4% decrease
Q8: Consumption cut
Problem: If the price of an item rises by 25%, by what percent should consumption fall so that expenditure stays the same?
Solution: Required reduction = r/(100+r) × 100 with r = 25. = 25/125 × 100 = 20%.
Answer: 20%
Coding practice (2024)
Coding Q1: Longest substring without repeating characters
Problem: Given a string s, find the length of the longest substring without repeating characters. Example: ‘abcabcbb’ → 3 (‘abc’).
Approach: Sliding window with a map (or last-seen index) of characters. Expand the right pointer; when a duplicate appears inside the window, move the left pointer past the previous occurrence.
Complexity: O(n) time
Nykaa tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.
Coding Q2: Merge overlapping intervals
Problem: Given a list of intervals [start, end], merge all overlapping intervals and return the non-overlapping set that covers the same ranges.
Approach: Sort by start time. Walk once, merging into the last interval in the result when the next start is ≤ current end; otherwise append a new interval.
Complexity: O(n log n) time from the sort
Nykaa tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.
Coding Q3: Top K frequent elements
Problem: Given an integer array and an integer k, return the k most frequent elements. Order among equals can be arbitrary unless the problem says otherwise.
Approach: Count frequencies with a hash map, then use a heap of size k (or bucket sort by frequency) to extract the top k keys.
Complexity: O(n log k) with a heap
Nykaa tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.
Coding Q4: Linked list cycle
Problem: Given the head of a linked list, return true if there is a cycle and false otherwise.
Approach: Floyd’s tortoise and hare: move one pointer one step and another two steps. If they meet, a cycle exists. If the fast pointer hits null, there is no cycle.
Complexity: O(n) time, O(1) space
Nykaa tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.
Coding Q5: Binary tree level order
Problem: Given the root of a binary tree, return the level-order traversal (breadth-first) as a list of levels.
Approach: Use a queue. For each level, drain the current queue size, collect values, and enqueue children for the next level.
Complexity: O(n) time, O(n) space
Nykaa tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.
Coding Q6: Coin change (min coins)
Problem: Given coin denominations and an amount, return the fewest coins needed to make that amount, or -1 if it is impossible.
Approach: Unbounded knapsack DP: let dp[x] be the minimum coins for amount x. For each coin, update dp[c..amount]. Initialize dp[0] = 0 and the rest to a large sentinel.
Complexity: O(amount × coins)
Nykaa tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.
Coding Q7: Binary search
Problem: Given a sorted array of distinct integers and a target, return the index of target or -1 if missing.
Approach: Maintain lo/hi. Compare mid with target and shrink the half that cannot contain it. Careful with overflow-free mid and empty arrays.
Complexity: O(log n) time
Nykaa tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.
Coding Q8: Move zeros
Problem: Move all zeros in an array to the end while keeping the relative order of non-zero elements.
Approach: Two pointers: write non-zeros toward the front, then fill the remainder with zeros. Or swap zeros as you scan.
Complexity: O(n) time, O(1) space
Nykaa tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.
Deep prep notes for Nykaa
How the Nykaa Online Assessment usually feels
Students usually say the first round is time-tight - easy marks vanish if you sit too long on one hard question. For Nykaa, skim the paper in a couple of minutes, mark what you can finish cleanly, and protect accuracy. Languages people commonly use: Java, Python, JavaScript.
Topic weight hints
| Area | Why it matters at Nykaa |
|---|---|
| DSA | What usually helps you clear the first round |
| Core CS (OOPs / DBMS / OS) | Technical interview depth |
| Beauty & Fashion Ecommerce awareness | Helps in managerial / HR conversations |
| Communication | Explain your approach clearly; keep a few real examples ready for HR |
14-Day sprint
- Days 1-3: Learn the 2024 pattern and take two sectional mocks
- Days 4-7: Closed practice on weak topics from your error log
- Days 8-10: Full mocks every other day; review the same day
- Days 11-14: Practice explaining projects out loud, light revision, sleep and IDs ready