LeetCode
Experience
#1481 Least Number of Unique Integers after K Removals
Interview Experience
LeetCode #1481: Least Number of Unique Integers after K Removals. Difficulty: Medium. Topics: Array, Hash Table, Greedy, Sorting, Counting. Asked at fivetran in the last 6 months.
Original Source
This is a frequency-tagged signal. The full problem statement lives on the original source.
View original →About This Question
This is a candidate experience report from a fivetran interview for a swe role during the coding round.
It covers the following topics: Counting, Arrays, Greedy, Hash Table, Sorting .
Difficulty rating: Medium