JobsJob TrackerJob alerts

Netskope · 24 questions

All 24Coding 20System Design 2Low-Level Design 1Product Sense 1
  • Detect loop in a linked listCoding
  • Problem based on Chinese Remainder TheoremCoding
  • Multiply matrices formed by successive array right rotationsCoding
  • Find the intersection point of two linked listsCoding
  • Find integer closest to zero in an arrayCoding
  • Minimum distance to matrix edge through cells of 1sCoding
  • Prevent server crash on huge request loadSystem Design
  • Remove a cycle from a linked listCoding
  • Robust string comparatorCoding
  • Find second highest salaryCoding
  • Evaluate an infix expressionCoding
  • Find two numbers in sorted array adding to sumCoding
  • Find number of islands in a graphCoding
  • Lowest Common Ancestor in a treeCoding
  • Closest point in a file with scalable OOP designLow-Level Design
  • Print a Binary Tree in Vertical OrderCoding
  • Merge Overlapping IntervalsCoding
  • Expression EvaluationCoding
  • Find pair in sorted array whose sum is closest to xCoding
  • Find middle element of linked list and file operationsCoding
  • Longest substring with k unique charactersCoding
  • Matching high server requests with limited database capacitySystem Design
  • Find 100 maximum numbers out of 1 million numbersCoding
  • Design an alarm clock for blind peopleProduct Sense
← Netskope questions
  1. Interview questions
  2. Netskope
  3. Design an alarm clock for blind people
Product Sense

Design an alarm clock for blind people

Filed under Netskope

The question

Explain the scenarios, required modules, and overall design for an alarm clock tailored for blind individuals.

No write-up yet. Related questions below have one.

← Find 100 maximum numbers out of 1 million numbers

Collected from public candidate posts and coding forums. Updated Nov 2026.