Arrays & Hash Maps · Microsoft SDE-1 Interview Sheet

Microsoft SDE-1 Interview Sheet

Arrays & Hash Maps

12 problems

problem

Topic Progress0 / 12 solved

Problem List

Work through the problems in sequence to build topic mastery.

Problem	Difficulty	Status	Optional
Two Sum	Medium	Unsolved	Required
Contains Duplicate	Medium	Unsolved	Required
Majority Element	Medium	Unsolved	Required
Maximum Subarray	Medium	Unsolved	Required
Product Of Array Except Self	Medium	Unsolved	Required
Subarray Sum Equals K	Medium	Unsolved	Required
Longest Consecutive Sequence	Medium	Unsolved	Required
Sort Colors	Medium	Unsolved	Required
Best Time To Buy And Sell Stock	Medium	Unsolved	Required
Best Time To Buy And Sell Stock Ii	Medium	Unsolved	Required
Merge Sorted Array	Medium	Unsolved	Required
Top K Frequent Elements	Medium	Unsolved	Required

Topic Snapshot

A compact summary of what this sheet section covers and how far you have progressed.

Arrays & Hash Maps

Cover the most reusable array patterns: maps, sorting, prefix sums, and greedy scans.

microsoft

sde-1

Completion

Problems Remaining

Optional Problems

Complete the required items first, then use optional problems for extra depth.

Loading Preptin