practice a little every day, paws crossed ♡
Software Engineer 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 421–450 of 2629 results
- AsanaMediumSoftware EngineerReturn the K Closest Points with Deterministic Ties
This problem tests the ability to efficiently find the nearest neighbors to a target coordinate while maintaining a deterministic ordering for ties, ensuring reproducible results.
Coding & AlgorithmsOnsiteHeapSortingGeometry - AsanaMediumSoftware EngineerSolve a Jigsaw Puzzle
This question evaluates algorithmic problem-solving, constraint satisfaction, search and pruning strategies, and handling combinatorial state such as piece rotation and placement.
Coding & AlgorithmsTechnical Screen - Assort HealthMediumSoftware EngineerBuild Lab and Consultation Appointment Matches
Process raw 10-minute provider availability records into 30-minute appointment options and match consecutive lab and consultation appointments within a 60-minute wait window.
Coding & AlgorithmsTechnical ScreenIntervalsSortingTwo Pointers - AtlassianMediumSoftware EngineerAssign tennis bookings to minimum courts
Design an algorithm to assign a schedule of tennis court bookings to the minimum number of courts required, resolving resource contention efficiently.
Coding & AlgorithmsOnsiteIntervalsHeapGreedy - AtlassianMediumSoftware EngineerDesign a trie-based URL router with wildcards
Design a trie-based URL router with wildcards 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 - AtlassianMediumSoftware EngineerDetermine whether a word exists in a letter grid
Implement a backtracking search to determine if a target word can be formed by sequentially adjacent cells in a 2D character grid without reusing any cell.
Coding & AlgorithmsTechnical Screenbacktrackingdfsmatrix - AtlassianEasySoftware EngineerFilter Invalid Data Events
Tests your ability to implement a multi-condition event filtering and deduplication pipeline while preserving input order, along with complexity analysis for batch and stream processing.
Coding & AlgorithmsTechnical Screenhash-tabledata-processingarrays - AtlassianMediumSoftware EngineerFind nearest common manager for multiple employees
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.
Coding & AlgorithmsTechnical Screen - AtlassianMediumSoftware EngineerFind smallest common organization for employees
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.
Coding & AlgorithmsTechnical ScreenTreeLCADFS - AtlassianMediumSoftware EngineerHighlight the Shortest Unique Substring in Each Label
Find and highlight the shortest case-insensitive unique substring in each label using bracket notation, breaking ties by earliest index and preserving original casing.
Coding & AlgorithmsTechnical Screenstringshash-tabletrie - AtlassianMediumSoftware EngineerImplement sequential and parallel URL requests
Implement an asynchronous batch URL fetcher that executes requests with bounded concurrency, deduplicates network calls, preserves input order, and handles per-request errors gracefully.
Coding & AlgorithmsTechnical Screenconcurrencyasync-awaitnetworking - AtlassianMediumSoftware EngineerImplement sliding-window rate limiter function
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.
Coding & AlgorithmsTechnical ScreenConcurrencyData StructuresSliding Window - AtlassianMediumSoftware EngineerMerge intervals and design rating APIs
Tests interval merging logic alongside stateful data structure design for tracking agent performance, calculating streaming averages, and ranking agents with deterministic tie-breaking.
Coding & AlgorithmsTechnical Screenintervalsheaphash-table - AtlassianMediumSoftware EngineerMerge overlapping intervals
This problem tests your ability to manipulate array-based data structures, specifically focusing on sorting and linear-time interval merging logic.
Coding & AlgorithmsTechnical ScreenArraysSortingGreedy - AtlassianEasySoftware EngineerPer-Caller Request Limiter Over Non-Decreasing Time Buckets
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.
Coding & AlgorithmsTechnical Screen - AttentiveMediumSoftware EngineerEvaluate a Scoped Lisp Expression
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.
Coding & AlgorithmsOnsiterecursionparsinghash-table - AttentiveMediumSoftware EngineerFind Inclusive Index Ranges for Time-Window Queries on Timestamp-Sorted Logs
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.
Coding & AlgorithmsTechnical Screen - AttentiveMediumSoftware EngineerRemove Adjacent Duplicate Runs of Length K
Implement a linear-time string reduction algorithm that repeatedly eliminates adjacent runs of k identical characters using a stack.
Coding & AlgorithmsTechnical Screenstackstringalgorithms - AttentiveMediumSoftware EngineerReturn Log Entries Within an Inclusive Time Range From a Sorted Log
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.
Coding & AlgorithmsOnsite - AuroraMediumSoftware EngineerCompute streaming sliding-window minimums
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.
Coding & AlgorithmsTechnical Screen - AuroraMediumSoftware EngineerEvaluate an Arithmetic Expression
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.
Coding & AlgorithmsTechnical Screen - AuroraHardSoftware EngineerImplement a reference-counted smart pointer
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.
Coding & AlgorithmsTechnical Screen - AxonMediumSoftware EngineerDesign body camera checkout system
Design an in-memory inventory management system for body-worn cameras that supports O(1) registration, uniform random checkout, and checkin operations.
Coding & AlgorithmsOnsiteData StructuresHash TableRandomized Algorithms - AxonMediumSoftware EngineerImplement encryption and constant-time random set
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.
Coding & AlgorithmsOnsiteCryptographyHash MapArray - BalyasnyHardSoftware EngineerProcess Get and Set Operations in a Key-Value Cache
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.
Coding & AlgorithmsOnsiteHash MapLinked ListLRU Cache - Bank of AmericaEasySoftware EngineerReturn Cash-Register Change in Named Denominations
Implement a cash register function that calculates change in standard currency denominations using integer arithmetic and returns the dispensed items sorted alphabetically.
Coding & AlgorithmsOnline AssessmentGreedyStringMath - BasetenMediumSoftware EngineerParallelize chunked file download and verify integrity
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.
Coding & AlgorithmsTechnical ScreenConcurrencyI/OHashing - BelvederetradingMediumSoftware EngineerImplement Concurrent Utilities in C++
This question tests your ability to implement a thread-safe, generic blocking queue in C++ using synchronization primitives like mutexes and condition variables.
Coding & AlgorithmsOnsiteC++ConcurrencyMultithreading - Bilt RewardsMediumSoftware EngineerDebug and Fix Failing Unit Tests in Java
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.
Coding & AlgorithmsTechnical Screen - BitGoMediumSoftware EngineerSolve and extend the Knapsack problem
This question evaluates a candidate's understanding of dynamic programming for optimization problems, specifically the 0/1 knapsack formulation, space-optimized DP and the ability to reconstruct a chosen item set from compressed state.
Coding & AlgorithmsTechnical Screen
Asana
Atlassian
Attentive
Aurora
Axon
Bank of America
Baseten