Katkat

practice a little every day, paws crossed ♡

Frontend Engineer 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 1–12 of 12 results

  • AmazonMediumFrontend Engineer
    Format a Forest of Nested Comments

    This problem tests your ability to reconstruct hierarchical relationships from flat input data and format them into a visual tree representation with specific character-based connectors.

    Coding & AlgorithmsOnsiteRecursionTree TraversalString Formatting
  • AmazonMediumFrontend Engineer
    Maximize the number of binary strings chosen under zero and one budgets

    Given a list of binary strings and separate limits on the total number of zeros and ones, find the largest number of strings that can be chosen together without exceeding either limit. Tests optimization under two simultaneous resource limits, moving from brute force to an efficient method, and complexity analysis.

    Coding & AlgorithmsTechnical Screen
  • GoogleHardFrontend Engineer
    Count Islands with Diagonal Connectivity

    Practice counting binary-grid components when diagonal neighbors connect, changing the usual four-direction island definition.

    Coding & AlgorithmsOnsite
  • Jane StreetMediumFrontend Engineer
    Field Layout: getOffset and insert

    This question evaluates a candidate's ability to model and maintain ordered field layouts by computing and updating byte offsets, testing competencies in dynamic sequence data structures, cumulative offset tracking, and efficient update/query operations.

    Coding & AlgorithmsTechnical Screen
  • OktaMediumFrontend Engineer
    Deduplicate an Array in Linear Time

    This question tests the ability to implement a deduplication algorithm that preserves the original relative order of elements while maintaining O(n) time and space complexity.

    Coding & AlgorithmsTechnical ScreenArraysHash TableTime Complexity
  • OpenAIMediumFrontend Engineer
    Build a Streaming Chat Input

    This question evaluates frontend engineering skills including streaming data handling, incremental token-by-token rendering, asynchronous state management, and preserving UI responsiveness during long-running API streams.

    Coding & AlgorithmsTechnical Screen
  • RobinhoodMediumFrontend Engineer
    Build a Weekly Calendar

    This question evaluates frontend UI engineering skills, focusing on interactive interface construction, event handling, and state modeling to maintain a single source of truth for events in a weekly calendar grid, and it belongs to the web frontend development and UI/state-management domain.

    Coding & AlgorithmsOnsite
  • SnowflakeMediumFrontend Engineer
    Implement an event emitter

    This problem tests your understanding of the observer pattern, internal state management using maps, and the ability to handle edge cases in listener lifecycle management.

    Coding & AlgorithmsTechnical ScreenJavaScriptDesign PatternsEvent-Driven
  • TomaEasyFrontend Engineer
    Approximate Pi from Random Points

    This question evaluates a candidate's understanding of Monte Carlo estimation, basic Euclidean geometry, probability, and numerical reasoning when using random sampling to approximate mathematical constants.

    Coding & AlgorithmsTechnical Screen
  • UberMediumFrontend Engineer
    Simulate a Rank-Based Tournament

    This question tests the ability to implement a single-elimination tournament simulation using queue-based structures and demonstrates competency in designing a relational database schema for tournament record-keeping.

    Coding & AlgorithmsTechnical ScreenArrayQueueSimulation
  • VerkadaMediumFrontend Engineer
    Implement a recency cache and min-coins DP

    This problem tests your ability to combine a Least Recently Used (LRU) cache mechanism with a dynamic programming approach for optimization.

    Coding & AlgorithmsOnsiteHash MapDoubly Linked ListDynamic Programming
  • WaymoMediumFrontend Engineer
    Filter Matching Subtrees from an N-Ary Tree

    This problem tests tree traversal techniques, string matching, and the ability to handle iterative tree processing to avoid stack overflow in deep structures.

    Coding & AlgorithmsOnsiteTreesN-ary TreeAlgorithms