practice a little every day, paws crossed ♡
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 691–720 of 3640 results
- ByteDanceMediumSoftware EngineerDetect a Pythagorean Triple in an Integer Array
This problem tests the ability to optimize a brute-force approach into an efficient search using sorting and the two-pointer technique to satisfy a geometric condition.
Coding & AlgorithmsOnsiteArraysTwo PointersSorting - ByteDanceMediumSoftware EngineerExplain Why You Want to Change Roles
This question assesses the candidate's professional maturity, self-awareness, and ability to frame career transitions as proactive pursuits of growth rather than reactions to negative past experiences.
Behavioral & LeadershipOnsiteBehavioralCareer GrowthCommunication - ByteDanceMediumSoftware EngineerFind Maximum Candies With Two Types
This question evaluates algorithmic problem-solving with arrays, focusing on managing constraints on the number of distinct element types in a contiguous sequence and maintaining element frequency/state during a traversal.
Coding & AlgorithmsOnsite - ByteDanceMediumSoftware EngineerFind Words in a Character Grid
This question evaluates algorithm design for efficient multi-word search in a character grid, testing competencies in constrained graph traversal, managing large dictionaries, and selecting data structures for efficient lookup.
Coding & AlgorithmsOnsite - ByteDanceMediumSoftware EngineerFind the Minimum Window Containing a Multiset of Characters
This problem tests your ability to use the two-pointer sliding window technique combined with a frequency map to identify the smallest valid substring efficiently.
Coding & AlgorithmsOnsiteSliding WindowHash MapStrings - ByteDanceMediumSoftware EngineerFind the N-th Highest Bid in an Auction Log Without a Heap
Given an unordered list of auction bids, return the n-th highest one, treating two equal bid amounts as distinct entries, while a heap-based solution is off the table. Tests selection algorithms faster than full sorting, correct handling of duplicate values, and justifying the achieved time complexity.
Coding & AlgorithmsOnsitequickselectarraysselection - ByteDanceMediumSoftware EngineerHand-Write a Multi-Head Attention Layer: Projections, Head Splitting and Masking
Write a multi-head attention layer from scratch: project queries, keys and values, split them into heads, apply scaled dot-product attention with optional padding or causal masks, and merge the heads. It tests tensor shape discipline, numerical stability, and the cost of attention as sequence length grows.
Machine LearningOnsite - ByteDanceHardData ScientistHow to deploy and tune multimodal models?
A six-part ByteDance data scientist onsite ML interview covering deploying and tuning multimodal models under GPU/VRAM, compute, and latency constraints; designing fast video retrieval over precomputed captions and embeddings with ANN and hybrid reranking; and deep-learning fundamentals — overfitting detection and mitigation, dropout and inverted-dropout scaling, normalization layers (BatchNorm/LayerNorm/GroupNorm/InstanceNorm/RMSNorm), and reinforcement learning for LLM post-training (RLHF). It tests practical systems tradeoffs alongside theoretical foundations across ML systems, retrieval, and reinforcement learning.
Machine LearningOnsite - ByteDanceMediumSoftware EngineerImplement Sliding Windows and LRU Cache
This question evaluates algorithmic problem-solving and data-structure design, testing sliding-window and 2D submatrix reasoning for maximizing contiguous ones with bounded flips and the design of an LRU cache that enforces O(1) get/put semantics.
Coding & AlgorithmsOnsite - ByteDanceHardData ScientistImplement stack variants and upward path sum
A four-part ByteDance Data Scientist onsite coding question: implement an O(1) MinStack, a MaxStack with peekMax/popMax, a streaming median finder, and a binary-tree upward (node-to-ancestor) path-sum check. It tests data-structure augmentation, streaming order statistics, and prefix-sum tree reasoning.
Coding & AlgorithmsOnsite - ByteDanceHardSoftware EngineerLeast Frequently Used (LFU) Cache
This problem tests the ability to design an O(1) time complexity cache that evicts the least frequently used items, using recency as a tie-breaker.
Coding & AlgorithmsOnsiteHash MapLinked ListData Structures - ByteDanceMediumSoftware EngineerMerge overlapping closed intervals into a sorted list of disjoint intervals
Coding problem: given closed integer intervals in any order, merge every group of overlapping or touching intervals and return the disjoint result sorted by start. It tests interval reasoning, correct handling of shared endpoints, duplicates and nested intervals, and a well-defined output order.
Coding & AlgorithmsOnsite - ByteDanceMediumSoftware EngineerModel Campaigns, Targeting, and Edit History for a Demand-Side Ad Platform
Model a demand-side ad platform with advertisers, campaigns, ad groups, ads, and creatives, including audience rules, edit history, and versioned publishing.
System DesignOnsite - ByteDanceMediumSoftware EngineerOrder Named Tasks by Dependencies, Choosing the Alphabetically Smallest Order
Given named tasks and before-and-after dependency pairs, return an order that satisfies every dependency, choosing the alphabetically smallest valid order, or an empty list when the dependencies contain a cycle. It tests topological sorting, cycle detection and deterministic tie-breaking.
Coding & AlgorithmsOnsite - ByteDanceEasySoftware EngineerPrepare for an SRE Systems Fundamentals Round
This question tests your understanding of Linux process management, memory utilization, and the practical troubleshooting steps required to handle a production service experiencing memory exhaustion.
Software Engineering FundamentalsOnsiteLinuxSREMemory Management - ByteDanceMediumSoftware EngineerReport the winner after each move on an n-by-n tic-tac-toe board
Coding problem: replay an n-by-n tic-tac-toe game from a list of moves and report after every move whether the player who just moved has filled a row, a column or either diagonal. It tests efficient win detection on large boards and careful handling of diagonal and anti-diagonal cells.
Coding & AlgorithmsOnsite - ByteDanceMediumSoftware EngineerResolve a Meaningful Disagreement
This question assesses the candidate's ability to navigate professional conflict through evidence-based reasoning, emotional intelligence, and a focus on collective project success.
Behavioral & LeadershipOnsiteConflict ResolutionCommunicationLeadership - ByteDanceMediumSoftware EngineerRunning Median After Each Number in a Data Stream
Numbers arrive one at a time from a stream; after each arrival, return the median of everything received so far, averaging the two middle values when the count is even. The problem tests keeping order statistics up to date efficiently as a data stream grows.
Coding & AlgorithmsOnsite - ByteDanceMediumSoftware EngineerSet Boundaries and Priorities in a High-Intensity Environment
This question assesses a candidate's ability to navigate high-pressure work environments by balancing personal sustainability with business objectives, focusing on prioritization strategies and escalation frameworks.
Behavioral & LeadershipOnsiteLeadershipPrioritizationCommunication - ByteDanceMediumSoftware EngineerSolve Search Speed and String Product
This pair of problems evaluates algorithm design and implementation skills, focusing on efficient search/optimization for constrained processing speed and manual arbitrary-precision string multiplication for very large integers.
Coding & AlgorithmsOnsite - C3 AIMediumData ScientistDecompress an encoded string
Decompress an encoded string 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 & AlgorithmsOnsite - C3 AIMediumData ScientistDescribe challenge, influence, and mentorship outcomes
This question evaluates leadership competencies for a Data Scientist role, including influence and persuasion, mentoring, prioritization, trade-off reasoning, and the ability to quantify impact through metrics.
Behavioral & LeadershipOnsite - C3 AIEasySoftware EngineerDesign a restaurant reservation system
This question evaluates skills in system architecture and engineering, including data modeling, API design, concurrency control to prevent double-booking, availability and scheduling logic, scalability under traffic spikes, and operational concerns like auditability and low-latency queries.
System DesignOnsite - C3 AIHardData ScientistExplain an End-to-End ML Project to Mixed Audiences
This question assesses the ability to articulate a technical machine learning project, balancing depth for engineers with accessibility for non-technical stakeholders, while demonstrating rigorous problem-solving.
Behavioral & LeadershipOnsiteBehavioralML LifecycleCommunication - C3 AIMediumData ScientistExplain key ML/stats concepts
Explain key ML/stats concepts evaluates core ML concepts, assumptions, math intuition, training/evaluation trade-offs, and practical failure modes in a realistic interview setting. A strong answer states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Machine LearningOnsite - C3 AIHardData ScientistFind the Intersection of Two Linked Chains
This problem tests the ability to detect the intersection point of two singly linked lists with constant space complexity, focusing on pointer manipulation and list traversal techniques.
Coding & AlgorithmsOnsiteLinked ListsTwo PointersAlgorithms - C3 AIHardData ScientistGive Evidence-Based Strengths, Weaknesses, and Feedback
This question tests the candidate's self-awareness, professional maturity, and ability to translate past critiques into tangible behavioral growth.
Behavioral & LeadershipOnsiteLeadershipSelf-AwarenessCommunication - C3 AIHardData ScientistReduce Fresh-Food Waste with an End-to-End ML Approach
This problem tests the ability to design an integrated ML system that moves beyond simple demand forecasting by addressing inventory dynamics, supply constraints, and decision optimization.
ML System DesignOnsiteSupply ChainOptimizationCensored Data - Capital OneHardData ScientistAddress face recognition concerns with stakeholders
This question evaluates competency in risk identification and prioritization, privacy and regulatory compliance, model fairness and governance, technical verification metrics such as liveness and accuracy, and stakeholder management for biometric system deployment.
Behavioral & LeadershipOnsite - Capital OneMediumSoftware EngineerAnalyze and Debug Virtual-Card Payment Rules
Implement and debug a rule-validation engine for virtual card authorization that accurately parses currency strings into integer cents and evaluates spending boundaries and merchant restrictions.
Software Engineering FundamentalsOnsitePythonData ParsingBoundary Conditions
C3 AI
Capital One