Sigtuple Interview Experience | Set 1 (On-Campus)
Question Details
Sigtuple (company) came to our campus for placement 2017-2018 .I have experience about process of selection. There are two round .IN FIRST ROUND was online there were 17 ...
Full Details
Sigtuple (company) came to our campus for placement 2017-2018 .I have experience about process of selection. There are two round . IN FIRST ROUND was online there were 17 questions. In which two are coding and 15 are technical . some of them are.. 1 A bag contains (x) one rupee coins and (y) 50 paise coins. One coin is taken from the bag and put away. If a coin is now taken at random from the bag, what is the probability that it is a one rupee coin? Ans x/(x+y) 2 There is 15 boy and 10 girls . you have to chose 3 people for making a team. what is the probability that there are 2 boy 1 girl chosen for a team . Ans 21/46 Others question are from data structure and algorithm. mostly related to time complexity.One question from entrance exam . 3 Three concurrent processes X, Y, and Z execute three different code segments that access and update certain shared variables. Process X executes the P operation (i.e., wait) on semaphores a, b and c; process Y executes the P operation on semaphores b, c and d; process Z executes the P operation on semaphores c, d, and a before entering the respective code segments. After completing the execution of its code segment, each process invokes the V operation (i.e., signal) on its three semaphores. All semaphores are binary semaphores initialized to one. Which one of the following represents a deadlockfree order of invoking the P operations by the processes?(2013) Ans X: P(b)P(a)P(c) Y:P(b)P(c)P(d) Z:P(a)P(c)P(d) Coding questions 1. Find the smallest positive integer value that cannot be represented as sum of any subset of a given array.
Example Input: arr[] = {1, 1, 1, 1}
Output: 5 Input: arr[] = {1, 3, 6, 10, 11, 15}
Output: 2 2. Find the longest sub sequence of dancing array.(dp). Second round is interview..
About This Question
This is a reported interview question from a sigtuple interview for a swe role during the phone screen round reported in 2018.
It covers the following topics: Probability Stats, Sql, Arrays, Dynamic Programming .
About Sigtuple Interview Reports
This question was reported by a candidate who interviewed at Sigtuple. 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 Sigtuple are the higher-signal extractions to take from this report.
For broader preparation context, the Sigtuple 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 Sigtuple reports consistently are the ones worth investing in; one-off niche problems are not.
During Your Sigtuple 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 Sigtuple 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.