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 4111–4140 of 9403 results

  • IBMMediumSoftware Engineer
    Count Index Triplets Whose Max Minus Min Is at Most d

    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.

    Coding & AlgorithmsTechnical Screen
  • IBMMediumSoftware Engineer
    Count Replacements Needed to Separate Equal Adjacent Characters

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

    Coding & AlgorithmsOnline AssessmentGreedyStringsArray
  • IBMMediumSoftware Engineer
    Count Seat-Price Trios Within a Budget Spread

    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.

    Coding & AlgorithmsTechnical Screensortingtwo-pointerscombinatorics
  • IBMMediumSoftware Engineer
    Count Sensor Trios Within a Tolerance Band

    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.

    Coding & AlgorithmsTechnical Screensortingtwo-pointerscombinatorics
  • IBMMediumSoftware Engineer
    Count Tree Vertices with Pythagorean Distances

    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.

    Coding & AlgorithmsOnline AssessmentTreesBFSGraph
  • IBMMediumSoftware Engineer
    Debug and Harden a Ticketing Backend API

    Implement and harden an in-memory ticket service backend to handle deterministic cursor pagination, idempotent reservations, cache invalidation, and oversell prevention.

    Software Engineering FundamentalsOnline AssessmentAPI DesignCachingPagination
  • IBMMediumSoftware Engineer
    Describe open-source contribution experience

    This IBM software-engineer take-home behavioral question evaluates your open-source contribution experience end to end: the projects and repositories you worked on, your specific roles and most impactful contributions, how you collaborated with maintainers through issues, code reviews, and RFCs, and the lessons you took from code reviews and issue triage. A strong answer goes deep on one or two repositories with quantified, evidence-backed impact.

    Behavioral & LeadershipOnline Assessment
  • IBMEasyData Scientist
    Design a lead-scoring model

    Design an end-to-end lead-scoring model for a marketing/growth data science team: define the label and scoring time, engineer leakage-safe features, compare a logistic-regression baseline with gradient-boosted trees, and evaluate with capacity-aware ranking metrics. The question also probes multicollinearity, model interpretability (SHAP/reason codes), routing-threshold design, and operational risks like selection bias, class imbalance, fairness, and drift.

    Machine LearningTechnical Screen
  • IBMHardSoftware Engineer
    Design a multithreaded CPU 1D convolution

    An IBM software-engineer take-home that asks you to design and implement a multithreaded CPU version of valid 1D convolution across three regimes: a tiny kernel (K=3), a kernel as long as the input (K=N, a single dot product), and a 100-thread cap. It evaluates parallel decomposition, scheduling, cache locality, false-sharing avoidance, SIMD vectorization, and reduction/synchronization choices.

    System DesignOnline Assessment
  • IBMEasyData Scientist
    Estimate free-trial conversion probability

    This question evaluates a data scientist's competency in cohort definition, censored-data handling, segmentation and confounding assessment, and uncertainty quantification for measuring free-trial to paid conversion, and it belongs to the Analytics & Experimentation domain within data science.

    Analytics & ExperimentationTechnical Screen
  • IBMEasySoftware Engineer
    Explain CI/CD, Kubernetes delivery, and troubleshooting

    This question evaluates operational DevOps and cloud-native competencies, specifically CI/CD concepts and tools, GitOps delivery with Argo CD, Kubernetes deployment and troubleshooting (including Helm and StatefulSet vs Deployment), containerization rationale, Linux process and file inspection, network diagnostics, database deployment safety, and infrastructure concepts such as HPC and VPC. It is commonly asked in Software Engineering Fundamentals and DevOps interviews to measure production-readiness, troubleshooting ability, and tooling familiarity, emphasizing practical application while requiring underlying conceptual understanding of system behavior and reliability.

    Software Engineering FundamentalsOnsite
  • IBMMediumSoftware Engineer
    Find Customers Whose Average Website Resource Usage Exceeds 50 Percent

    Practice PostgreSQL aggregation with HAVING, customer-level average resource utilization, strict thresholds, two-decimal rounding, and ascending email output.

    Data Manipulation (SQL/Python)Online Assessment
  • IBMMediumSoftware Engineer
    Find minimum subarray length with k distinct integers

    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.

    Coding & AlgorithmsTechnical Screen
  • IBMMediumSoftware Engineer
    Function Signature Lookup with Exact and Variadic Parameter Matching

    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.

    Coding & AlgorithmsTechnical Screen
  • IBMEasyData Scientist
    How do you detect and fix multicollinearity?

    This question evaluates understanding of multicollinearity and related competencies in regression diagnostics, feature engineering, model interpretability, and the trade-offs between coefficient inference and predictive performance.

    Statistics & MathTechnical Screen
  • IBMEasySoftware Engineer
    How would you use generative AI at work?

    This question evaluates a candidate's judgment and leadership in applying generative AI tools, testing competencies in risk assessment, data confidentiality, security awareness, correctness verification, and team change management for a software engineer role.

    Behavioral & LeadershipOnsite
  • IBMMediumSoftware Engineer
    Manage Authentication Tokens with a Fixed Time to Live

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

    Coding & AlgorithmsOnline AssessmentHash MapDesignQueue
  • IBMMediumSoftware Engineer
    Maximize Revenue from Depleting VM Inventory

    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.

    Coding & AlgorithmsOnline AssessmentBinary SearchGreedyOptimization
  • IBMMediumSoftware Engineer
    Maximize Revenue from Depleting VM Stock

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

    Coding & AlgorithmsOnline Assessmentgreedybinary-searchmath
  • IBMMediumSoftware Engineer
    Maximize palindromic strings after character swaps

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

    Coding & AlgorithmsTechnical Screen
  • IBMMediumSoftware Engineer
    Six Timed Behavioral Prompts: AI Tools, Debugging, Teamwork, Explaining, Goals, Quality

    Six prompts from a recorded behavioral interview, each with one minute to prepare and three minutes to answer: vetting an AI tool's output, diagnosing a failure, teamwork, explaining your work, reaching a goal, and verifying that something you built works. Tests structured, specific storytelling under strict time limits.

    Behavioral & LeadershipOnline Assessment
  • IBMEasySoftware Engineer
    Sum Pairwise Remainders Across Two Integer Ranges

    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.

    Coding & AlgorithmsOnline AssessmentMathAlgorithmsArithmetic
  • IBMEasySoftware Engineer
    Sum the XOR of Every Cross-Array Pair

    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.

    Coding & AlgorithmsOnline Assessmentbit-manipulationmatharrays
  • IBMEasyData Scientist
    Write SQL to compute max and min marks

    This question evaluates a candidate's ability to perform basic data aggregation in SQL, specifically computing summary statistics from a single table. It is commonly asked to assess competence in data manipulation and query result shaping within the Data Manipulation (SQL/Python) domain, focusing on practical application of SQL aggregation rather than purely conceptual theory.

    Data Manipulation (SQL/Python)Online Assessment
  • IXL LearningEasySoftware Engineer
    Debug Kubernetes crashes and review Python ingestion script

    This question evaluates operational debugging and system reliability skills — specifically Kubernetes pod/container troubleshooting, health-probe configuration, and practical Python ETL code review, focusing on observability, dependency management, and production-readiness.

    Software Engineering FundamentalsTechnical Screen
  • IXL LearningMediumSoftware Engineer
    Find value on most distinct levels

    This question evaluates a candidate's understanding of binary tree structures, level-wise aggregation and frequency analysis, along with algorithm design and complexity reasoning.

    Coding & AlgorithmsTechnical Screen
  • IXL LearningMediumSoftware Engineer
    Identify and prevent code-breaking inputs

    Identify and prevent code-breaking inputs evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

    Coding & AlgorithmsTechnical Screen
  • IXL LearningHardSoftware Engineer
    Maintain a Stream Median

    This question tests the ability to maintain dynamic order statistics in a streaming context, requiring an efficient way to insert elements and compute the median in logarithmic time.

    Coding & AlgorithmsTechnical ScreenHeapsData StructuresAlgorithms
  • IXL LearningMediumSoftware Engineer
    Solve snake game, peak search, and task scheduling

    Solve snake game, peak search, and task scheduling evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

    Coding & AlgorithmsTechnical Screen
  • IllumioMediumSoftware Engineer
    Count Regions in a Binary Grid

    This problem tests your ability to navigate a 2D grid and identify connected components using graph traversal techniques like Depth-First Search (DFS) or Breadth-First Search (BFS).

    Coding & AlgorithmsOnsiteDFSBFSGraph