PracHub
QuestionsPremiumCoachesLearningGuidesInterview Prep
|Home/Other / Miscellaneous/Stripe

Build searchable list and highlight max transaction

Last updated: Mar 29, 2026

Quick Overview

This question evaluates competency in frontend UI development, state management, real-time filtering, and aggregate computation (finding and highlighting maximum values) with attention to algorithmic efficiency; domain: frontend UI engineering (Other/Miscellaneous).

  • medium
  • Stripe
  • Other / Miscellaneous
  • Software Engineer

Build searchable list and highlight max transaction

Company: Stripe

Role: Software Engineer

Category: Other / Miscellaneous

Difficulty: medium

Interview Round: Take-home Project

Build a small UI component that takes an array of {name: string, amount: number}. Requirements: ( 1) Render the list of items. ( 2) Provide a text search bar that filters by name using case-insensitive substring matching, and a numeric filter for minimum amount. ( 3) Within the currently filtered list, highlight the name(s) whose amount is the maximum; update the highlight in real time as the search/filter changes. If multiple items share the maximum amount, highlight all corresponding names. If the filtered list is empty, display a clear empty state and no highlight. Explain your state management approach, how you compute the maximum efficiently after filtering, and the time/space complexity. Describe test cases for edge conditions such as an empty input list, very large lists, ties, non-ASCII names, and rapid typing in the search bar.

Quick Answer: This question evaluates competency in frontend UI development, state management, real-time filtering, and aggregate computation (finding and highlighting maximum values) with attention to algorithmic efficiency; domain: frontend UI engineering (Other/Miscellaneous).

Related Interview Questions

  • Debug wrong DOM attributes in unknown framework - Stripe (medium)
  • Build and Validate Passport Form UI - Stripe (medium)
Stripe logo
Stripe
Sep 6, 2025, 12:00 AM
Software Engineer
Take-home Project
Other / Miscellaneous
0
0

UI Component: Filtered List With Max-Highlight

Context

Implement a small web UI component (e.g., in a modern frontend framework) that receives an array of items with the shape { name: string, amount: number }. The component must render the list, support text and numeric filtering, and highlight the item name(s) whose amount is the maximum among the currently filtered items.

Requirements

  1. Render the list of items.
  2. Provide two filters:
    • Text search: case-insensitive substring match on name.
    • Minimum amount: numeric filter; only show items with amount ≥ minimum.
  3. Within the currently filtered list:
    • Highlight the name(s) whose amount is the maximum.
    • Update the highlight in real time as search/filters change.
    • If multiple items share the maximum amount, highlight all corresponding names.
    • If the filtered list is empty, display a clear empty state and no highlight.
  4. Explain your state management approach, how you compute the maximum efficiently after filtering, and the time/space complexity.
  5. Describe test cases for edge conditions such as:
    • Empty input list
    • Very large lists
    • Ties for maximum
    • Non-ASCII names
    • Rapid typing in the search bar

Solution

Show

Submit Your Answer to Earn 20XP

Sign in to leave a comment

Loading comments...

Browse More Questions

More Other / Miscellaneous•More Stripe•More Software Engineer•Stripe Software Engineer•Stripe Other / Miscellaneous•Software Engineer Other / Miscellaneous
PracHub

Master your tech interviews with 8,000+ real questions from top companies.

Product

  • Questions
  • Learning Tracks
  • Interview Guides
  • Resources
  • Premium
  • For Universities
  • Student Access

Browse

  • By Company
  • By Role
  • By Category
  • Topic Hubs
  • SQL Questions
  • Compare Platforms
  • Discord Community

Support

  • support@prachub.com
  • (916) 541-4762

Legal

  • Privacy Policy
  • Terms of Service
  • About Us

© 2026 PracHub. All rights reserved.