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 1951–1980 of 4616 results

  • Hudson River TradingMediumSoftware Engineer
    Approach verbose data-structure design

    This question evaluates a candidate's ability to design and implement complex data structures, testing algorithmic reasoning, time/space complexity analysis, state modeling, and organization of code and tests.

    Coding & AlgorithmsTechnical Screen
  • Hudson River TradingEasySoftware Engineer
    Ball Position in a Tilting Maze After Timed Tilt Events

    Live coding simulation problem: a ball sits in a grid maze on a board that can tilt up, down, left or right or lie flat, and timed events change the tilt. Return the ball's cell at an end time that can be very large. It tests precise timing rules, wall handling and movement code that scales to long time spans.

    Coding & AlgorithmsTechnical Screen
  • Hudson River TradingHardSoftware Engineer
    C++ Fundamentals: Memory, Compilation, and Containers

    Tests deep C++ expertise in zero-allocation data structures, cache-line alignment, manual object lifecycle management via placement new, and the compilation/inlining implications of template-based designs.

    Software Engineering FundamentalsTechnical ScreenC++Memory ManagementData Structures
  • Hudson River TradingMediumSoftware Engineer
    Calculate Completion Time for a Single-Server Reactor Queue

    Simulate a single-threaded reactor queue with a bounded buffer to compute the completion timestamp or drop status for each incoming task.

    Coding & AlgorithmsTechnical ScreenQueueSimulationArrays
  • Hudson River TradingEasySoftware Engineer
    Check Root-To-Leaf Target Sums In A Binary Tree

    This question tests your ability to traverse a binary tree using depth-first search (DFS) or breadth-first search (BFS) while tracking path accumulators and accurately identifying valid leaf nodes.

    Coding & AlgorithmsTechnical ScreenBinary TreeDFSRecursion
  • Hudson River TradingMediumSoftware Engineer
    Choose Mean or Median for Trading Profit Metrics

    This problem tests your understanding of statistical measures of central tendency, specifically how different distributions affect the choice between mean and median in high-frequency trading scenarios.

    Statistics & MathTechnical ScreenStatisticsFinanceData Analysis
  • Hudson River TradingMediumSoftware Engineer
    Compare C++ Pointers and References

    Tests in-depth understanding of C++ raw pointers versus references, their language semantics, memory representations, and how to apply them to design safe, idiomatic, zero-cost APIs.

    Software Engineering FundamentalsTechnical Screencppsystemsapi-design
  • Hudson River TradingMediumData Scientist
    Compare Mean and Median for a Distribution with a Point Mass

    This question tests the theoretical and empirical comparison between the sample mean and sample median on a mixture distribution containing a discrete point mass and a Gaussian component.

    Statistics & MathTechnical Screenstatisticsprobabilityestimation
  • Hudson River TradingMediumSoftware Engineer
    Compare Multithreading and Multiprocessing

    This question tests your understanding of concurrency primitives, operating system process models, memory isolation, context switching overheads, and the architectural trade-offs between threads and processes in low-latency systems.

    Software Engineering FundamentalsTechnical Screenconcurrencyoperating-systemsmultithreading
  • Hudson River TradingMediumSite Reliability Engineer
    Compare Python Generators, Decorators, and Context Managers

    Tests understanding of Python's execution timing, protocol methods, and resource cleanup across generators, decorators, and context managers, culminating in a robust lazy stream processor.

    Software Engineering FundamentalsTechnical ScreenPythonResource ManagementDecorators
  • Hudson River TradingMediumSoftware Engineer
    Count Digit-Reversal Equivalent Pairs

    Count pairs of indices in an integer array whose values share the same canonical digit-reversal form.

    Coding & AlgorithmsTechnical ScreenHash TableMathString
  • Hudson River TradingMediumSoftware Engineer
    Count Length-3 Chat Substrings with a Vowel

    Count the number of distinct length-3 alphabetical substrings in a chat message that contain at least one vowel.

    Coding & AlgorithmsTechnical Screenstringsliding-windowhash-set
  • Hudson River TradingMediumSoftware Engineer
    Count Matrix Cells Whose Row and Column Neighbors Match

    This problem tests your ability to efficiently traverse a grid while implementing conditional neighborhood logic and handling boundary constraints.

    Software Engineering FundamentalsTechnical ScreenArraysMatrixGrid
  • Hudson River TradingMediumData Scientist
    Count inversions in a permutation

    This question evaluates understanding of inversion counting in permutations, testing algorithmic problem-solving, complexity analysis, and data-structure reasoning about pairwise order relations.

    Coding & AlgorithmsTechnical Screen
  • Hudson River TradingEasySoftware Engineer
    Count players reaching end with moving watchers

    This problem tests your ability to model state transitions over discrete time steps and efficiently track interval coverage using sorting and sweep-line logic.

    Coding & AlgorithmsTechnical ScreenSimulationGeometryOptimization
  • Hudson River TradingMediumData Scientist
    Derive expected inversions and mean distribution

    This problem tests your understanding of linearity of expectation and variance properties applied to permutation statistics, as well as the ability to design a simulation to verify analytical derivations.

    Machine LearningTechnical ScreenProbabilityStatisticsExpectation
  • Hudson River TradingHardSoftware Engineer
    Design an Indexable Deque with O(1) Access

    Tests understanding of low-level data structure design, memory layout, and trade-offs required to build a double-ended queue supporting strict O(1) random indexing and amortized O(1) push/pop operations.

    Software Engineering FundamentalsTechnical ScreenData StructuresArraysSystem Fundamentals
  • Hudson River TradingMediumSoftware Engineer
    Design comprehensive OA test cases

    This question assesses a software engineer's practical test design skills under time pressure, specifically the ability to partition input spaces into equivalence classes and boundary cases for algorithm and data structure problems. It evaluates systematic testing methodology, including oracle-based verification strategies and defensible stopping rules — competencies commonly probed in online assessments and technical interviews to gauge engineering rigor.

    Behavioral & LeadershipTechnical Screen
  • Hudson River TradingMediumSoftware Engineer
    Determine Whether Two Integers Sum to a Target

    This problem tests proficiency with hash sets to achieve linear time complexity and emphasizes defensive programming practices like input validation and immutability.

    Coding & AlgorithmsTechnical ScreenHash SetArraysTwo Pointers
  • Hudson River TradingMediumSoftware Engineer
    Diagnose I/O, Memory, and CPU Constraints

    Tests your ability to systematically diagnose, measure, and resolve CPU, memory, and I/O bottlenecks in high-throughput, low-latency systems.

    Software Engineering FundamentalsTechnical ScreenSystemsPerformance OptimizationOperating Systems
  • Hudson River TradingHardSoftware Engineer
    Explain C++ Inline, Segfaults, Virtual Memory, and std::string Internals

    Tests deep understanding of low-level systems and modern C++ fundamentals, focusing on compiler inlining mechanics, virtual memory paging, segmentation fault root causes, and standard library string memory layouts.

    Software Engineering FundamentalsTechnical ScreenC++Virtual MemoryOperating Systems
  • Hudson River TradingHardSoftware Engineer
    Explain Large Memory Allocation, Swap, and C++ Inline Trade-offs

    Tests deep understanding of OS virtual memory management, demand paging and swap mechanics, and low-latency C++ compiler optimizations centered around inlining and instruction cache trade-offs.

    Software Engineering FundamentalsTechnical Screenc++operating-systemsvirtual-memory
  • Hudson River TradingHardSoftware Engineer
    Explain Python and React performance fundamentals

    This question evaluates knowledge of Python resource management (context managers and the with statement), React rendering and optimization concepts (hooks, memoization, and frontend performance), and on-call debugging and incident triage skills.

    Software Engineering FundamentalsTechnical Screen
  • Hudson River TradingMediumSite Reliability Engineer
    Explain Why du and df Report Different Disk Usage

    This question tests your understanding of Linux filesystem internals, specifically how kernel-level storage reporting differs from user-space directory traversal.

    Software Engineering FundamentalsTechnical ScreenLinuxFilesystemSRE
  • Hudson River TradingMediumSoftware Engineer
    Explain and Diagnose a Segmentation Fault

    This question tests your understanding of virtual memory, the lifecycle of a segmentation fault, and your ability to diagnose memory corruption using standard tooling.

    Software Engineering FundamentalsTechnical ScreenC++SystemsDebugging
  • Hudson River TradingHardSoftware Engineer
    Final Grid Position Under Timestamped Direction Changes With Dot Obstacles

    An object on a grid changes direction whenever a timestamped action arrives and moves one cell per time unit until a blocked cell or the grid edge stops it. The task asks for its cell at a given end time, testing precise reading of the rules, including that dot cells are obstacles, and efficient handling of very large timestamps.

    Coding & AlgorithmsTechnical Screen
  • Hudson River TradingHardSoftware Engineer
    Find a Local Minimum in One and Two Dimensions

    Tests divide-and-conquer optimization techniques to locate a local minimum in 1D and 2D arrays in sublinear time, requiring rigorous reasoning about termination and invariants.

    Software Engineering FundamentalsTechnical Screenbinary-searchdivide-and-conquerarrays
  • Hudson River TradingMediumSoftware Engineer
    Find the Longest Common Digit Prefix Across Two Arrays

    Tests candidate's ability to efficiently match string/digit prefixes between two collections of integers using hash sets or a prefix tree (Trie).

    Software Engineering FundamentalsTechnical ScreenTrieHash TableString
  • Hudson River TradingMediumSoftware Engineer
    Format an Integer with Thousands Separators

    Implement a function that formats a signed integer with a custom thousands separator character without relying on built-in string formatting utilities.

    Coding & AlgorithmsTechnical Screenstringmathimplementation
  • Hudson River TradingMediumSoftware Engineer
    Linux Host and Filesystem Fundamentals

    Review practical Linux fundamentals: memory and swap interpretation, safe directory enumeration, process-versus-thread trade-offs, filesystem links, and option-safe file deletion. Also explain responsible recovery steps after an accidental recursive delete.

    Software Engineering FundamentalsTechnical Screen