SIG (Susquehanna) interview questions

Showing 31–44 of 44 results

• Index a CSV Movie Catalog for Fast Year-Range QueriesEasy

  Design an immutable movie catalog that parses CSV data and supports fast, inclusive year-range queries using binary search or indexing.

  SIG (Susquehanna)Software EngineerSoftware Engineering FundamentalsOnsite
• Infer posterior after losing pickEasy

  This question evaluates a candidate's understanding of conditional probability and posterior inference, assessing the ability to update probability estimates after observing that a chosen option did not occur.

  SIG (Susquehanna)Data ScientistStatistics & MathOnline Assessment
• Probability Limited Stock Covers Every Customer in a QueueMedium

  A binomial probability question about a queue of N customers who each choose one of two products, with only M units of one product left in stock. It asks for the probability that the stock is enough, or exactly enough, for every customer who wants it, testing distribution modeling and the efficient evaluation of tail sums.

  SIG (Susquehanna)Quantitative TraderStatistics & MathOnline Assessment
• Probability Two Randomly Started Flower Bloom Periods OverlapMedium

  A probability question about two flowers that start blooming on random days within a D-day window and stay in bloom for different lengths of time. It asks for the probability that both are in bloom together at some point, testing interval-overlap reasoning, exact counting, and discrete versus continuous modeling.

  SIG (Susquehanna)Quantitative TraderStatistics & MathOnline Assessment
• Probability You Picked the Strongest Cat Given Your Cat Lost the RaceMedium

  A conditional probability puzzle about three cats in a race with known winning probabilities. You cheer for a randomly chosen cat, learn whether it won or lost, and must find the probability that you picked the strongest or the weakest cat, testing Bayes' rule and the choice of conditioning event.

  SIG (Susquehanna)Quantitative TraderStatistics & MathOnline Assessment
• Probability of Reaching a Chip Target Under Bold BettingMedium

  A gambling probability question: starting with A chips and aiming for B, a player uses bold play, staking either all chips or just what is needed to reach the target, and wins each even-money round with probability p. It asks for the probability of reaching the target before going broke, testing recursive state analysis.

  SIG (Susquehanna)Quantitative TraderStatistics & MathOnline Assessment
• Resolve Two Knights-and-Knaves StatementsEasy

  This question tests logical deduction and systematic case analysis under binary truth constraints.

  SIG (Susquehanna)Data ScientistStatistics & MathOnline Assessment
• Rotate a Square Matrix Clockwise While Both Diagonals Stay FixedMedium

  Rotate every element of a square matrix that lies off both diagonals by 90 degrees clockwise a given number of times, leaving the main-diagonal and anti-diagonal values in place. It tests precise index mapping, handling of odd and even matrix sizes, and bug-free simulation under timed assessment conditions.

  SIG (Susquehanna)Software EngineerCoding & AlgorithmsOnline Assessment
• Solve Barn Animal Counts from Total LegsEasy

  Tests setting up and solving a system of linear equations from verbal constraints using substitution to determine integer entity counts.

  SIG (Susquehanna)Data ScientistStatistics & MathOnline Assessment
• Solve animals-and-legs countEasy

  This question evaluates a candidate's ability to translate a word problem into a system of linear equations and perform basic algebraic manipulation and arithmetic to determine unknown quantities.

  SIG (Susquehanna)Data ScientistStatistics & MathOnline Assessment
• Solve relative-truth cat puzzleMedium

  This question evaluates logical deduction, constraint satisfaction, and quantitative manipulation of percentages and averages within a relative truth/lie framework, and is categorized under Statistics & Math and discrete logic puzzles.

  SIG (Susquehanna)Data ScientistStatistics & MathOnline Assessment
• Solve theatre seating and ticker extractionMedium

  This question evaluates algorithmic problem-solving skills across two areas: efficient seat-allocation and interval occupancy reasoning for grouping in a constrained seating layout, and robust string processing with phrase-based, case-insensitive matching and mapping to ticker identifiers.

  SIG (Susquehanna)Software EngineerCoding & AlgorithmsOnsite
• Trees and Binary Search Trees: Taxonomy, Invariant, and Traversal/SearchMedium

  Tests understanding of binary tree taxonomy, global BST invariants versus local parent-child checks, and efficient tree search under range constraints.

  SIG (Susquehanna)Software EngineerSoftware Engineering FundamentalsOnsite
• Use Bayes for factory identificationEasy

  This question evaluates understanding of Bayesian inference and conditional probability by asking for the posterior probability that two observed black widgets originated from a specific factory.

  SIG (Susquehanna)Data ScientistStatistics & MathOnline Assessment