Coding & Algorithms interview questions

Showing 2251–2280 of 3276 results

• Implement a hash table with put/getMedium

  This question evaluates implementation and design skills for hash-based data structures, testing competency in data structures, hashing, collision handling, and achieving expected O(1) put/get performance in the Coding & Algorithms domain.

  ParadromicsSoftware EngineerCoding & AlgorithmsTechnical Screen
• Analyze Reports in a Nested Org ChartMedium

  This problem tests your ability to model hierarchical tree structures and use post-order traversal to aggregate data across deep organizational levels efficiently.

  PatreonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Design org chart lookup with preprocessingEasy

  This question evaluates skills in data structures and algorithms, specifically tree/forest representation, aggregation of subtree metrics, dynamic updates, and rigorous time and space complexity analysis.

  PatreonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Assess HashMap vs ConcurrentHashMapMedium

  This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Assess HashMap vs ConcurrentHashMap states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

  PayPalSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compare final, finally, finalizeMedium

  This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Compare final, finally, finalize states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

  PayPalSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compare write-back vs write-through cachesMedium

  This question evaluates understanding of caching policies and memory/storage hierarchy trade-offs, focusing on how write-back and write-through handle writes, coherence, durability, latency, bandwidth, dirty bits, write amplification, and power-loss risks.

  PayPalSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute Variance from a Python ListHard

  This question evaluates understanding of basic statistical concepts and numerical computation—specifically population versus sample variance—and tests algorithmic implementation skills, edge-case handling, and complexity reasoning within the Coding & Algorithms domain.

  PayPalData ScientistCoding & AlgorithmsTechnical Screen
• Compute variance of a list in PythonEasy

  This question evaluates understanding of statistical measures and numeric computation, focusing on implementing variance calculations (population vs sample) and considerations for numerical stability.

  PayPalData ScientistCoding & AlgorithmsTechnical Screen
• Contrast TCP vs UDP; detect lossMedium

  This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Contrast TCP vs UDP; detect loss states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

  PayPalSoftware EngineerCoding & AlgorithmsTechnical Screen
• Count Word Frequency and Print Top Three WordsMedium

  This question evaluates proficiency in basic Python programming, string/text processing, frequency counting and sorting algorithms, reflecting core competencies for data manipulation tasks.

  PayPalData ScientistCoding & AlgorithmsOnsite
• Explain HashMap internals and collisionsMedium

  This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Explain HashMap internals and collisions states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

  PayPalSoftware EngineerCoding & AlgorithmsTechnical Screen
• Explain Java volatile semanticsMedium

  This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Explain Java volatile semantics states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

  PayPalSoftware EngineerCoding & AlgorithmsTechnical Screen
• Explain differences between Python list and tupleHard

  Evaluates understanding of Python data structures—specifically lists versus tuples—by probing concepts such as mutability and its implications, high-level performance and memory trade-offs, typical use cases, and hashability for use as dictionary keys.

  PayPalData ScientistCoding & AlgorithmsTechnical Screen
• Find k most frequent in linear timeMedium

  This question evaluates a candidate's ability to design and analyze efficient frequency-counting algorithms and related data structures, testing competencies in hashing, bucket-based grouping, heap usage, and time/space complexity reasoning.

  PayPalSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement sliding-window device anomalyMedium

  This question evaluates understanding of streaming algorithms, sliding-window state management, per-user data structures, and handling out-of-order events under strict time and space complexity constraints.

  PayPalData ScientistCoding & AlgorithmsTechnical Screen
• Maximize ones with limited flipsMedium

  This question evaluates proficiency with array algorithms, particularly sliding-window and two-pointer reasoning, complexity analysis, and the ability to adapt solutions for streaming data.

  PayPalMachine Learning EngineerCoding & AlgorithmsOnsite
• Minimize a String Using Allowed SwapsMedium

  This question evaluates understanding of graph connectivity and constrained string reordering, along with proficiency in applying efficient data structures and algorithms for handling large inputs.

  PayPalSoftware EngineerCoding & AlgorithmsOnsite
• Search a word in a gridMedium

  This question evaluates proficiency in grid traversal and stateful search techniques such as depth-first search and backtracking, including visited-state management and pruning strategies within the Coding & Algorithms domain.

  PayPalMachine Learning EngineerCoding & AlgorithmsOnsite
• Solve common search/parse/graph frequency tasksMedium

  This problem tests your ability to perform a binary search on a rotated sorted array and subsequently count occurrences of elements to identify the top-k most frequent items.

  PayPalSoftware EngineerCoding & AlgorithmsTechnical Screen
• Fetch, group, and print paginated activitiesMedium

  This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Fetch, group, and print paginated activities states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

  PeregrineSoftware EngineerCoding & AlgorithmsTechnical Screen
• Distinguish Permit Requirement OutcomesMedium

  This problem tests your ability to model state transitions based on complex rule sets and implement efficient logic to resolve status precedence when multiple criteria are met.

  PermitflowSoftware EngineerCoding & AlgorithmsTechnical Screen
• Design a CreditTracker with expirationsMedium

  This question evaluates a candidate's ability to design and implement data structures and algorithms for managing time-bound resources with non-monotonic (out-of-order) operations, emphasizing correctness and efficiency within the coding & algorithms domain.

  PerplexitySoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement Dependency-Aware To-Do ListMedium

  Design an in-memory task management system that tracks directed dependencies between tasks, prevents cycles, and unblocks dependent tasks upon completion.

  PerplexitySoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement Stratified Sampling by CountryMedium

  Implement proportional stratified sampling on an in-memory list of records partitioned by a categorical key, ensuring exact sample size via the largest remainder method and reproducible selection.

  PerplexityData ScientistCoding & AlgorithmsTechnical Screen
• Implement Task Dependencies and FailureHard

  This question evaluates understanding of graph-based data structures and algorithms for modeling bidirectional task dependencies, status tracking, and efficient cascading failure propagation in an in-memory task manager.

  PerplexitySoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement time-versioned KV store with restoreMedium

  This question evaluates a candidate's ability to design and implement a time-versioned key–value store, assessing knowledge of temporal data structures, versioning semantics, time-travel and range queries, deletion semantics, and rollback/restoration.

  PerplexitySoftware EngineerCoding & AlgorithmsOnline Assessment
• Implement a Versioned Key-Value File StoreHard

  Practice a Persona coding interview problem focused on implement a versioned key-value file store. The prompt emphasizes edge cases, clean implementation, and verifiable test behavior without revealing the solution.

  PersonaSoftware EngineerCoding & AlgorithmsOnline Assessment
• Evaluate Spreadsheet Cells and Reject Circular ReferencesHard

  Implement a small spreadsheet whose cells hold integers or single-reference formulas with offsets. Evaluate through current dependencies, propagate updates, report unset chains, and reject a formula atomically whenever it would introduce a circular reference.

  PikaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement text formatter and sum subarray productsMedium

  This question evaluates algorithmic problem-solving and implementation skills across string formatting (line breaking and space management) and array-based combinatorial computation (sum of subarray products), emphasizing correctness, edge-case handling, and analysis of time and space complexity.

  PikaSoftware EngineerCoding & AlgorithmsOnline Assessment
• Solve Anagram Without SortingEasy

  This question evaluates proficiency in string manipulation, character frequency analysis, and asymptotic time/space complexity reasoning. It is commonly asked in the coding & algorithms domain to test practical application of basic data structures (string processing and frequency-based counting), correctness under input constraints, and the ability to design efficient, linear-time solutions rather than purely conceptual reasoning.

  PilotSoftware EngineerCoding & AlgorithmsTechnical Screen