Coding & Algorithms interview questions

Showing 1501–1530 of 3276 results

• Check Whether a String Is a Signed Decimal Number Without Exponent NotationMedium

  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.

  LinkedInSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compare heap and stack memoryMedium

  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.

  LinkedInSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute graph distance and impacted servicesMedium

  This problem tests your ability to model a directed dependency graph and perform reachability analysis to identify all downstream services affected by a change in a root service.

  LinkedInSoftware EngineerCoding & AlgorithmsOnsite
• Compute point-to-segment minimum distanceEasy

  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.

  LinkedInMachine Learning EngineerCoding & AlgorithmsTechnical Screen
• Compute total covered interval lengthMedium

  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.

  LinkedInMachine Learning EngineerCoding & AlgorithmsTechnical Screen
• Count Distinct Values in a Huge Sorted ArrayMedium

  This problem tests your ability to optimize search operations in a sorted array by using binary search to skip redundant elements, achieving sub-linear time complexity relative to the total array size.

  LinkedInSoftware EngineerCoding & AlgorithmsOnsite
• Count Subsequences Whose Minimum Plus Maximum Stays Within a TargetMedium

  Count the non-empty subsequences of an integer array whose minimum plus maximum is at most a target, returning the count modulo 10^9 + 7. Tests combinatorial counting, careful handling of duplicate values chosen by index, and modular arithmetic for very large totals.

  LinkedInSoftware EngineerCoding & AlgorithmsOther
• Count connected land components in a gridMedium

  This question evaluates understanding of grid traversal and graph connectivity concepts, focusing on modeling a 2D matrix as adjacency relationships within the coding and algorithms domain.

  LinkedInSoftware EngineerCoding & AlgorithmsOnsite
• Count islands and distinct shapesMedium

  This question evaluates a candidate's understanding of grid-based graph traversal and connected-component detection, along with the ability to recognize and canonicalize distinct island shapes.

  LinkedInSoftware EngineerCoding & AlgorithmsOnsite
• Debug Queues and Solve ArraysEasy

  Tests array traversal, sliding window techniques, and handling wrap-around logic in circular data structures with edge cases.

  LinkedInSoftware EngineerCoding & AlgorithmsOnsite
• Design O(1) Randomized MultisetEasy

  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.

  LinkedInSoftware EngineerCoding & AlgorithmsTechnical Screen
• Design a Randomized MultisetMedium

  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.

  LinkedInSoftware EngineerCoding & AlgorithmsTechnical Screen
• Design a max-stack with efficient operationsMedium

  This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Design a max-stack with efficient operations states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

  LinkedInSoftware EngineerCoding & AlgorithmsOnsite
• Design a stack with max removalMedium

  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.

  LinkedInSoftware EngineerCoding & AlgorithmsTechnical Screen
• Fewest-Edge Distance Between Two Nodes in a Directed Acyclic GraphMedium

  Given a directed acyclic graph and two nodes, return the fewest edges on a directed path from the source to the target, 0 when they are the same node, or -1 when the target cannot be reached. Asked as a follow-up to topological ordering, it tests traversal of dependency graphs.

  LinkedInSoftware EngineerCoding & AlgorithmsOnsite
• Find a Target's Index in a Rotated Sorted Array of Distinct IntegersMedium

  Find the index of a target value in an array of distinct integers that was sorted ascending and then rotated at an unknown pivot, returning -1 when it is absent. Tests adapting search to a partially ordered array in logarithmic time and handling unrotated and single-element inputs.

  LinkedInSoftware EngineerCoding & AlgorithmsOther
• Find dictionary words matching a phone digit stringMedium

  This problem tests your ability to map phone keypad digits to characters and efficiently filter a provided dictionary to find words that match a specific digit sequence.

  LinkedInSoftware EngineerCoding & AlgorithmsOnsite
• Find dictionary words that match a phone keypad digit sequenceEasy

  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.

  LinkedInSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find index with positive suffix sumsMedium

  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.

  LinkedInData ScientistCoding & AlgorithmsTechnical Screen
• Find lowest common ancestorMedium

  This question evaluates understanding of binary tree structure, lowest common ancestor concepts, and competency in algorithmic reasoning and tree traversal within the Coding & Algorithms category.

  LinkedInSoftware EngineerCoding & AlgorithmsOnsite
• Find shortest word transformation with cachingMedium

  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.

  LinkedInMachine Learning EngineerCoding & AlgorithmsTechnical Screen
• Find the K Closest Values in a Sorted ArrayMedium

  This problem tests binary search and window optimization to find the k nearest elements to a target in a sorted integer array.

  LinkedInSoftware EngineerCoding & AlgorithmsOnsite
• Find the K Values Closest to a Target in a Binary Search TreeMedium

  Given a binary search tree described by its preorder traversal, a real-valued target and an integer k, return the k node values closest to the target in ascending order, breaking distance ties toward the smaller value. Tests binary search tree traversal, reasoning over ordered data and precise tie handling.

  LinkedInSoftware EngineerCoding & AlgorithmsOnsite
• Find the Maximum Depth of a Binary TreeMedium

  Find binary-tree depth from a portable child-index representation, including empty trees and highly unbalanced root-to-leaf paths.

  LinkedInSoftware EngineerCoding & AlgorithmsOnsite
• Find the Nearest Supply Location in a Road NetworkMedium

  This problem tests your ability to model a road network as a graph and compute the shortest distance from a source node to any target node in a set using a Breadth-First Search (BFS) approach.

  LinkedInDevOps EngineerCoding & AlgorithmsOnsite
• Find the Node Where Two Singly Linked Lists MergeMedium

  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.

  LinkedInSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find the k-th largest element in an arrayMedium

  This question evaluates proficiency with selection algorithms, array manipulation, and analysis of time and space complexity, reflecting competency in order-statistics and basic data structures.

  LinkedInSoftware EngineerCoding & AlgorithmsOnsite
• Generate All Distinct Permutations of a List with Duplicate ValuesMedium

  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.

  LinkedInSoftware EngineerCoding & AlgorithmsTechnical Screen
• Generate uniform 0–6 from biased coinMedium

  This question evaluates understanding of randomized algorithms, probability theory, and techniques for extracting uniform randomness from a biased source.

  LinkedInMachine Learning EngineerCoding & AlgorithmsOnsite
• How do you sample uniformly from an infinite stream?Easy

  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.

  LinkedInData ScientistCoding & AlgorithmsTechnical Screen