practice a little every day, paws crossed ♡
Coding & Algorithms 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 631–660 of 1080 results
- MetaMediumMachine Learning EngineerSolve linked list, tree, and grid problems
This set evaluates mastery of core data structures and algorithmic reasoning across singly linked lists (cycle entry detection), binary search trees with parent pointers (in-order successor), constant-time state tracking for n×n game boards, and grid connectivity for maximizing component size, emphasizing pointer manipulation, traversal logic, state-design, and component analysis. Commonly asked to gauge proficiency in Coding & Algorithms and complexity analysis, these problems test both conceptual understanding of traversal and connectivity principles and practical application of space- and time-efficient implementations under typical interview constraints.
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerSolve linked-list and top-K algorithm tasks
This question evaluates competency in fundamental data structures and algorithmic techniques, including linked list manipulation, frequency counting and top‑K retrieval, closest-point geometric queries, and stack-based string processing for repeated deletions.
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerSolve peak element and unique word abbreviation
This question evaluates algorithmic design and data-structure skills by combining a binary-search peak-finding problem with a string-abbreviation uniqueness problem, testing competence in time-complexity reasoning and creation of minimal unique representations.
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerSolve three LeetCode coding problems
The trio of problems — Minimum Remove to Make Valid Parentheses, Making a Large Island, and Binary Tree Right Side View — evaluates algorithmic problem-solving, proficiency with core data structures (strings, grids/graphs, and trees), and awareness of time and space complexity.
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerSolve tree leaf sum and target indices search
This question evaluates proficiency in tree traversal and array search algorithms, specifically handling recursive depth-first traversal with path-based numeric accumulation and performing logarithmic-time search over sorted data.
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerSolve tree traversal and two-pointer problems
Solve tree traversal and two-pointer problems 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 - MetaMediumSoftware EngineerSolve word count, node, segmentation, stock tasks
This multipart question evaluates skills in tokenization and streaming text processing, generic rooted-tree data-structure design and traversal APIs, dictionary-based string segmentation (dynamic programming and prefix/prefix-structure optimization), and constrained algorithmic optimization for stock-trading problems.
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerSum Numbers Formed by Root-to-Leaf Paths
Tests traversal of a complete or sparse binary tree stored in an array, tracking path values to accumulate the total sum of numbers formed from root to leaf.
Coding & AlgorithmsOnsiteTreeDFSBinary Heap - MetaMediumData EngineerValidate carpool capacity
This question evaluates understanding of interval-based resource accounting and algorithmic reasoning with cumulative constraints, assessing skills in processing time-bound events and managing capacity limits.
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerValidate word abbreviation and reconcile two abbreviations
Validate word abbreviation and reconcile two abbreviations 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 - MetaHardData EngineerWrite SQL for car rental utilization by city
This question evaluates proficiency in SQL querying and relational data modeling, focusing on time-interval overlap logic, distinct aggregation across joined tables, null handling, and safe computation of utilization metrics.
Coding & AlgorithmsOnsite - MicrosoftMediumSoftware EngineerAnswer Running Median Queries Over a Stream of Inserted Integers
A coding problem that processes a stream of add and median operations and returns, for every query, the median of all integers inserted so far. It tests choosing data structures that keep the middle of a growing collection quickly accessible, plus correct averaging when the count is even.
Coding & AlgorithmsOnsite - MicrosoftHardSoftware EngineerAnswer suffix maximum-frequency queries
This problem tests your ability to optimize range frequency queries using precomputation and efficient data structures, specifically focusing on suffix-based constraints.
Coding & AlgorithmsOnsiteBinary SearchData StructuresArrays - MicrosoftHardSoftware EngineerAssemble async stream reads into objects
This problem tests your ability to handle partial reads from an asynchronous stream and correctly parse length-prefixed binary data structures.
Coding & AlgorithmsOnsiteAsyncStreamsBinary-Parsing - MicrosoftMediumSoftware EngineerBucket Words That Are Letter Rearrangements of One Another
A coding exercise that partitions a list of lowercase words into groups whose members use exactly the same letters with the same counts, returned in a fixed canonical order. It tests efficient grouping over up to ten thousand words, handling duplicates and empty strings, and producing deterministic sorted output.
Coding & AlgorithmsOnsite - MicrosoftMediumSoftware EngineerCheck a Linked List Palindrome Without Mutating It
Check whether a singly linked list is a palindrome in O(n) time and O(1) pointer space without leaving it modified. Practice finding the midpoint, reversing the second half, comparing values, and restoring every link before return.
Coding & AlgorithmsOnsite - MicrosoftMediumSoftware EngineerCheck palindrome number and next palindrome
This question tests your ability to manipulate digits of an integer to identify palindromes and efficiently construct the smallest palindrome greater than a given number.
Coding & AlgorithmsOnsiteMathStringsAlgorithms - MicrosoftMediumSoftware EngineerConvert a Hexadecimal Address to Dotted IPv4
Convert an eight-digit hexadecimal address to network-order dotted IPv4 with strict validation, optional prefixes, and correct high-bit handling.
Coding & AlgorithmsOnsite - MicrosoftMediumSoftware EngineerCount the Separate Land Regions in a Binary Grid Map
A coding exercise that counts the separate land regions in a grid map of land and water cells, where land cells connect only through shared edges. It tests systematic exploration of a two-dimensional grid, correct neighbor handling at borders and corners, and scaling to large grids where one region may cover everything.
Coding & AlgorithmsOnsite - MicrosoftHardSoftware EngineerDecode a JWT string without libraries
This problem tests your understanding of the JSON Web Token (JWT) structure and your ability to manually implement Base64URL decoding and JSON deserialization in a constrained environment.
Coding & AlgorithmsOnsiteString ManipulationEncodingSecurity - MicrosoftMediumApplied ScientistFewest Distinct Values to Delete So at Least Half the Array Is Removed
A coding question that asks for the fewest distinct values whose complete deletion removes at least half of an integer array. It tests reasoning about how often each value occurs, proving that a choice is minimal, and the exact meaning of half when the array length is odd.
Coding & AlgorithmsOnsite - MicrosoftMediumSoftware EngineerFind shortest substring with n unique letters
This question evaluates proficiency in string processing, frequency management, and algorithmic optimization for locating constrained contiguous substrings. Commonly asked in the coding & algorithms domain because it reveals how candidates reason about character distinctness and efficiency trade-offs, it targets practical application of algorithmic techniques rather than purely conceptual theory.
Coding & AlgorithmsOnsite - MicrosoftMediumSoftware EngineerFind the Most Visited Track Position
Determine the most frequently visited track position given a series of sprint endpoints by efficiently tallying overlapping intervals.
Coding & AlgorithmsOnsitearraysprefix-sumdifference-array - MicrosoftMediumSite Reliability EngineerFind where two singly linked lists merge, given each as a sequence of node ids
Coding practice question: two singly linked lists that may merge into a shared tail are given as sequences of node ids, and you must return the id of the node where they first meet, or -1. It tests reasoning about linked list structure, linear-time traversal, and edge cases such as no shared node or one list being the other's tail.
Coding & AlgorithmsOnsite - MicrosoftMediumSoftware EngineerIdentify the Extra Directed Edge
This question evaluates understanding of graph theory concepts—directed trees, parent-child constraints, and cycle detection—and measures competency in reasoning about how a single extra directed edge can violate rooted-tree properties.
Coding & AlgorithmsOnsite - MicrosoftMediumSoftware EngineerImplement Calendar, Tokenizer, and Meeting Optimizer
This problem tests your ability to parse structured meeting request strings into interval objects and then identify the largest subset of non-overlapping meetings that can be scheduled within a fixed workday.
Coding & AlgorithmsOnsiteIntervalsParsingGreedy - MicrosoftMediumMachine Learning EngineerImplement K-Means and Detect Divisible Subarrays
This question evaluates a candidate's ability to implement an iterative clustering algorithm (K-means) and to reason about subarray sums modulo k, testing competencies in numerical computation, centroid management, edge-case handling, and efficient algorithm design.
Coding & AlgorithmsOnsite - MicrosoftMediumSoftware EngineerImplement Matrix Move and Logger
This problem tests in-place array manipulation for submatrix coordinate transformations and the implementation of a thread-safe, time-windowed rate limiter using a sliding window approach.
Coding & AlgorithmsOnsiteArraysHash TableSliding Window - MicrosoftMediumSoftware EngineerImplement Memory Allocation and In-Memory Records
This problem tests your ability to manage a block of contiguous memory via a free-list and maintain a hierarchical data structure for user records.
Coding & AlgorithmsOnsiteMemory ManagementData StructuresGraphs - MicrosoftMediumSoftware EngineerImplement SQL Table and DNA Ordering
This question evaluates a candidate's skills in robust input parsing, in-memory data modeling, API design, and sequence reconstruction from linked fragments, covering string handling, edge-case handling for CSV, and graph-like ordering of sequence fragments.
Coding & AlgorithmsOnsite
Meta
Microsoft