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 751–780 of 1706 results
- KaratMediumSoftware EngineerValidate password and list rule violations
This question evaluates string-processing and input-validation skills, including case-insensitive substring detection, character class checks, pattern matching for special symbols, and handling edge cases like consecutive character limits.
Coding & AlgorithmsTechnical Screen - Lead BankMediumSoftware EngineerImplement Stock Price Query APIs
This question evaluates skills in time-series data modeling, API and data-structure design, transactional (atomic) batch updates, concurrency control, and date/time parsing for stock price records.
Coding & AlgorithmsTechnical Screen - Lead BankMediumSoftware EngineerImplement a versioned hash map with snapshot
This question evaluates understanding of versioned hash maps, time-travel key-value stores, temporal retrieval semantics, and snapshot creation, testing algorithms and data-structure design in the Coding & Algorithms domain and emphasizing practical implementation with conceptual reasoning about correctness and timestamp semantics.
Coding & AlgorithmsTechnical Screen - LendingClubMediumData ScientistDetermine If Two Numbers Sum to Target
This question evaluates a candidate's basic algorithmic fluency in array processing and the ability to reason about pairwise sums using auxiliary data structures.
Coding & AlgorithmsTechnical Screen - LiftoffMediumSoftware EngineerImplement minimal RLE encode/decode with max run K
This question evaluates proficiency in string parsing and compression techniques, specifically run-length encoding/decoding, pattern detection, and algorithmic optimization for producing minimal-length encodings under a maximum pattern length constraint.
Coding & AlgorithmsTechnical Screen - LimeEasySoftware EngineerCombine Overlapping Closed Intervals Into a Sorted Disjoint List
Given an unordered list of closed integer intervals, possibly with duplicates, nested intervals and touching endpoints, combine every chain of overlapping intervals and return the disjoint result ordered by start. It tests interval reasoning, precise overlap rules at shared endpoints, and careful handling of edge cases.
Coding & AlgorithmsTechnical Screen - LinkedInEasySoftware EngineerAnswer Repeated Shortest Word Distance Queries
Design a data structure that preprocesses a list of words to efficiently answer repeated queries for the shortest index distance between two distinct words.
Coding & AlgorithmsTechnical Screenhash-tabletwo-pointersdesign - LinkedInEasySoftware EngineerArrange Nonnegative Integers to Form the Largest Number
Tests custom sorting logic and string manipulation to arrange a list of nonnegative integers into the lexicographically largest combined numerical string.
Coding & AlgorithmsTechnical Screensortinggreedystring - LinkedInMediumSoftware EngineerCan You Place N Objects?
This problem tests your ability to handle greedy array traversal while maintaining specific adjacency constraints, requiring careful management of boundary indices.
Coding & AlgorithmsTechnical ScreenArraysGreedySimulation - LinkedInMediumSoftware EngineerCheck Whether a String Is a Signed Decimal Number Without Exponent Notation
Write a function that decides whether a string is a valid plain decimal number with an optional sign and fractional part, rejecting exponents, stray symbols, and repeated decimal points. It tests turning a small grammar into careful character-by-character validation and covering edge cases such as empty strings and bare signs.
Coding & AlgorithmsTechnical Screen - LinkedInMediumSoftware EngineerCompare heap and stack memory
This question evaluates understanding of memory management concepts including stack versus heap allocation, object lifetimes, allocation and free behavior, access patterns, performance characteristics, and thread visibility within the Coding & Algorithms domain.
Coding & AlgorithmsTechnical Screen - LinkedInEasyMachine Learning EngineerCompute point-to-segment minimum distance
This problem tests your ability to apply vector projections and geometric constraints to find the shortest distance from a point to a line segment in a 2D plane.
Coding & AlgorithmsTechnical ScreenGeometryVectorsMath - LinkedInMediumMachine Learning EngineerCompute total covered interval length
Compute total covered interval length 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 & AlgorithmsTechnical Screen - LinkedInEasySoftware EngineerDesign O(1) Randomized Multiset
This problem tests your ability to design a data structure that supports efficient insertion, deletion, and uniform random sampling by combining dynamic arrays with hash maps to achieve constant time complexity.
Coding & AlgorithmsTechnical ScreenHash MapArrayDesign - LinkedInMediumSoftware EngineerDesign a Randomized Multiset
This question evaluates the ability to design and implement a randomized multiset that correctly handles duplicate integer occurrences while providing expected O(1) insert, remove, and uniform getRandom operations, testing knowledge of data structures, randomness, and performance constraints.
Coding & AlgorithmsTechnical Screen - LinkedInMediumSoftware EngineerDesign a stack with max removal
This question evaluates data-structure design and algorithmic complexity analysis by requiring a stack-like structure that supports standard stack operations plus efficient maximum retrieval and targeted removal, assessing practical implementation skills and time-complexity reasoning at a practical application level.
Coding & AlgorithmsTechnical Screen - LinkedInEasySoftware EngineerFind dictionary words that match a phone keypad digit sequence
Coding problem: given a list of known words and a digit string typed on a standard phone keypad, return every known word whose letters map to exactly that digit sequence, in sorted order. It tests string encoding, choosing a lookup structure for the dictionary, and analyzing time complexity.
Coding & AlgorithmsTechnical Screen - LinkedInMediumData ScientistFind index with positive suffix sums
This problem tests your ability to optimize array traversals using prefix or suffix sums, specifically evaluating your skill in calculating cumulative values efficiently in O(n) time.
Coding & AlgorithmsTechnical ScreenArraysSuffix SumOptimization - LinkedInMediumMachine Learning EngineerFind shortest word transformation with caching
Find shortest word transformation with caching 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 & AlgorithmsTechnical Screen - LinkedInMediumSoftware EngineerFind the Node Where Two Singly Linked Lists Merge
Two singly linked lists stored in one successor array may merge at some node and share every node after it. Given both heads, return the first shared node, or -1 if the lists never meet. It tests linked-list traversal and careful handling of cases such as one list starting inside the other.
Coding & AlgorithmsTechnical Screen - LinkedInMediumSoftware EngineerGenerate All Distinct Permutations of a List with Duplicate Values
Given a list of up to eight integers that may contain duplicates, return every distinct permutation exactly once, sorted in lexicographic order. It tests systematic enumeration, avoiding duplicate results caused by equal values, and producing a deterministic output order.
Coding & AlgorithmsTechnical Screen - LinkedInEasyData ScientistHow do you sample uniformly from an infinite stream?
This question tests the implementation of Reservoir Sampling to maintain a uniform random sample of size k from a stream of unknown or infinite length.
Coding & AlgorithmsTechnical ScreenAlgorithmsProbabilityStreaming - LinkedInMediumMachine Learning EngineerImplement K-Means and Explain Convergence
This problem tests the implementation of the K-means clustering algorithm from scratch, requiring an understanding of the iterative refinement process, distance metrics, and the underlying mathematical objective.
Coding & AlgorithmsTechnical ScreenClusteringUnsupervised LearningAlgorithms - LinkedInMediumData EngineerImplement a stack supporting max and popMax
This question evaluates understanding of data structures and algorithmic complexity, focusing on designing a stack variant that supports efficient retrieval and removal of the current maximum while preserving stack behavior.
Coding & AlgorithmsTechnical Screen - LinkedInMediumData ScientistImplement fast sampling for weighted k-sided die
This question evaluates understanding of probabilistic algorithm design, numerical stability, and efficient data-structure implementation for constant-time sampling from categorical distributions.
Coding & AlgorithmsTechnical Screen - LinkedInMediumData ScientistImplement stream random sampling in Python
This question evaluates understanding of streaming algorithms, uniform random sampling, and probabilistic guarantees for maintaining a fixed-size sample from an unbounded data stream (reservoir-sampling concepts).
Coding & AlgorithmsTechnical Screen - LinkedInMediumSoftware EngineerLongest Run of Ones After One Flip
This problem tests your ability to manage a sliding window with a flexible constraint, specifically counting zeros to determine the maximum length of a sequence after a single modification.
Coding & AlgorithmsTechnical ScreenSliding WindowTwo PointersArray - LinkedInEasySoftware EngineerMerge Two N-ary Trees by Matching Node Keys
Merge two rooted n-ary trees in which every node has an integer key, combining nodes only when their keys match under matching parents. Tests recursive tree traversal, matching children by key, handling roots with different keys, and producing a canonical preorder encoding of the merged tree.
Coding & AlgorithmsTechnical Screen - LinkedInMediumSoftware EngineerMinimize adjacent-color assignment cost
This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Minimize adjacent-color assignment cost states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Coding & AlgorithmsTechnical Screen - LinkedInEasySoftware EngineerMinimum index distance between two given words in a word list
Coding problem: given a list of words and two different target words that both appear in it, return the smallest distance between an index of one word and an index of the other. It tests single-pass scanning with position tracking, handling of repeated occurrences, and time complexity analysis.
Coding & AlgorithmsTechnical Screen
Liftoff
LinkedIn