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 391–420 of 2629 results
- Applied IntuitionMediumSoftware EngineerEvaluate Dependent Variable Assignments
Evaluate a list of variable assignment statements where variable values can depend on variables defined later in the input. The problem tests expression parsing, cycle detection, dependency resolution via topological ordering or memoized depth-first search, and deep recursion handling.
Coding & AlgorithmsTechnical Screengraphtopological-sortparsing - Applied IntuitionEasySoftware EngineerEvaluate variables in simple arithmetic DSL
This question evaluates implementation skills in parsing and evaluating a small arithmetic DSL, covering variable assignment parsing, symbol resolution, and evaluation order; it falls under the Coding & Algorithms category and emphasizes practical application and engineering of a correct evaluator rather than abstract theory.
Coding & AlgorithmsTechnical Screen - Applied IntuitionMediumSoftware EngineerFind duplicate files by size
This question evaluates file parsing, data deduplication and grouping skills along with algorithmic efficiency and space-time trade-offs when identifying duplicate files by size rather than by content.
Coding & AlgorithmsTechnical Screen - Applied IntuitionMediumSoftware EngineerFind first and last occurrence in sorted array
This question tests the ability to modify the standard binary search algorithm to achieve logarithmic time complexity when searching for the boundary indices of a target value in a sorted array.
Coding & AlgorithmsTechnical ScreenBinary SearchArrayAlgorithms - Applied IntuitionMediumSoftware EngineerFind grid cell minimizing sum distances
This question evaluates proficiency in grid-based graph traversal and shortest-path computation using BFS, reachability analysis from multiple marked points, and algorithmic time/space complexity reasoning.
Coding & AlgorithmsTechnical Screen - Applied IntuitionEasySoftware EngineerFind intersection of two line segments
This question evaluates a candidate's skills in computational geometry and numerical robustness, focusing on line-segment intersection reasoning, endpoint touching, collinearity, and precision handling.
Coding & AlgorithmsOnsite - Applied IntuitionEasySoftware EngineerGroup duplicate files by content
This question evaluates understanding of file deduplication, efficient I/O and hashing strategies, streaming large-file processing, and scalable algorithm design for identifying files with identical byte-for-byte contents.
Coding & AlgorithmsOnsite - Applied IntuitionMediumSoftware EngineerImplement a fixed-capacity generic circular buffer
This question tests the ability to implement a space-efficient data structure using fixed-size arrays, modular arithmetic for index wrapping, and generic type constraints.
Coding & AlgorithmsOnsiteData StructuresArraysGenerics - Applied IntuitionMediumSoftware EngineerImplement a single-thread task scheduler API
This problem tests your ability to design a priority-based scheduler using a min-heap to manage tasks triggered by relative or absolute timestamps, ensuring execution occurs in the correct temporal order.
Coding & AlgorithmsOnsiteData StructuresPriority QueueAlgorithms - Applied IntuitionHardSoftware EngineerMerge Overlapping Collinear Lane Segments Given as Integer Point Lists
Merge straight lane segments, each given as a list of collinear integer points, so that segments lying on the same line whose extents overlap or touch become one segment containing all of their points. It tests exact collinearity checks, handling of horizontal and vertical segments, and interval merging along each line.
Coding & AlgorithmsTechnical Screen - Applied IntuitionHardSoftware EngineerMerge Overlapping Collinear Segments
This question evaluates computational geometry and algorithm design skills, focusing on collinearity testing, projecting points onto a line, merging overlapping 1D intervals generalized to arbitrary lines, ordering points along a line, and handling duplicates and edge cases.
Coding & AlgorithmsTechnical Screen - Applied IntuitionHardSoftware EngineerMerge Overlapping Straight Fence Runs From a Property Survey
Collapse a pile of straight fence-line survey readings into one run per physically continuous stretch of fence, by detecting which readings sit on the same infinite line and connect up. Tests exact collinearity detection, correct handling of every orientation, and interval merging per line.
Coding & AlgorithmsTechnical Screengeometryunion-findsorting - Applied IntuitionMediumSoftware EngineerMerge collinear overlapping 2D segments
This problem tests your ability to handle geometric data by identifying and merging overlapping segments that lie on the same infinite line.
Coding & AlgorithmsTechnical ScreenGeometryIntervalsSorting - Applied IntuitionMediumSoftware EngineerMerge overlapping 2D line segments
This problem tests your ability to handle geometric data by sorting and merging 1D intervals that exist within a 2D space, specifically focusing on collinear segments.
Coding & AlgorithmsTechnical ScreenGeometrySortingIntervals - Applied IntuitionMediumSoftware EngineerMulti-Agent Collision Simulator (Unicycle Kinematics)
Implement a discrete-time multi-agent simulator using unicycle kinematics and forward Euler integration to track agent trajectories and detect inter-agent collisions.
Coding & AlgorithmsTechnical ScreenRoboticsSimulationGeometry - Applied IntuitionMediumSoftware EngineerParse a protobuf-like schema and answer queries
This problem tests your ability to parse a hierarchical schema definition, resolve nested type references using a symbol table, and implement an efficient lookup function for type paths.
Coding & AlgorithmsTechnical ScreenParsingTrieHash Table - Applied IntuitionMediumSoftware EngineerScale Game of Life to huge matrices
This question tests the ability to optimize grid-based simulations that exceed local memory capacity, focusing on sliding windows, buffer management, and efficient disk I/O.
Coding & AlgorithmsTechnical ScreenAlgorithmsSystem-DesignI/O-Optimization - Applied IntuitionHardSoftware EngineerTrack simulations and report timeouts
This question evaluates competency in algorithms and data-structure design for real-time stream processing, including maintaining per-simulation state, handling time-based expirations, and reasoning about performance and correctness.
Coding & AlgorithmsTechnical Screen - Applied IntuitionMediumSoftware EngineerValidate JSON against a protobuf-like schema
This problem tests your ability to recursively validate a JSON object against a structured schema definition and handle field presence constraints.
Coding & AlgorithmsTechnical ScreenRecursionJSONValidation - ApplovinHardSoftware EngineerCount invalid nodes in a BST
This question evaluates understanding of binary search tree invariants and the ability to identify nodes that violate ancestor-imposed value ranges, testing competency with tree data structures and constraint propagation in the coding & algorithms domain.
Coding & AlgorithmsTechnical Screen - AristaEasySoftware EngineerFind missing value in sorted consecutive array
This question evaluates understanding of array properties and algorithmic complexity, specifically detecting a single missing element in a sorted consecutive sequence within the Coding & Algorithms category.
Coding & AlgorithmsTechnical Screen - AristaEasySoftware EngineerRemove Target Values from a Linked List
This question evaluates proficiency with singly linked list manipulation, specifically in-place node removal and correct pointer/reference management. It is commonly asked to assess practical coding ability with data structures, handling of edge cases and resource implications; category: Coding & Algorithms (Data Structures), level of abstraction: practical implementation-focused.
Coding & AlgorithmsTechnical Screen - AristaEasySoftware EngineerSolve palindrome and missing-number variants
This question evaluates competencies in string processing, array manipulation, binary search, and algorithmic complexity analysis by asking a palindrome check and a missing-number problem that requires both O(n) and O(log n) reasoning, emphasizing edge-case handling and time/space complexity discussion.
Coding & AlgorithmsTechnical Screen - ArmadaMediumSoftware EngineerFetch paginated data from two APIs
This question evaluates a candidate's competency in robust API retrieval, pagination handling, defensive data validation, and joining records across endpoints while preserving the order of source records and safely handling missing or malformed fields.
Coding & AlgorithmsTechnical Screen - Art AdvisorsMediumSoftware EngineerSolve common array/graph interview problems
This problem tests your ability to manipulate matrices for grid traversal, apply BFS for shortest-path discovery in string transformations, and optimize sorting or counting logic for metric calculations.
Coding & AlgorithmsTechnical ScreenGraphBFSSorting - AsanaMediumSoftware EngineerCompute Products Excluding Each Index
This question evaluates array manipulation skills, arithmetic reasoning with cumulative products, edge-case handling for zeros and negative numbers, and time/space complexity optimization for in-place or constant-extra-space algorithms.
Coding & AlgorithmsOnsite - AsanaMediumSoftware EngineerFind the K Closest Points to the Origin
This problem tests proficiency with heap-based priority queues and custom sorting logic for spatial coordinates.
Coding & AlgorithmsTechnical ScreenSortingHeapGeometry - AsanaMediumSoftware EngineerImplement an ASCII Art Printer
This question evaluates the ability to implement text rendering and string/array manipulation concepts, including glyph concatenation with inter-character spacing, newline-preserved blocks, blank glyph rendering for spaces, and handling of unsupported characters.
Coding & AlgorithmsOnsite - AsanaMediumSoftware EngineerImplement core puzzle/array/grid routines
This question set evaluates algorithmic problem-solving competencies including backtracking and constraint satisfaction for jigsaw assembly, simulation and state manipulation for ASCII canvas and 2048 move logic, and linear-time in-place array transformation for the product-of-array problem.
Coding & AlgorithmsOnsite - AsanaMediumSoftware EngineerPick the K Values Nearest a Target in a Sorted Integer Array
A coding exercise on a sorted integer array: return the k elements nearest a target value in ascending order, where equal distances favor the smaller value. It tests exploiting sorted order, handling targets outside the array's range, and treating duplicate values correctly.
Coding & AlgorithmsOther
Applied Intuition
Arista
Asana