Skip to the selected question
ASIC.FYI

ASIC Interview Question Bank

1,000+ hardware interview questions.Curated and reviewed by industry engineers.1,000+ hardware questions1,000+ questionsEngineer-reviewed
Question bank1110 results
  1. Easy
  2. Easy
  3. Medium
  4. Medium
  5. Medium
  6. Hard
  7. Medium
  8. Medium
  9. Medium
  10. Medium
  11. Medium
  12. Medium
  13. Medium
  14. Medium
  15. Hard
  16. Medium
  17. Easy
  18. Easy
  19. Medium
  20. Medium
  21. Medium
  22. Hard
  23. Medium
  24. Medium
  25. Easy
  26. Medium
  27. Medium
  28. Medium
  29. Medium
  30. Medium
  31. Medium
  32. Medium
  33. Medium
  34. Hard
  35. Medium
  36. Hard
  37. Medium
  38. Hard
  39. Hard
  40. Medium
  41. Medium
  42. Medium
  43. Hard
  44. Hard
  45. Hard
  46. Medium
  47. Medium
  48. Hard
  49. Medium
  50. Medium
DescriptionQ209
Page ↗
Q209FWASIC interview problem

Maintain the K largest stream values

TechniquesSystemVerilogTop KSorted queueStreaming
DifficultyMedium
TopicData Structures
LanguageSystemVerilog
Requirements4 checkpoints
01

Problem

Continuously process integers and retain the K largest values seen so far, including duplicate occurrences.

Class declarationSystemVerilog
class TopKLargest;
  function new(int k, int sentinel = -1);
  function void push(int x);
  function int get_kth();
  function int[$] snapshot();
endclass

Example input and output

Use this case to check your interpretation
Input
K=3; stream=[4,9,1,9,7]
Output
snapshot=[9,9,7]; get_kth()=7
Explanation

Duplicate observations are retained, and the bounded structure discards 4 and 1 as smaller than the final top three.

02

Requirements (4)

  • Keep at most K real stream values rather than pre-filling the structure with sentinels.
  • get_kth() returns the Kth largest value or the sentinel before K values have arrived.
  • snapshot() returns retained values in descending order.
  • Reject nonpositive K.