cswork / libraryOpen practice workspace

READ. UNDERSTAND. PRACTICE.

Coding questions

Explore algorithm tutorials, coding and system design questions, interview experiences, and computer science study guides.

1,899 resources · Page 29 of 80

  1. Coding questions · Oracle

    Determine if robot path is bounded

    Determine if robot path is bounded 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.

  2. Coding questions · Meta

    Determine if subarray sums to target

    This question evaluates a candidate's ability to reason about contiguous subarray sums, efficient array manipulation, and handling large numeric ranges within algorithmic constraints, and it falls under the Coding & Algorithms domain as a practical algorithmic implementation problem.

  3. Coding questions · LendingClub

    Determine 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.

  4. Coding questions · Amazon

    Determine max remainders and anagram after deletions

    In the Coding & Algorithms domain, this two-part question evaluates modular arithmetic and combinatorial reasoning for maximizing distinct array remainders and frequency-vector manipulation for determining anagram feasibility after selective character deletions, while also testing algorithm design and time/space complexity analysis.

  5. Coding questions · Netflix

    Determine Maximum Consecutive Order Days Per User

    Determine Maximum Consecutive Order Days Per User evaluates SQL or pandas logic, joins, grouping, window functions, null handling, edge cases, and validation in a realistic interview setting. A strong answer states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

  6. Coding questions · Amazon

    Determine Maximum Path Length in Directed Acyclic Graph

    This question evaluates proficiency in graph algorithms and algorithmic reasoning, focusing on properties of directed acyclic graphs, longest-path concepts, and complexity analysis related to dependency chains.

  7. Coding questions · Salesforce

    Determine minimal substitutions and removals

    This question evaluates string manipulation and adjacency-constraint handling in the first task and sequence analysis with minimal-removal and subsequence reasoning in the second, targeting competencies such as local transformation logic, subsequence recognition, and optimization under input constraints.

  8. Coding questions · Point72

    Determine Most Frequent Product Color in Carts

    This question evaluates proficiency in frequency analysis and deterministic tie-breaking for string data, assessing correctness in counting and selection logic.

  9. Coding questions · Meta

    Determine Old vs. New Users' Shop Visibility Changes

    This question evaluates SQL-focused data manipulation skills and analytical competency in cohort definition and metric selection for comparing behavioral propensities, specifically assessing how to measure the likelihood of old versus new users switching a shop profile to invisible.

  10. Coding questions · Pinterest

    Determine Pin Connections Through Common Boards

    This question evaluates graph modeling and connectivity concepts, including representing boards and pins as relationships and reasoning about reachability and minimal connection paths.

  11. Coding questions · Meta

    Determine Product Buyer Count and Interaction Percentage

    This question evaluates proficiency in relational data aggregation, joining tables, distinct-entity counting, time-window filtering, and calculating interaction proportions.

  12. Coding questions · SoFi

    Determine reachability and minimum jumps

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

  13. Coding questions · Amazon

    Determine reachability and optimize task scheduling

    This question evaluates understanding of discrete reachability and resource-constrained scheduling, testing the ability to reason about iterative coordinate transformations and to optimize parallel task assignment under type and memory limits.

  14. Coding questions · Amazon

    Determine Rounds for Star Substring Threshold

    This question evaluates string-processing and algorithmic problem-solving skills, including handling incremental updates, counting substrings impacted by character replacements, and performance-aware simulation.

  15. Coding questions · LinkedIn

    Determine sanitized palindrome in string

    This question evaluates string manipulation, text sanitization, Unicode-aware character classification, and algorithmic complexity reasoning, and falls under the Coding & Algorithms domain.

  16. Coding questions · Amazon

    Determine string buildability from dictionary

    This question evaluates understanding of string manipulation, algorithm design for combinatorial search, dynamic programming/memoization concepts, and the ability to analyze time and space complexity.

  17. Coding questions · Amazon

    Determine string segmentability with dictionary

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

  18. Coding questions · MathWorks

    Determine string transform via end-append moves

    This question evaluates a candidate's understanding of string manipulation, permutation feasibility, and algorithmic optimization for computing minimal move counts.

  19. Coding questions · Adobe

    Determine task order with prerequisites

    This question evaluates a candidate's proficiency with graph-theoretic concepts like dependency modeling and cycle detection, and their ability to produce valid task orderings under constraints within the Coding & Algorithms domain.

  20. Coding questions · Meta

    Determine Top Advertisers by Conversion Rate and CTR Analysis

    This question evaluates a candidate's competency in SQL/Python data manipulation and applied statistical analysis for advertising metrics, specifically computing click-through rates, conversion rates, time-based aggregations, and performing proportion tests for peak versus non-peak hours.

  21. Coding questions · Confluent

    Determine Tutorial Completion Rate by Variant in 7 Days

    This question evaluates a candidate's competency in data manipulation and event-based analytics, focusing on skills such as joining user and event tables, aggregating event data, and computing cohort completion metrics by variant.

  22. Coding questions · Meta

    Determine Unhealthy Oculus Usage with SQL Analysis

    This question evaluates SQL-based data manipulation and time-series analysis competencies, including sessionization, user-day aggregation, and detection of sustained behavioral patterns in event data; it is categorized under Data Manipulation (SQL/Python) and targets practical application skills.

  23. Coding questions · Amazon

    Determine Whether a Binary Tree Is a Valid BST

    Determine whether an entire breadth-first encoded binary tree obeys the strict BST invariant. Use ancestor bounds rather than only parent-child checks, reject duplicates, handle numeric extremes, and discuss an iterative approach for deep trees.

  24. Coding questions · Meta

    Determine Whether a String Can Become a Palindrome After K Deletions

    Determine whether at most k deletions can turn a string into a palindrome while preserving character order. Develop a dynamic-programming or equivalent formulation that explores mismatched ends without enumerating every subsequence.