Coding questions

1,899 resources · Page 47 of 80

1. Coding questions · Tesla

   Implement automatic braking logic in Python

   This question evaluates understanding of kinematics, motion modeling, and numerical reasoning for safety-critical control logic, focusing on stopping-distance computation and the impact of reaction time on braking decisions.

2. Coding questions · Apple

   Implement bag-of-words similarity search from scratch

   This question evaluates knowledge and implementation skills in text processing, vector-space models, and information retrieval, covering tokenization, term-frequency and TF–IDF weighting, cosine similarity, and ranking for similarity search within the Coding & Algorithms domain.

3. Coding questions · Coinbase

   Implement bank account with cashback

   This question evaluates implementation skills in sequential operation processing, integer arithmetic, control flow, edge-case handling, and overflow awareness within algorithmic constraints.

4. Coding questions · Coinbase

   Implement bank balance operations

   This question evaluates object-oriented programming, state management, input validation, and arithmetic correctness when implementing account operations and maintaining transactional invariants.

5. Coding questions · Meta

   Implement basic expression evaluator

   This question evaluates proficiency in expression parsing, operator precedence handling, integer arithmetic semantics (including truncating division), and efficient tokenization and evaluation within the Coding & Algorithms domain.

6. Coding questions · Coinbase

   Implement basic pagination for a list

   This question evaluates a candidate's competence in array indexing, boundary-condition handling, and simple pagination logic, focusing on correct subarray extraction and off-by-one considerations within given size constraints.

7. Coding questions · Airtable

   Implement BFS serializer and deserializer

   This question evaluates the skill of serializing and deserializing Python object graphs using BFS, including handling primitives, dictionaries, shared subobjects, and circular references while preserving object identity.

8. Coding questions · Disney

   Implement BFS shortest path in grid

   This question evaluates understanding of graph traversal and pathfinding concepts, particularly breadth-first search on unweighted 2D grids, along with algorithmic complexity analysis and edge-case handling in the Coding & Algorithms domain.

9. Coding questions · MathWorks

   Implement BFS shortest paths with reconstruction

   This question evaluates understanding of graph traversal via breadth-first search, computation of shortest paths in unweighted graphs, and path reconstruction using parent arrays, assessing algorithmic reasoning and implementation skills in the Coding & Algorithms domain.

10. Coding questions · Amazon

    Implement BFS to Find Shortest Path in Graph

    This question evaluates understanding of graph traversal algorithms, particularly breadth-first search, and competency in computing shortest paths and reconstructing an example shortest route in large undirected graphs.

11. Coding questions · Citi

    Implement bidirectional Dijkstra for shortest paths

    This question evaluates proficiency in graph algorithms and algorithm engineering, specifically understanding and implementing bidirectional shortest-path search with appropriate data structures, termination conditions, path reconstruction, and time/space complexity analysis.

12. Coding questions · Snapchat

    Implement binary search for boundary index

    This question evaluates a candidate's ability to implement binary search for boundary indices, including correct handling of duplicates, providing iterative and recursive variants, and reasoning about time and space complexity.

13. Coding questions · Pinterest

    Implement Binary Search for Policy Violation Logs

    This question evaluates understanding of algorithmic search and data manipulation skills, specifically applying binary search over date-ordered logs and composing efficient queries using SQL and Python.

14. Coding questions · Uber

    Implement binary search from scratch

    An Uber software engineer onsite coding question asking you to implement binary search on a sorted integer array from scratch, in both iterative and recursive form. It covers plain search, first/last occurrence with duplicates, the insertion-index variant, overflow-safe midpoint computation, loop invariants and correctness, and time/space complexity analysis.

15. Coding questions · Cerebras

    Implement Binary Search in C++

    This question evaluates proficiency in implementing binary search in C++, focusing on iterative control flow, correct handling of not-found cases, boundary conditions, and understanding of algorithmic correctness.

16. Coding questions · Amazon

    Implement binary search lower/upper bounds

    Implement lower_bound and upper_bound on a non-decreasing sorted array using iterative binary search in O(log n) time and O(1) space. This Amazon ML engineer screen tests precise boundary handling, loop-invariant reasoning, and edge cases like duplicates, empty arrays, and out-of-range targets.

17. Coding questions · Freddie Mac

    Implement blocked time-series cross-validation

    This question evaluates competence in designing panel-aware time-series cross-validation with embargo handling, grouped blocking, deterministic splitting, scalability analysis, and adversarial unit-test design for issues like duplicate timestamps and entity migration.

18. Coding questions · Meta

    Implement bounds, minimum, pathfinding, and moving average

    This question evaluates proficiency with core data structures and algorithms—specifically array operations (merge and bounds), minimum-finding strategies, 2D graph pathfinding (BFS vs. DFS and path reconstruction), and streaming sliding-window statistics (moving average).

19. Coding questions · Meta

    Implement BST vertical traversal and list conversion

    This question evaluates proficiency with binary search trees, vertical-order traversal semantics, in-place pointer manipulation for converting a BST into a sorted doubly linked list, and algorithmic complexity analysis within the Coding & Algorithms domain.

20. Coding questions · Amazon

    Implement Cache and Rotate Matrix

    This two-part question evaluates competency in data structure design and in-place array manipulation, specifically the ability to implement an LRU cache with O(1)-average operations (including recency management, updates, and evictions) and to rotate an n x n matrix 90 degrees clockwise in place without extra space.

21. Coding questions · Netflix

    Implement Caches, Undo, and Traversal

    This question evaluates proficiency with data structures, API design, and system-level concerns by combining timed in-memory caching, command undo/redo semantics, and depth-first traversal of a tree; it falls under the Coding & Algorithms domain and is commonly asked to assess practical implementation skills, correctness under edge cases, and the ability to reason about time and space complexity. The level of abstraction spans practical application—designing clean APIs and implementing core logic—while also requiring conceptual understanding of complexity analysis and background cleanup or state-management patterns.

22. Coding questions · Snapchat

    Implement calculator and graph connectivity

    This question evaluates proficiency in parsing and arithmetic expression evaluation (including operator precedence and nested parentheses) alongside implementation of disjoint-set (Union-Find) data structures for computing graph connected components.

23. Coding questions · SoFi

    Implement chance of a personal best

    This question evaluates a candidate's ability to perform simulation-based probabilistic estimation, sample and aggregate historical per-obstacle times, and correctly handle incomplete run records within a collection.

24. Coding questions · Bloomberg

    Implement classes in existing abstract hierarchy

    This question evaluates object-oriented design and implementation skills in Python within the Coding & Algorithms and software engineering domain, focusing on completing concrete subclasses in an existing abstract class hierarchy while preserving public interfaces and type compatibility.