Katkat

practice a little every day, paws crossed ♡

Interview Questions

Practice 9403 coding, system design and machine learning questions from 546 companies, sorted by role, topic and interview round. Every question has step-by-step hints, a code runner that supports 8 languages and an AI mentor; members also get the full solution walkthrough.

9403
Questions
546
Companies
11
Topics
8
Languages

Showing 631–660 of 781 results

  • SIG (Susquehanna)MediumData Scientist
    Find probability of overlapping blooms

    This question evaluates understanding of probability theory, specifically reasoning about continuous uniform distributions, geometric probability, and the likelihood of overlap between random time intervals within a fixed horizon.

    Statistics & MathOnline Assessment
  • SIG (Susquehanna)EasyData Scientist
    Find the Expected Number of Consecutive Chosen Pairs

    Calculate the expected number of consecutive pairs in a uniformly chosen subset of integers using indicator variables and linearity of expectation.

    Statistics & MathOnline Assessmentprobabilitycombinatoricsexpected-value
  • SIG (Susquehanna)EasyData Scientist
    Find the Probability Two Muffins Are Sufficient

    This problem tests binomial probability distributions and the cumulative probability of independent discrete events.

    Statistics & MathOnline AssessmentProbabilityBinomial DistributionStatistics
  • SIG (Susquehanna)EasyData Scientist
    Find the Success Probability of Bold Betting

    Calculate the chance of reaching five tokens before ruin under a bold, state-dependent betting rule. The solution enumerates the transitions, sets absorbing boundaries, solves the four-state recurrence for win probability one-third, and obtains 15/77 from an initial fortune of two.

    Statistics & MathOnline Assessment
  • SIG (Susquehanna)EasyData Scientist
    Infer posterior after losing pick

    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.

    Statistics & MathOnline Assessment
  • SIG (Susquehanna)MediumQuantitative Trader
    Probability Limited Stock Covers Every Customer in a Queue

    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.

    Statistics & MathOnline Assessment
  • SIG (Susquehanna)MediumQuantitative Trader
    Probability Two Randomly Started Flower Bloom Periods Overlap

    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.

    Statistics & MathOnline Assessment
  • SIG (Susquehanna)MediumQuantitative Trader
    Probability You Picked the Strongest Cat Given Your Cat Lost the Race

    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.

    Statistics & MathOnline Assessment
  • SIG (Susquehanna)MediumQuantitative Trader
    Probability of Reaching a Chip Target Under Bold Betting

    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.

    Statistics & MathOnline Assessment
  • SIG (Susquehanna)EasyData Scientist
    Resolve Two Knights-and-Knaves Statements

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

    Statistics & MathOnline AssessmentLogicPuzzlesDiscrete Math
  • SIG (Susquehanna)MediumSoftware Engineer
    Rotate a Square Matrix Clockwise While Both Diagonals Stay Fixed

    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.

    Coding & AlgorithmsOnline Assessment
  • SIG (Susquehanna)EasyData Scientist
    Solve Barn Animal Counts from Total Legs

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

    Statistics & MathOnline Assessmentmathalgebraquantitative-reasoning
  • SIG (Susquehanna)EasyData Scientist
    Solve animals-and-legs count

    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.

    Statistics & MathOnline Assessment
  • SIG (Susquehanna)MediumData Scientist
    Solve relative-truth cat puzzle

    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.

    Statistics & MathOnline Assessment
  • SIG (Susquehanna)EasyData Scientist
    Use Bayes for factory identification

    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.

    Statistics & MathOnline Assessment
  • SalesforceMediumSoftware Engineer
    Convert integer to NAF form

    This question evaluates understanding of number representations (Non-Adjacent Form), bit-level optimization, and formal proof techniques for demonstrating minimal Hamming weight, together with algorithmic complexity analysis.

    Coding & AlgorithmsOnline Assessment
  • SalesforceMediumSoftware Engineer
    Delete One Character Type to Minimize Unique Segments

    Determine which single character type to delete from a string so that greedily partitioning the remaining characters into substrings with all-unique characters yields the minimum number of segments.

    Coding & AlgorithmsOnline Assessmentgreedystringhash-table
  • SalesforceMediumSoftware Engineer
    Determine minimal substitutions and removals

    This question evaluates string manipulation and adjacency-constraint handling in the first task and sequence analysis with minimal-removal and subsequence reasoning in the second, targeting competencies such as local transformation logic, subsequence recognition, and optimization under input constraints.

    Coding & AlgorithmsOnline Assessment
  • SalesforceMediumSoftware Engineer
    Fewest Add-or-Subtract Power-of-Two Steps to Reduce n to Zero

    An integer problem: reduce a positive n to zero with the fewest operations, where each operation adds or subtracts a power of two. It tests reasoning about binary representations, proving a strategy optimal, and working safely with integers larger than 32 bits.

    Coding & AlgorithmsOnline Assessment
  • SalesforceMediumSoftware Engineer
    Fewest Repeat-Free Pieces After Deleting Every Copy of One Letter

    A string problem: delete every occurrence of one chosen lowercase letter, then split what remains into the fewest contiguous pieces with no repeated letters. It tests reasoning about optimal partitions, evaluating every deletion choice efficiently, and edge cases on strings up to 200,000 characters.

    Coding & AlgorithmsOnline Assessment
  • SalesforceHardSoftware Engineer
    How do you perform a thorough code review?

    This task evaluates a candidate's code-review proficiency across security, correctness, data modeling, concurrency, reliability, and maintainability when inspecting Python backend and SQL-based database code, and is categorized under Software Engineering Fundamentals.

    Software Engineering FundamentalsOnline Assessment
  • SalesforceEasySoftware Engineer
    Remove duplicates and find constrained longest subsequence

    This problem tests your ability to manipulate linked structures to remove duplicates and your algorithmic efficiency in finding the longest string that satisfies two distinct containment constraints.

    Coding & AlgorithmsOnline AssessmentLinked ListStringsSubsequence
  • SalesforceMediumSoftware Engineer
    Solve Two OA Coding Problems

    These two problems evaluate in-place array manipulation and run-length encoding implementation for character sequences, and algorithmic reasoning about integer operations and minimal-operation sequences, falling squarely within the Coding & Algorithms domain.

    Coding & AlgorithmsOnline Assessment
  • SchonfeldMediumData Scientist
    Compute probability last passenger gets own seat

    This question evaluates a candidate's understanding of probability theory, combinatorics, and reasoning about sequential random processes, with emphasis on symmetry and conditional dependence.

    Coding & AlgorithmsOnline Assessment
  • SchonfeldMediumData Scientist
    Find smallest N for 5-and-21 sums

    This question evaluates understanding of integer linear combinations and elementary number theory, framed as a Frobenius coin problem that examines representability using non-negative multiples of 5 and 21.

    Coding & AlgorithmsOnline Assessment
  • SnapchatMediumSoftware Engineer
    Compute shortest recursive string encoding

    This question evaluates proficiency in string manipulation, pattern detection, recursion, and dynamic programming for efficient sequence compression in the Coding & Algorithms domain.

    Coding & AlgorithmsOnline Assessment
  • SnowflakeMediumSoftware Engineer
    Solve Array Distance and Wiki Navigation

    This question evaluates array-processing and graph-algorithm skills, specifically minimum-distance computation between marked elements in a one-dimensional array and shortest-path navigation in a directed link graph, plus edge-case reasoning and test-case design.

    Coding & AlgorithmsOnline Assessment
  • SquarepointMediumData Scientist
    Maximize revenue from inventory sales

    This question evaluates algorithmic problem-solving and optimization competencies focused on dynamic resource allocation, revenue maximization, and designing efficient solutions that scale with large n, m, and quantities.

    Coding & AlgorithmsOnline Assessment
  • SquarepointMediumSoftware Engineer
    Parse payroll file and answer queries

    This question evaluates proficiency in robust file parsing, schema-driven data modeling, type conversion, validation, duplicate handling, and implementing aggregate and ranking queries using Python's standard library for messy, delimited payroll data.

    Coding & AlgorithmsOnline Assessment
  • SquarepointHardSoftware Engineer
    Solve two coding assessment tasks

    This question set evaluates algorithmic optimization and string-processing skills: the first problem focuses on maximizing cumulative revenue from limited inventories (optimization and greedy reasoning with dynamic value updates), while the second focuses on case-insensitive text parsing, word frequency counting, and frequency-based ordering.

    Coding & AlgorithmsOnline Assessment