LeetCode
Question
#3795 Minimum Subarray Length With Distinct Sum At Least K
Question Details
LeetCode #3795: Minimum Subarray Length With Distinct Sum At Least K. Difficulty: Medium. Topics: Array, Hash Table, Sliding Window. Asked at Amazon in the last 6 months.
Original Source
This is a frequency-tagged signal. The full problem statement lives on the original source.
View original →Topics
Arrays
Hash Table
Sliding Window
More from Amazon
Reddit
175 k remote offer or 300 k in Bay Area
Reddit
Done with 3 rounds of On-site Amazon SDE 1 interview , but no communication after that. What to do?
Reddit
Nned direction for future prepration.
Reddit
Have an Amazon. SDE1 interview in 4 days, need tips
Reddit
After many years in the industry, I still struggle with textbook definitions in interviews