Zycus Interview Experience
Question Details
ROUND 1 First round was aptitude round, 10 question in 30 minute. Level of difficulty: easy. For each correct answer 2 marks will be awarded and for each wrong one 1 mark...
Full Details
ROUND 1 First round was aptitude round, 10 question in 30 minute. Level of difficulty: easy. For each correct answer 2 marks will be awarded and for each wrong one 1 marks will be dedicated. They had already announced the cut-off for the
next round, it was 14. I solved 9 all of them where correct. Out of 150+ approx. 70-80 cleared the round 1.
ROUND 2 Written coding round: In this round we have to write code on paper. There were two section (A and B) we have to solve either of the section in 45minute. Section A: https://www.geeksforgeeks.org/dsa/rat-in-a-maze/ Section B: It contain two questions: 1. https://www.geeksforgeeks.org/dsa/two-elements-whose-sum-is-closest-to-zero/ 2. https://www.geeksforgeeks.org/dsa/sort-elements-by-frequency/
ROUND 3 44 were sort listed for the interview. My name was called after waiting for the whole night around 7a.m. Only one interviewer he was very friendly He asked to explain my solution I explained and he looks satisfied. Then he asked me two puzzle. Puzzle 1: You have two candles. Each burn for 60 minutes. How can you measure 45 minutes using this? Puzzle 2: https://en.wikipedia.org/wiki/Bridge_and_torch_problem (data was different) Then he asked me three coding question one by one and also I have to code them on paper. Q1: Two array of size n and n+m. First array is completely filled and sorted, Second array is containing m element in sorted order. Now the question is to sort the second array such that it will contain the element of first array with the following condition. Conditions: 1. 2nd array should remain sorted always. 2. Can’t use any auxiliary array. 3. Can’t use any shorting algorithm (like copy the element in 2nd array then sort it). I solved it in second attempt. Q2: There is an array (1-D) of size 2m containing some random number and there is also a 2-D array of size mm you have to fill the 2-D array in following manner. 1 st represent the first element of 1-D array. Q3: There are two string, first string containing character and two special ( and ) e.g.: qw*ty_bc Second string contain only character e.g.: qwertyabc Now you have to check if the string is valid or not where ‘’ can replace only one character and * can replace more than one character. In above example string is valid. Last question was easy although I missed some edge cases which was pointed by my interviewer. H.R Round: Normal HR talk Thank you G4G. Related Practice Problems Sorting Elements of an Array by Frequency All Practice Problems for Zycus !
About Zycus Interview Reports
This question was reported by a candidate who interviewed at Zycus. LeakCode aggregates interview reports from 10+ sources, including 1Point3Acres, Glassdoor, LeetCode Discuss, Blind, Reddit, Indeed, and Nowcoder. Each report is translated where necessary, deduplicated against existing entries, and tagged by company, role, round type, and reporting date.
Use this question as one calibration data point, not a memorization target. Companies typically rotate their question pools every 2-4 months; the exact wording of a 2024 question may differ from what you encounter today. The underlying pattern, difficulty level, and follow-up depth at Zycus are the higher-signal extractions to take from this report.
For broader preparation context, the Zycus interview process typically includes a recruiter screen, one or two technical phone screens, and a 4-5 round on-site loop covering coding, system design (at L4+ levels), and behavioral. Reports tagged on LeakCode show the round-by-round distribution and typical difficulty calibration. To browse questions filtered by round type and seniority, use the company hub linked above.
How To Practice This Type of Question
Solve similar problems on LeetCode under timed conditions (25-35 minutes per medium difficulty). The goal is pattern recognition: recognize the underlying technique (sliding window, two-pointer, BFS, memoized recursion, etc.) within 60-90 seconds of reading. Strong candidates verbalize their hypothesis out loud before coding, then iterate based on feedback. Weak candidates dive into implementation immediately, lose time on the wrong approach, and run out of time for follow-ups.
Companies update their question pools every 2-4 months. The exact wording of any given question may have been retired by the time you interview. Focus your prep on the pattern, not the specific problem. The patterns that appear in Zycus reports consistently are the ones worth investing in; one-off niche problems are not.
During Your Zycus Round
Apply the standard interview round template: clarify requirements (2-3 minutes), state your approach out loud and confirm direction with the interviewer (3-5 minutes), code with narration (15-25 minutes), test with concrete examples including edge cases (5 minutes), discuss optimization or trade-offs if time permits (5 minutes). This template is universally accepted across FAANG and adjacent companies; deviating from it produces weaker interviewer feedback signal.
The single most predictive failure mode in Zycus reports tagged "no hire": not asking clarifying questions. Interviewers are explicitly trained to weight this. Strong candidates ask 3-5 clarifying questions even on problems that look obvious; weak candidates dive into code immediately. The clarifying-question check is often the first signal recorded in the interviewer's written notes.