Coding & Algorithms interview questions

Showing 1861–1890 of 3276 results

• Implement Memory Allocation and In-Memory RecordsMedium

  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.

  MicrosoftSoftware EngineerCoding & AlgorithmsOnsite
• Implement SFT Sample PackingMedium

  This problem tests your ability to efficiently pack variable-length sequences into fixed-length blocks for training, ensuring padding tokens do not influence the loss calculation.

  MicrosoftMachine Learning EngineerCoding & AlgorithmsHR Screen
• Implement SQL Table and DNA OrderingMedium

  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.

  MicrosoftSoftware EngineerCoding & AlgorithmsOnsite
• Implement a Snapshot Set IteratorMedium

  This problem tests your ability to design a data structure that maintains point-in-time consistency for an iterator despite subsequent modifications to the underlying collection.

  MicrosoftSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement a rate limiter at scaleMedium

  This problem tests your ability to implement an efficient, thread-safe rate limiter using a sliding window algorithm to ensure a request quota is enforced across a distributed environment.

  MicrosoftSoftware EngineerCoding & AlgorithmsOnsite
• Implement a sliding-window rate limiter allow()Hard

  This problem tests your ability to implement a thread-safe rate limiter using a sliding window algorithm to ensure a service stays within specified traffic constraints.

  MicrosoftSoftware EngineerCoding & AlgorithmsOnsite
• Implement a type-based mutex for tasksMedium

  This problem tests knowledge of synchronization primitives, dictionary-based locking mechanisms, and the ability to manage resource contention based on dynamic categorization.

  MicrosoftSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement array and tree traversal tasksHard

  This problem tests your ability to optimize an array-based trading algorithm using a greedy approach and your mastery of level-order tree traversal to extract a specific view of a binary tree.

  MicrosoftSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement cache and merge intervalsMedium

  This question tests the ability to implement a fixed-capacity Least Recently Used (LRU) cache using hash maps and doubly-linked lists, followed by a classic interval processing algorithm to merge overlapping segments.

  MicrosoftMachine Learning EngineerCoding & AlgorithmsOnsite
• Implement concurrent structures and debug queue codeHard

  This question evaluates data-structure implementation and concurrent programming competencies by testing construction of an LRU cache, a custom hash map, a quadtree spatial index, and debugging of a producer-consumer queue.

  MicrosoftSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement four data-structure/string geometry tasksMedium

  This problem tests foundational skills in string arithmetic, parsing, coordinate geometry, and segment tree-based range queries.

  MicrosoftSoftware EngineerCoding & AlgorithmsOnsite
• Implement greedy decoding and beam searchMedium

  This question evaluates understanding of autoregressive decoding strategies—greedy decoding and beam search—including cumulative log-probability scoring, beam maintenance, EOS handling, and sequence expansion logic; it is categorized under Coding & Algorithms for Software Engineer roles.

  MicrosoftSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement idempotent request handling with idempotency keysHard

  This problem tests your ability to design a thread-safe idempotency layer that ensures an API endpoint processes identical requests exactly once, even in the presence of concurrent execution.

  MicrosoftSoftware EngineerCoding & AlgorithmsOnsite
• Implement lower_bound on unknown-size sorted arrayHard

  This question evaluates ability to design efficient search algorithms for unknown-length non-decreasing arrays accessed via a limited get(i) API, emphasizing correctness proof and tight query/time complexity bounds.

  MicrosoftData ScientistCoding & AlgorithmsOnsite
• Implement rotated array binary search with duplicatesMedium

  This question evaluates algorithm design and analysis skills, focusing on binary-search variants, handling duplicates in rotated non-decreasing arrays, rotation-index reasoning, and rigorous edge-case analysis; domain: Coding & Algorithms, specifically search algorithms and array manipulation.

  MicrosoftData ScientistCoding & AlgorithmsOnsite
• Implement tree traversals, BFS, and subsets generationMedium

  This question evaluates proficiency with fundamental data structures and algorithms—binary tree traversals (preorder, inorder, postorder), breadth-first search on unweighted graphs, and power-set/subset generation—emphasizing implementation choices between recursive and iterative approaches and required time and space complexity reasoning.

  MicrosoftSoftware EngineerCoding & AlgorithmsOnsite
• In-Memory URL Shortener: Encode and DecodeMedium

  Design an in-memory URL shortener class supporting fast encoding and decoding between original long URLs and compact short URLs using hash maps.

  MicrosoftSoftware EngineerCoding & AlgorithmsTechnical Screen
• Insert Spaces to Rebuild a Sentence from Dictionary WordsMedium

  A coding question that asks you to insert spaces into a string that lost them so that every piece is a dictionary word, returning the smallest valid sentence or None when no split exists. It tests string segmentation with dictionary lookups, handling of impossible inputs, and a canonical tie-breaking rule.

  MicrosoftApplied ScientistCoding & AlgorithmsOnsite
• Keep Stable Unique Column Names Across Schema ChangesMedium

  Maintain stable case-insensitive unique column names across additions, removals, reordering, reappearance, and natural suffix collisions, with independent table histories.

  MicrosoftSoftware EngineerCoding & AlgorithmsOnsite
• List Point Pairs Spanning Non-Degenerate Boxes in N Dimensions, Sorted by VolumeMedium

  A coding problem that takes points in two or more dimensions, finds every pair whose axis-aligned box has non-zero volume, and returns those pairs with their volumes in a strict order. It tests careful pair enumeration, handling of flat or degenerate boxes, and deterministic sorting with tie-breaks.

  MicrosoftSoftware EngineerCoding & AlgorithmsTechnical Screen
• Longest Single-Letter Substring After at Most k Letter ReplacementsMedium

  A string problem: given uppercase letters and a budget of k single-letter changes, find the longest contiguous substring that can be turned into one repeated letter. It tests efficient substring scanning with letter counts and careful reasoning about when a candidate substring stays valid.

  MicrosoftSoftware EngineerCoding & AlgorithmsOnsite
• Maximize Equal Array Length After Contiguous Sum MergesMedium

  Determine the maximum possible length of two identical arrays formed by repeatedly merging adjacent elements of two given positive-integer arrays, or return -1 if impossible.

  MicrosoftSoftware EngineerCoding & AlgorithmsOnsite
• Maximize Points by Deleting Values and Their NeighborsMedium

  Tests dynamic programming and hash map aggregation to maximize points under adjacency constraints over a sparse range of values.

  MicrosoftSoftware EngineerCoding & AlgorithmsOnline Assessment
• Maximize profit with bounded sell windowMedium

  This question evaluates proficiency in array algorithms, time and space complexity analysis, and techniques for bounded-range optimization and streaming adaptation.

  MicrosoftSoftware EngineerCoding & AlgorithmsOnsite
• Maximum Subarray Sum of an Array Repeated K TimesMedium

  A coding question that first asks for the largest sum of a non-empty contiguous subarray, then for the same quantity when the array is written out k times back to back. It tests subarray reasoning across copy boundaries, all-negative inputs, and sums that overflow 32-bit integers.

  MicrosoftApplied ScientistCoding & AlgorithmsOnsite
• Measure Every Lake on a Map Tile, Listed in Scan OrderEasy

  Compute the area of every water body on a rectangular map tile, reported in the order a row-by-row scan first touches each one; tests connected components on a grid and avoiding recursion limits on huge regions.

  MicrosoftSoftware EngineerCoding & AlgorithmsOnsite
• Median of Every Fixed-Length Sliding Window in an Integer ArrayMedium

  A coding problem that slides a window of fixed length k across an integer array and asks for the median of every window position, returned as floats in window order. It tests keeping the middle of a changing collection available as elements enter and leave, exact handling of even-sized windows, and overflow-safe averaging.

  MicrosoftSoftware EngineerCoding & AlgorithmsOnsite
• Merge multiple sorted arrays using min-heapMedium

  This question evaluates algorithm design and data structure proficiency, focusing on merging multiple sorted sequences and reasoning about time and space complexity for large numbers of arrays and elements.

  MicrosoftSoftware EngineerCoding & AlgorithmsOnsite
• Merge overlapping intervalsMedium

  This question tests the ability to manage and merge interval-based data, requiring sorting and a single-pass linear traversal to resolve overlaps.

  MicrosoftSoftware EngineerCoding & AlgorithmsTechnical Screen
• Minimize Fuel Cost Across CitiesMedium

  Calculate the minimum monetary cost to travel between two cities in a road network where fuel is consumed per unit distance and can be stockpiled with unlimited capacity at local city prices.

  MicrosoftSoftware EngineerCoding & AlgorithmsOnsite