Coding & Algorithms interview questions

Showing 1351–1380 of 3276 results

• Count inversions in a permutationMedium

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

  Hudson River TradingData ScientistCoding & AlgorithmsTechnical Screen
• Count players reaching end with moving watchersEasy

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

  Hudson River TradingSoftware EngineerCoding & AlgorithmsTechnical Screen
• Determine Whether Two Integers Sum to a TargetMedium

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

  Hudson River TradingSoftware EngineerCoding & AlgorithmsTechnical Screen
• Final Grid Position Under Timestamped Direction Changes With Dot ObstaclesHard

  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.

  Hudson River TradingSoftware EngineerCoding & AlgorithmsTechnical Screen
• Format an Integer with Thousands SeparatorsMedium

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

  Hudson River TradingSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement Buffer Parsers and Generic Map ClassMedium

  This problem tests your ability to safely parse binary data streams from raw memory buffers and implement a type-safe generic wrapper around standard associative containers.

  Hudson River TradingQuantitative ResearcherCoding & AlgorithmsOnline Assessment
• Implement Order Modification FeatureHard

  This question evaluates a software engineering competency in modifying and extending a C++ client/server trading system, focusing on state management, input validation, API integration, and maintaining invariants for order lifecycle.

  Hudson River TradingSoftware EngineerCoding & AlgorithmsOnsite
• Maximize Item Counts Under Suffix Budget QueriesEasy

  Determine the maximum number of items that can be purchased from a suffix of an item array within a given budget for multiple independent queries.

  Hudson River TradingSoftware EngineerCoding & AlgorithmsHR Screen
• Return the K Smallest IntegersMedium

  Implement an algorithm to extract the k smallest integers from an unsorted list in ascending order, preserving duplicates, and analyze the trade-offs between sorting, heaps, quickselect, and bounded-range approaches.

  Hudson River TradingSoftware EngineerCoding & AlgorithmsTechnical Screen
• Simulate Alternating Stick Collection for a NestMedium

  Tests simulation logic, two-pointer state management, turn alternation, and handling conditional decision rules with edge cases.

  Hudson River TradingSoftware EngineerCoding & AlgorithmsTechnical Screen
• Simulate Players Moving Under a Watcher's GazeMedium

  Simulate the movement and freezing of players on a 1D track under the gaze of a moving watcher who reverses direction at specified times.

  Hudson River TradingSoftware EngineerCoding & AlgorithmsTechnical Screen
• Smallest Integer Point Lit by the Most Street Lamps on a LineEasy

  Online assessment coding problem: street lamps on a number line each light a closed interval around their position, and you must return the integer point lit by the most lamps, choosing the smallest such point on ties. It tests interval overlap counting over very large coordinate ranges.

  Hudson River TradingSoftware EngineerCoding & AlgorithmsTechnical Screen
• Solve Watcher Simulation And Integer ConversionMedium

  This question evaluates event-driven simulation and discrete-time state modeling for tracking multiple agents under dynamic visibility constraints, together with low-level numeric string conversion and edge-case handling for 32-bit signed integers.

  Hudson River TradingSoftware EngineerCoding & AlgorithmsTechnical Screen
• Test easy–medium array/string tasksMedium

  This question evaluates a candidate's ability to design concise, robust test cases and translate edge-case reasoning into concrete inputs and expected outputs for array and string problems, reflecting skills in input validation, correctness assurance, and handling varied data characteristics.

  Hudson River TradingSoftware EngineerCoding & AlgorithmsTechnical Screen
• Break Adjacent Duplicate CharactersMedium

  Tests string traversal, run-length counting, and greedy optimization to determine the minimum character replacements needed to eliminate adjacent identical characters across a list of words.

  IBMSoftware EngineerCoding & AlgorithmsOnline Assessment
• Calculate Revenue from Highest-Inventory VM SalesEasy

  Sell each VM unit at its current inventory count, always choose a type with maximum inventory, and compute total revenue safely.

  IBMSoftware EngineerCoding & AlgorithmsOnline Assessment
• Count Employees With Unbroken Renewable Access at the Last TimestampMedium

  A simulation problem about an access system where each employee's access lasts a fixed duration after every setting and can be extended only while it is still active. It asks how many employees hold valid access at the last timestamp, testing exact expiry boundaries, permanent lapses and per-employee state.

  IBMSoftware EngineerCoding & AlgorithmsTechnical Screen
• Count Index Triplets Whose Max Minus Min Is at Most dMedium

  A counting problem that asks how many triplets of positions in an integer array have a spread, the largest value minus the smallest, of at most d. It tests handling duplicates and inclusive bounds, producing a count that can exceed 32 bits, and meeting time limits for arrays of up to 100,000 elements.

  IBMSoftware EngineerCoding & AlgorithmsTechnical Screen
• Count Replacements Needed to Separate Equal Adjacent CharactersMedium

  This problem tests your ability to identify and process consecutive character runs in strings and apply greedy calculations to minimize replacement operations.

  IBMSoftware EngineerCoding & AlgorithmsOnline Assessment
• Count Seat-Price Trios Within a Budget SpreadMedium

  Count how many trios of resale-marketplace seat listings have prices within a fixed budget spread of each other, using sorting and a two-pointer sweep instead of an O(n^3) scan.

  IBMSoftware EngineerCoding & AlgorithmsTechnical Screen
• Count Sensor Trios Within a Tolerance BandMedium

  Count how many groups of three readings stay inside a tolerance band (max minus min within a limit). Tests sorting, a sliding window, combinatorial counting and handling of duplicates and large totals.

  IBMSoftware EngineerCoding & AlgorithmsTechnical Screen
• Count Tree Vertices with Pythagorean DistancesMedium

  Calculate distances from three fixed vertices to all other vertices in an unweighted tree and count those whose strictly positive distances form a Pythagorean triple.

  IBMSoftware EngineerCoding & AlgorithmsOnline Assessment
• Find minimum subarray length with k distinct integersMedium

  This question tests proficiency with the sliding window technique and hash map-based frequency tracking, applied to subarray problems requiring exact cardinality constraints. It assesses the ability to distinguish between "exactly k distinct" and "at most k distinct" variants — a nuance that reveals depth in algorithmic thinking commonly evaluated in software engineering interviews.

  IBMSoftware EngineerCoding & AlgorithmsTechnical Screen
• Function Signature Lookup with Exact and Variadic Parameter MatchingMedium

  A coding question about an IDE-style signature lookup engine: given registered functions, some whose last parameter is variadic, return for each call the sorted names of every function that accepts its argument types. It tests exact type-sequence matching, zero-or-more variadic arguments and edge cases such as empty argument lists.

  IBMSoftware EngineerCoding & AlgorithmsTechnical Screen
• Manage Authentication Tokens with a Fixed Time to LiveMedium

  Design an authentication token manager that handles token generation, renewal, and active token counting based on a fixed time-to-live.

  IBMSoftware EngineerCoding & AlgorithmsOnline Assessment
• Maximize Revenue from Depleting VM InventoryMedium

  This problem tests your ability to efficiently manage and update a dynamic collection of items using a priority queue to always extract the maximum value.

  IBMSoftware EngineerCoding & AlgorithmsOnline Assessment
• Maximize Revenue from Depleting VM StockMedium

  Tests greedy optimization, sorting, and arithmetic progression math to compute maximum revenue from diminishing-value stock with large order quantities.

  IBMSoftware EngineerCoding & AlgorithmsOnline Assessment
• Maximize palindromic strings after character swapsMedium

  This question evaluates proficiency in string manipulation, combinatorial character-count reasoning, and redistribution of characters under constrained swap operations within the Coding & Algorithms domain.

  IBMSoftware EngineerCoding & AlgorithmsTechnical Screen
• Sum Pairwise Remainders Across Two Integer RangesEasy

  Calculate the total sum of remainders obtained by taking each integer in a dividend range modulo each non-zero divisor in a divisor range. The problem tests division properties, edge-case handling for zero divisors, and avoiding integer overflow.

  IBMSoftware EngineerCoding & AlgorithmsOnline Assessment
• Sum the XOR of Every Cross-Array PairEasy

  Tests bitwise frequency analysis and arithmetic optimization by reducing an O(N * M) cross-product XOR sum to an O(B * (N + M)) bit-by-bit contribution calculation.

  IBMSoftware EngineerCoding & AlgorithmsOnline Assessment