Coding & Algorithms interview questions

Showing 511–540 of 3276 results

• Find a secret word using match feedbackHard

  Design an optimal querying strategy to identify a secret word from a candidate vocabulary using exact-match character feedback under a strict query budget.

  AtlassianMachine Learning EngineerCoding & AlgorithmsOnsite
• Find nearest common manager for multiple employeesMedium

  This question evaluates proficiency in tree and graph algorithms (lowest common ancestor), input validation for hierarchical data (cycle and disconnected component detection), API design for constructing and querying trees, and algorithmic time/space complexity analysis.

  AtlassianSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find smallest common organization for employeesMedium

  This problem tests your ability to navigate hierarchical structures and find the Lowest Common Ancestor (LCA) in a tree or a directed acyclic graph representing organizational reporting lines.

  AtlassianSoftware EngineerCoding & AlgorithmsTechnical Screen
• Highlight the Shortest Unique Substring in Each LabelMedium

  Find and highlight the shortest case-insensitive unique substring in each label using bracket notation, breaking ties by earliest index and preserving original casing.

  AtlassianSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement Real-Time Rate Limiting for Web Service RequestsMedium

  This question evaluates understanding of real-time rate limiting, time-windowed traffic control, and efficient per-client state management under algorithmic constraints.

  AtlassianData ScientistCoding & AlgorithmsTechnical Screen
• Implement sequential and parallel URL requestsMedium

  Implement an asynchronous batch URL fetcher that executes requests with bounded concurrency, deduplicates network calls, preserves input order, and handles per-request errors gracefully.

  AtlassianSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement sliding-window rate limiter functionMedium

  This problem tests your ability to design a thread-safe rate limiter using a sliding window approach, focusing on time complexity optimization and memory management.

  AtlassianSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement sliding-window rate limiter with dual thresholdsMedium

  This question evaluates a candidate's skill in implementing efficient online sliding-window rate limiting, covering stream processing, time-based window management, per-key state maintenance, algorithmic complexity analysis, and formal correctness reasoning.

  AtlassianData ScientistCoding & AlgorithmsOnline Assessment
• Merge intervals and design rating APIsMedium

  Tests interval merging logic alongside stateful data structure design for tracking agent performance, calculating streaming averages, and ranking agents with deterministic tie-breaking.

  AtlassianSoftware EngineerCoding & AlgorithmsTechnical Screen
• Merge overlapping intervalsMedium

  This problem tests your ability to manipulate array-based data structures, specifically focusing on sorting and linear-time interval merging logic.

  AtlassianSoftware EngineerCoding & AlgorithmsTechnical Screen
• Per-Caller Request Limiter Over Non-Decreasing Time BucketsEasy

  A coding question about a rate limiter that receives requests as time bucket and caller pairs, in non-decreasing bucket order, and decides which to allow when each caller may make only a fixed number of requests per bucket. It tests stateful counting, per-key bookkeeping and correct handling of bucket changes.

  AtlassianSoftware EngineerCoding & AlgorithmsTechnical Screen
• Evaluate a Scoped Lisp ExpressionMedium

  Implement a recursive descent or token-based interpreter to evaluate a scoped, Lisp-like arithmetic expression supporting addition, multiplication, and sequential variable bindings with shadowing.

  AttentiveSoftware EngineerCoding & AlgorithmsOnsite
• Find Inclusive Index Ranges for Time-Window Queries on Timestamp-Sorted LogsMedium

  Given log timestamps sorted in non-decreasing order with possible duplicates, answer many inclusive time-window queries by returning the first and last index of the entries inside each window, where a window may extend past the data's time range. It tests O(log n) per-query boundary searches on sorted data with duplicate keys.

  AttentiveSoftware EngineerCoding & AlgorithmsTechnical Screen
• Remove Adjacent Duplicate Runs of Length KMedium

  Implement a linear-time string reduction algorithm that repeatedly eliminates adjacent runs of k identical characters using a stack.

  AttentiveSoftware EngineerCoding & AlgorithmsTechnical Screen
• Return Log Entries Within an Inclusive Time Range From a Sorted LogMedium

  Given an in-memory log sorted by integer timestamp, return every entry whose timestamp lies within an inclusive start and end time. The problem tests exact boundary handling with duplicate timestamps, empty results when the range misses the log, and locating a range efficiently in sorted data.

  AttentiveSoftware EngineerCoding & AlgorithmsOnsite
• Compute streaming sliding-window minimumsMedium

  This question evaluates a candidate's understanding of streaming algorithms and efficient data-structure techniques for maintaining sliding-window minima, measuring competency in algorithmic thinking, time and space complexity, and online processing.

  AuroraSoftware EngineerCoding & AlgorithmsTechnical Screen
• Evaluate an Arithmetic ExpressionMedium

  Evaluate arithmetic expressions containing non-negative integers and the four basic operators without using eval. Preserve precedence and left associativity, implement division that truncates toward zero, and process expressions up to 300,000 characters efficiently.

  AuroraSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement a reference-counted smart pointerHard

  This question evaluates understanding of C++ resource management, ownership semantics, RAII, and reference counting implementation within the coding and algorithms domain, emphasizing pointer semantics and object lifetime.

  AuroraSoftware EngineerCoding & AlgorithmsTechnical Screen
• Design body camera checkout systemMedium

  Design an in-memory inventory management system for body-worn cameras that supports O(1) registration, uniform random checkout, and checkin operations.

  AxonSoftware EngineerCoding & AlgorithmsOnsite
• Implement encryption and constant-time random setMedium

  This problem tests your ability to implement a cryptographic XOR-based transformation and design a randomized data structure with O(1) performance using an array-based map.

  AxonSoftware EngineerCoding & AlgorithmsOnsite
• Shortest Distance in an Unweighted Adjacency-Matrix GraphMedium

  This problem tests implementing breadth-first search (BFS) on an unweighted, undirected graph represented as an adjacency matrix to find the shortest path distance between two vertices.

  BCGForward Deploy EngineerCoding & AlgorithmsTechnical Screen
• Process Get and Set Operations in a Key-Value CacheHard

  This problem tests your ability to implement an efficient, thread-safe, and memory-constrained LRU (Least Recently Used) cache using a combination of a hash map and a doubly linked list.

  BalyasnySoftware EngineerCoding & AlgorithmsOnsite
• Compute maximum beauty of a stringMedium

  This question evaluates skills in string manipulation, frequency analysis, and optimization of weighted sums, focusing on assigning distinct values to characters to maximize an aggregate metric.

  Bank of AmericaData ScientistCoding & AlgorithmsOnline Assessment
• Convert number words to integerMedium

  This question evaluates textual number parsing, tokenization, and numeric mapping skills, testing string manipulation and lexical interpretation within the Coding & Algorithms domain for a Data Scientist role and emphasizing practical application rather than pure theoretical concepts.

  Bank of AmericaData ScientistCoding & AlgorithmsOnline Assessment
• Explain coding solution and alternativesMedium

  Explain coding solution and alternatives 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.

  Bank of AmericaData ScientistCoding & AlgorithmsOnline Assessment
• Return Cash-Register Change in Named DenominationsEasy

  Implement a cash register function that calculates change in standard currency denominations using integer arithmetic and returns the dispensed items sorted alphabetically.

  Bank of AmericaSoftware EngineerCoding & AlgorithmsOnline Assessment
• Parallelize chunked file download and verify integrityMedium

  This problem tests your ability to implement a concurrent file downloader that fetches file segments in parallel, handles partial failures with retries, and verifies overall data integrity using a checksum.

  BasetenSoftware EngineerCoding & AlgorithmsTechnical Screen
• Check Whether a String Is Built by RepetitionEasy

  This problem tests your ability to detect periodic string patterns using string manipulation or mathematical properties, specifically focusing on efficient substring identification.

  BeaconfireMachine Learning EngineerCoding & AlgorithmsTechnical Screen
• Implement Concurrent Utilities in C++Medium

  This question tests your ability to implement a thread-safe, generic blocking queue in C++ using synchronization primitives like mutexes and condition variables.

  BelvederetradingSoftware EngineerCoding & AlgorithmsOnsite
• Debug and Fix Failing Unit Tests in JavaMedium

  This question evaluates proficiency in debugging and maintaining a Java codebase with failing unit tests, testing competencies in unit testing, fault isolation, reading test assertions and stack traces, and verifying regression-free fixes.

  Bilt RewardsSoftware EngineerCoding & AlgorithmsTechnical Screen