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 571–600 of 2810 results
- BoeingEasySoftware EngineerExplain AWS access control and frontend typing
This question tests fundamental knowledge of cloud security primitives in AWS and modern frontend development patterns, specifically focusing on secure data access and robust TypeScript architecture.
Software Engineering FundamentalsTechnical ScreenAWSS3IAM - Booking.comMediumSoftware EngineerCompare heap, stack, Protobuf, gRPC, SQL, CI/CD
Compare heap, stack, Protobuf, gRPC, SQL, CI/CD evaluates requirements, scale assumptions, API/data design, architecture, trade-offs, failure modes, and rollout in a realistic interview setting. A strong answer states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
System DesignTechnical Screen - Booking.comMediumSoftware EngineerDesign an AI-Assisted Development Workflow
Design an end-to-end, safe AI-assisted development workflow incorporating bounded task scopes, structured agent skills, deterministic guardrail hooks, and automated review gates.
Software Engineering FundamentalsTechnical ScreenAI WorkflowsDeveloper ToolingSystem Design - BrexMediumSoftware EngineerAnswer Behavioral Questions
This question evaluates a candidate's behavioral competencies such as ownership, communication under pressure, conflict resolution, accountability, and motivation reflected in long-term goals.
Behavioral & LeadershipTechnical Screen - BrexMediumSoftware EngineerBuild AI-Assisted Full-Stack Transactions App
This question evaluates full‑stack engineering competencies including API design, data persistence, input validation, transactional integrity for monetary data, frontend-backend integration, automated testing, and developer documentation.
System DesignTechnical Screen - BrexMediumSoftware EngineerBuild a React color multi-select dropdown UI
This question evaluates front-end React skills including component architecture, state management, data-driven rendering, accessibility considerations, and performance trade-offs involved in implementing a multi-select dropdown that presents selected colors' properties.
Software Engineering FundamentalsTechnical Screen - BrexMediumSoftware EngineerDebug and Explain Fixes
This question evaluates a candidate's debugging and root-cause analysis skills, familiarity with unit testing and regression prevention, and ability to modify a small codebase to fix defects within the coding and algorithms domain.
Coding & AlgorithmsTechnical Screen - BrexHardSoftware EngineerDesign Points-from-Transactions Service
This question evaluates system design and distributed-systems competency, focusing on transaction processing, idempotency and deduplication, monetary precision and rounding, consistency models, data modeling, and operational controls like observability and fraud prevention.
System DesignTechnical Screen - BrexEasySoftware EngineerImplement discounted card purchases
This question evaluates implementation-level skills in resource accounting and state management, specifically handling gem-cost mappings, per-color discounts, bounded arithmetic, and transactional updates to player state.
Coding & AlgorithmsTechnical Screen - BrexMediumSoftware EngineerSplendor-Style Card Purchases with Gem Costs, Color Discounts and Concurrent Buys
Model a Splendor-style card game in code: check whether a player's five-color gem inventory can afford a card, make an all-or-nothing purchase, and apply discounts earned from cards already owned. A follow-up asks how to keep one player's simultaneous purchase requests safe and consistent.
Software Engineering FundamentalsTechnical Screen - BridgeMediumSoftware EngineerDesign Minesweeper and Optimize Click Performance
This question evaluates a candidate's competence in data structures, graph traversal and flood-fill concepts, complexity analysis, and scalable system design for sparse board representations.
Coding & AlgorithmsTechnical Screen - BridgeMediumSoftware EngineerDesign signup and login service
This question evaluates understanding of authentication system design, secure password storage practices, API endpoint and request/response modeling, database schema design, and session or token-based login state management.
System DesignTechnical Screen - BridgeMediumSoftware EngineerImplement a Stepped Iterator
Design and implement a stepped iterator class that wraps an underlying iterator or sequence, advancing by a configurable step size on each call. This tests iterator design, state management, invariant preservation, and edge-case handling.
Software Engineering FundamentalsTechnical ScreenDesignIteratorsData Structures - BridgeMediumSoftware EngineerSelect an Object by a Dynamic Integer Field
Implement a clean, defensive utility function to select a dictionary from a collection based on the minimum or maximum value of a dynamic integer field, properly handling missing keys and ties.
Software Engineering FundamentalsTechnical Screendata-manipulationpythonclean-code - BridgeMediumSoftware EngineerSolve path normalization and nested iterator
This question evaluates proficiency in string/path normalization, manipulation of hierarchical data structures, stack-based iterator design, lazy versus eager flattening strategies, and algorithmic time/space complexity analysis in the Coding & Algorithms domain.
Coding & AlgorithmsTechnical Screen - ByteDanceEasySoftware EngineerAdd Two Signed Decimal Character Arrays
This problem tests string manipulation, handling of sign logic, and carrying operations for large integer arithmetic without utilizing large integer libraries.
Coding & AlgorithmsTechnical ScreenStringsMathTwo Pointers - ByteDanceHardSoftware EngineerAssign Meetings and Find the Most-Used Room
Practice an interval-scheduling problem where meetings may be delayed and room-number tie rules affect the final count. The prompt tests precise simulation, large-input complexity, integer safety, and careful handling of simultaneous room availability.
Coding & AlgorithmsTechnical Screen - ByteDanceMediumSoftware EngineerBuild a Binary Tree from Descriptions
This problem tests tree traversal, hash map utilization for parent-child relationship tracking, and identification of the root node in a graph-based structure.
Coding & AlgorithmsTechnical ScreenTreesHash MapGraph - ByteDanceMediumSoftware EngineerBuild a Removable Timestamp-Ordered Task Scheduler
Design a task scheduler supporting task insertion/update, cancellation by ID, and retrieving ready tasks up to a given time limit using a min-heap with lazy deletion.
Coding & AlgorithmsTechnical Screenheaphash-tabledesign - ByteDanceHardSoftware EngineerBuild the Largest Allowed Number Below a Limit
This problem tests greedy algorithm design, string-based numeric comparison, and backtracking/recursive state management to construct the largest possible number under a given limit.
Coding & AlgorithmsTechnical ScreenGreedyStringsRecursion - ByteDanceMediumSoftware EngineerC++ vs Go for Backend Services: Memory, Concurrency and Trade-offs
From a TikTok backend intern interview: compare C++ and Go across memory management, concurrency, error handling, language features and tooling, and explain when each language is the better choice for a service. It tests practical understanding of runtime trade-offs rather than syntax trivia.
Software Engineering FundamentalsTechnical Screen - ByteDanceMediumSoftware EngineerCheck Whether Every Course Can Be Completed Under Prerequisite Rules
A graph feasibility problem: given n courses and pairs stating which course must be completed before another, decide whether every course can be finished. It tests modeling dependencies as a directed graph, recognizing circular requirements, and handling courses that fall into separate, disconnected groups.
Coding & AlgorithmsTechnical Screen - ByteDanceMediumSoftware EngineerCheck Whether an n x n Tic-Tac-Toe Game Is Over (Win or Draw)
Given an n x n tic-tac-toe board holding empty cells and two players' marks, decide whether the game is over because one player occupies an entire row, column or diagonal, or because the board is full with no winner. It tests complete line checks, draw detection and edge cases such as all-empty lines and a 1 x 1 board.
Coding & AlgorithmsTechnical Screen - ByteDanceMediumSoftware EngineerChoose Between REST, WebSocket, and Server-Sent Events for an Agent Runtime
This question tests the ability to evaluate communication protocols based on specific architectural requirements, including bidirectional signaling, state recovery, and infrastructure overhead.
Software Engineering FundamentalsTechnical ScreenSystem DesignProtocolsAPI Design - ByteDanceMediumSoftware EngineerChoose Precision, Recall, or F1 for Agent Evaluation
This question tests the ability to map business objectives and error costs to appropriate classification metrics in a real-world system context.
Machine LearningTechnical ScreenMetricsClassificationModel Evaluation - ByteDanceMediumSoftware EngineerClockwise Spiral Traversal of a Matrix With O(1) Extra Space and No Mutation
From a TikTok backend intern interview: return the elements of an m x n matrix in clockwise spiral order using only constant extra space beyond the output, without a visited marker and without modifying the matrix. It tests careful traversal logic and off-by-one handling when a single row or column remains.
Coding & AlgorithmsTechnical Screen - ByteDanceMediumSoftware EngineerCompute root-to-leaf number sum
This problem tests your ability to perform depth-first search on a binary tree and maintain state (the current path sum) during the traversal to compute a cumulative total.
Coding & AlgorithmsTechnical ScreenTreesDFSRecursion - ByteDanceMediumSoftware EngineerCount Similar Photo Groups
This question evaluates understanding of graph connectivity and equivalence relations, requiring recognition of connected components from an adjacency-matrix representation of pairwise similarity.
Coding & AlgorithmsTechnical Screen - ByteDanceHardSoftware EngineerCount Target-Sum Paths in an N-ary Tree
This problem tests the ability to navigate tree structures and use hash maps to track cumulative path sums efficiently, specifically in the context of an N-ary tree.
Coding & AlgorithmsTechnical ScreenTreesDFSPrefix Sum - ByteDanceMediumSoftware EngineerDefend a Project's Schema, Indexes, and Concurrency Model
Practice defending a database design by connecting schema choices, indexes, consistency behavior, and concurrency controls to concrete access patterns. The solution explains how to reason about CAP trade-offs, lost-update prevention, transaction boundaries, and the operational cost of each index.
Software Engineering FundamentalsTechnical Screen
Booking.com
Brex