Coding & Algorithms interview questions

Showing 2041–2070 of 3276 results

• Deduplicate an Array in Linear TimeMedium

  This question tests the ability to implement a deduplication algorithm that preserves the original relative order of elements while maintaining O(n) time and space complexity.

  OktaFrontend EngineerCoding & AlgorithmsTechnical Screen
• Validate IPv4 Address ListMedium

  This problem tests your ability to parse strings and apply conditional logic to validate technical data against specific constraints.

  OktaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Group Strings By Anagram SignatureMedium

  This problem tests your ability to normalize strings into canonical forms using hashing or frequency counting to identify anagrams efficiently.

  OkxSoftware EngineerCoding & AlgorithmsTechnical Screen
• Alternate Odd and Even Numbers with Two ThreadsMedium

  This problem tests knowledge of thread synchronization using locks and condition variables to enforce a specific execution order between two concurrent processes.

  OmnissaSoftware EngineerCoding & AlgorithmsOnsite
• Check Whether a Singly Linked List Is a PalindromeMedium

  Tests the ability to determine if a singly linked list is a palindrome in O(n) time and O(1) auxiliary space using two pointers and in-place list reversal.

  OmnissaSoftware EngineerCoding & AlgorithmsOnsite
• Find the Celebrity from a Knows MatrixMedium

  This problem tests the ability to solve a search problem in O(N) time by utilizing the transitive and exclusionary properties of the 'knows' relationship to eliminate candidates.

  OmnissaSoftware EngineerCoding & AlgorithmsOnsite
• Find the Maximum Sum of a Contiguous SubarrayMedium

  This problem tests the ability to implement Kadane's algorithm to find the maximum sum of a contiguous subarray, specifically focusing on handling negative integers and maintaining optimal time and space complexity.

  OmnissaSoftware EngineerCoding & AlgorithmsOnsite
• Repeatedly Remove Adjacent Equal CharactersMedium

  This problem tests your ability to handle recursive reduction patterns in a string using a stack-based approach to achieve linear time complexity.

  OmnissaSoftware EngineerCoding & AlgorithmsOnsite
• Count Complete Highway Journeys from Toll LogsEasy

  This problem tests string manipulation, hash map usage, and state tracking to identify valid entry-to-exit sequences from an unordered stream of toll logs.

  OnepaySoftware EngineerCoding & AlgorithmsTechnical Screen
• Add Consecutive-Value Bonuses to Grid PathsMedium

  Tests dynamic programming on a 2D grid with extended state tracking to incorporate multi-step path history for score bonuses, path counting, and lexicographical path reconstruction.

  OpenAISoftware EngineerCoding & AlgorithmsOnsite
• Aggregate Recent Message Events And Active ChatsHard

  Design an in-memory aggregation system that tracks rolling window message counts and distinct active entities across chats with bounded memory and O(1) amortized operations.

  OpenAISoftware EngineerCoding & AlgorithmsOnsite
• Build a Compose Rating CardMedium

  Tests proficiency in modern Android development with Kotlin and Jetpack Compose, focusing on unidirectional data flow (UDF), custom stateless composables, ViewModel state management, and asynchronous submission handling.

  OpenAIAndroid EngineerCoding & AlgorithmsTechnical Screen
• Build a Streaming Chat InputMedium

  This question evaluates frontend engineering skills including streaming data handling, incremental token-by-token rendering, asynchronous state management, and preserving UI responsiveness during long-running API streams.

  OpenAIFrontend EngineerCoding & AlgorithmsTechnical Screen
• Cheapest Daily Shirt Colors With No Color Repeated on Consecutive DaysHard

  Pick a blue, green or red shirt for each of n days so that the total price is as low as possible while never buying the same color on two consecutive days, and return the chosen color sequence. It tests dynamic programming over a small state space and reconstruction of the optimal choices.

  OpenAISoftware EngineerCoding & AlgorithmsTechnical Screen
• Cheapest Paint-Booth Color Schedule With No Repeat on Consecutive CarsHard

  Choose one of three paint colors for each car on an assembly line to minimize total cost, never repeating a color on consecutive cars, and return the exact color chosen for each car.

  OpenAISoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute Infection Time in a GridHard

  This problem tests your ability to model state propagation in a 2D grid using Breadth-First Search (BFS) to determine the time required for a dynamic condition to cover all reachable nodes.

  OpenAISoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute Plant Infection StabilizationMedium

  This problem tests your ability to simulate state propagation across a grid over discrete time steps and determine the minimum number of interventions required to contain an infection.

  OpenAISoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute Plant Infection TimeMedium

  This problem tests your ability to model a grid-based propagation process using Breadth-First Search (BFS), specifically handling multi-source initialization and obstacle avoidance.

  OpenAISoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute infection spread timeMedium

  This problem tests your ability to model a spreading process on a 2D grid using a multi-source Breadth-First Search (BFS) to determine the time required for a state to propagate across the entire space.

  OpenAISoftware EngineerCoding & AlgorithmsOnsite
• Convert IPv4 Ranges to CIDR BlocksMedium

  This question evaluates understanding of IPv4 addressing, binary/bitwise manipulation, and the ability to summarize consecutive address ranges into minimal CIDR blocks, and belongs to the Coding & Algorithms domain for backend engineering roles.

  OpenAIBackend EngineerCoding & AlgorithmsTechnical Screen
• Count Connected Friend GroupsMedium

  Determine the number of connected components in an undirected graph represented as an adjacency matrix using graph traversal or disjoint set union.

  OpenAISoftware EngineerCoding & AlgorithmsTechnical Screen
• Count Ordered Four-Shop Road Paths That Visit One Shop of Each TypeHard

  Count the ordered routes through a town's road network that visit exactly one shop of each of four types, where consecutive shops must share a direct road and a route and its reverse count separately. Tests graph modeling, path enumeration under type constraints and careful counting on small graphs.

  OpenAISoftware EngineerCoding & AlgorithmsOnline Assessment
• Design a Resumable Iterator with Checkpoint and RestoreMedium

  This question evaluates a candidate's ability to design serializable, stateful abstractions in both in-memory and I/O-bound contexts. It tests understanding of iterator patterns, checkpoint-restore semantics, and test-driven development — competencies commonly assessed in engineering roles requiring systems thinking and API design rigor.

  OpenAIMachine Learning EngineerCoding & AlgorithmsTechnical Screen
• Design a parser for a hypothetical languageMedium

  This question evaluates competency in compiler and language design, covering grammar analysis, parsing algorithms (LL/LR/GLR/Earley/PEG), lexer and parser implementation, AST construction, error reporting and recovery, operator precedence and associativity, and analysis of time/space trade-offs.

  OpenAISoftware EngineerCoding & AlgorithmsOnsite
• Design a persistent key-value storeMedium

  This question evaluates a candidate's ability to design persistent storage and in-memory data structures, covering serialization of arbitrary values, medium/interface design for byte-level persistence, crash-consistent flushing, error handling, and performance and complexity analysis.

  OpenAISoftware EngineerCoding & AlgorithmsTechnical Screen
• Design an Editable Text BufferMedium

  This problem tests your ability to design an efficient data structure for text manipulation while implementing undo/redo history and a dynamic prefix-based autocomplete feature.

  OpenAIMachine Learning EngineerCoding & AlgorithmsTechnical Screen
• Find Minimum Compatible VersionMedium

  Implement an algorithm to find the earliest compatible software version while minimizing expensive compatibility-check API calls across partitioned version branches.

  OpenAIMachine Learning EngineerCoding & AlgorithmsOnsite
• Find the First Working VersionMedium

  This question tests the ability to combine custom comparison logic with a binary search approach to identify the first transition point in a monotonic sequence.

  OpenAIMachine Learning EngineerCoding & AlgorithmsOnsite
• Follow One-Way Links to the Endpoint Node or the Last Node Before a Loop ClosesHard

  Given one-way links in which every node has at most one outgoing link, follow the links from a start node and return the endpoint where the walk stops, or the last node visited before the walk would revisit a node. Tests single-successor graph traversal, visited-node bookkeeping and loop edge cases.

  OpenAISoftware EngineerCoding & AlgorithmsTechnical Screen
• Generate Data Labeling SchedulesMedium

  This question evaluates combinatorial reasoning and constructive algorithm design for generating constrained assignment schedules, including ensuring each human appears a minimum number of times, preventing duplicate human-task pairs, and managing valid ID ranges.

  OpenAISoftware EngineerCoding & AlgorithmsTechnical Screen