Microsoft - LeetCode https://leetcode.

com/company/microsoft/

Problems(/problemset New (/contest/)

� LeetCode is(https://leetcode.com
hiring! Apply NOW.�� /binary-
(/) Explore(/explore/) Interview Contest Discuss(/discuss/) �
/all/) Store/jobs/)
trees-with-
 Microsoft factors/)

Problems Discuss

Notice
We've improved our algorithm that calculates company tags and their frequencies to be more accurate and current.

This page updates weekly on Saturday.

You can filter the results by different time periods.

You have solved ��� / ��� problems.

Show problem tags Select time period: � months

# Title Acceptance Difficulty Frequency 

 � Two Sum (/problems/two-sum) ��.�% Easy

 � Add Two Numbers (/problems/add-two-numbers) ��.�% Medium

 � Longest Substring Without Repeating Characters (/problems/longest-substring-without- ��.�% Medium

repeating-characters)

 � Median of Two Sorted Arrays (/problems/median-of-two-sorted-arrays) ��.�% Hard

 � Longest Palindromic Substring (/problems/longest-palindromic-substring) ��.�% Medium

 � Reverse Integer (/problems/reverse-integer) ��.�% Medium

 � String to Integer (atoi) (/problems/string-to-integer-atoi) ��.�% Medium

�� Regular Expression Matching (/problems/regular-expression-matching) ��.�% Hard

 �� Container With Most Water (/problems/container-with-most-water) ��.�% Medium

 �� Integer to Roman (/problems/integer-to-roman) ��.�% Medium

�� Roman to Integer (/problems/roman-to-integer) ��.�% Easy

 �� Longest Common Prefix (/problems/longest-common-prefix) ��.�% Easy

 �� �Sum (/problems/�sum) ��.�% Medium

 �� Letter Combinations of a Phone Number (/problems/letter-combinations-of-a-phone- ��.�% Medium

number)

�� �Sum (/problems/�sum) ��.�% Medium

�� Remove Nth Node From End of List (/problems/remove-nth-node-from-end-of-list) ��.�% Medium

 �� Valid Parentheses (/problems/valid-parentheses) ��.�% Easy

 �� Merge Two Sorted Lists (/problems/merge-two-sorted-lists) ��.�% Easy

 �� Generate Parentheses (/problems/generate-parentheses) ��.�% Medium

 �� Merge k Sorted Lists (/problems/merge-k-sorted-lists) ��.�% Hard

�� Swap Nodes in Pairs (/problems/swap-nodes-in-pairs) ��.�% Medium

�� Reverse Nodes in k-Group (/problems/reverse-nodes-in-k-group) ��.�% Hard

 �� Remove Duplicates from Sorted Array (/problems/remove-duplicates-from-sorted-array) ��.�% Easy

 �� Implement strStr() (/problems/implement-strstr) ��.�% Easy

�� Divide Two Integers (/problems/divide-two-integers) ��.�% Medium

�� Substring with Concatenation of All Words (/problems/substring-with-concatenation-of-all- ��.�% Hard

words)

�� Next Permutation (/problems/next-permutation) ��.�% Medium

�� Longest Valid Parentheses (/problems/longest-valid-parentheses) ��.�% Hard

 �� Search in Rotated Sorted Array (/problems/search-in-rotated-sorted-array) ��.�% Medium

1 of 10 09/08/22, 15:30
Microsoft - LeetCode https://leetcode.com/company/microsoft/

# Title Acceptance Difficulty Frequency 

�� Find First and Last Position of Element in Sorted Array (/problems/find-first-and-last-position- ��.�% Medium
of-element-in-sorted-array)

 �� Search Insert Position (/problems/search-insert-position) ��.�% Easy

 �� Valid Sudoku (/problems/valid-sudoku) ��.�% Medium

�� Sudoku Solver (/problems/sudoku-solver) ��.�% Hard

�� Combination Sum (/problems/combination-sum) ��.�% Medium

�� First Missing Positive (/problems/first-missing-positive) ��.�% Hard

 �� Trapping Rain Water (/problems/trapping-rain-water) ��.�% Hard

�� Multiply Strings (/problems/multiply-strings) ��.�% Medium

�� Wildcard Matching (/problems/wildcard-matching) ��.�% Hard

�� Jump Game II (/problems/jump-game-ii) ��.�% Medium

�� Permutations (/problems/permutations) ��.�% Medium

�� Permutations II (/problems/permutations-ii) ��.�% Medium

 �� Rotate Image (/problems/rotate-image) ��.�% Medium

 �� Group Anagrams (/problems/group-anagrams) ��.�% Medium

 �� Pow(x, n) (/problems/powx-n) ��.�% Medium

 �� N-Queens (/problems/n-queens) ��.�% Hard

 �� Maximum Subarray (/problems/maximum-subarray) ��.�% Medium

 �� Spiral Matrix (/problems/spiral-matrix) ��.�% Medium

 �� Merge Intervals (/problems/merge-intervals) ��.�% Medium

�� Insert Interval (/problems/insert-interval) ��.�% Medium

�� Spiral Matrix II (/problems/spiral-matrix-ii) ��.�% Medium

 �� Rotate List (/problems/rotate-list) ��.�% Medium

�� Unique Paths (/problems/unique-paths) ��.�% Medium

�� Unique Paths II (/problems/unique-paths-ii) ��.�% Medium

�� Minimum Path Sum (/problems/minimum-path-sum) ��.�% Medium

�� Text Justification (/problems/text-justification) ��.�% Hard

 �� Sqrt(x) (/problems/sqrtx) ��.�% Easy

 �� Climbing Stairs (/problems/climbing-stairs) ��.�% Easy

�� Simplify Path (/problems/simplify-path) ��.�% Medium

�� Edit Distance (/problems/edit-distance) ��.�% Hard

 �� Set Matrix Zeroes (/problems/set-matrix-zeroes) ��.�% Medium

 �� Search a �D Matrix (/problems/search-a-�d-matrix) ��.�% Medium

 �� Sort Colors (/problems/sort-colors) ��.�% Medium

�� Minimum Window Substring (/problems/minimum-window-substring) ��.�% Hard

 �� Combinations (/problems/combinations) ��.�% Medium

�� Subsets (/problems/subsets) ��.�% Medium

 �� Word Search (/problems/word-search) ��.�% Medium

 �� Remove Duplicates from Sorted List II (/problems/remove-duplicates-from-sorted-list-ii) ��.�% Medium

�� Largest Rectangle in Histogram (/problems/largest-rectangle-in-histogram) ��.�% Hard

 �� Merge Sorted Array (/problems/merge-sorted-array) ��.�% Easy

�� Decode Ways (/problems/decode-ways) ��.�% Medium

�� Reverse Linked List II (/problems/reverse-linked-list-ii) ��.�% Medium

2 of 10 09/08/22, 15:30
Microsoft - LeetCode https://leetcode.com/company/microsoft/

# Title Acceptance Difficulty Frequency 

�� Restore IP Addresses (/problems/restore-ip-addresses) ��.�% Medium

 �� Binary Tree Inorder Traversal (/problems/binary-tree-inorder-traversal) ��.�% Easy

�� Unique Binary Search Trees II (/problems/unique-binary-search-trees-ii) ��.�% Medium

�� Interleaving String (/problems/interleaving-string) ��.�% Medium

 �� Validate Binary Search Tree (/problems/validate-binary-search-tree) ��.�% Medium

 �� Recover Binary Search Tree (/problems/recover-binary-search-tree) ��.�% Medium

 ��� Symmetric Tree (/problems/symmetric-tree) ��.�% Easy

 ��� Binary Tree Level Order Traversal (/problems/binary-tree-level-order-traversal) ��.�% Medium

 ��� Binary Tree Zigzag Level Order Traversal (/problems/binary-tree-zigzag-level-order-traversal) ��.�% Medium

 ��� Maximum Depth of Binary Tree (/problems/maximum-depth-of-binary-tree) ��.�% Easy

 ��� Construct Binary Tree from Preorder and Inorder Traversal (/problems/construct-binary-tree- ��.�% Medium
from-preorder-and-inorder-traversal)

 ��� Convert Sorted Array to Binary Search Tree (/problems/convert-sorted-array-to-binary- ��.�% Easy
search-tree)

��� Convert Sorted List to Binary Search Tree (/problems/convert-sorted-list-to-binary-search- ��.�% Medium
tree)

��� Path Sum (/problems/path-sum) ��.�% Easy

 ��� Flatten Binary Tree to Linked List (/problems/flatten-binary-tree-to-linked-list) ��.�% Medium

 ��� Populating Next Right Pointers in Each Node (/problems/populating-next-right-pointers-in- ��.�% Medium
each-node)

 ��� Populating Next Right Pointers in Each Node II (/problems/populating-next-right-pointers-in- ��.�% Medium
each-node-ii)

 ��� Pascal's Triangle (/problems/pascals-triangle) ��.�% Easy

 ��� Pascal's Triangle II (/problems/pascals-triangle-ii) ��.�% Easy

��� Triangle (/problems/triangle) ��.�% Medium

 ��� Best Time to Buy and Sell Stock (/problems/best-time-to-buy-and-sell-stock) ��.�% Easy

 ��� Best Time to Buy and Sell Stock II (/problems/best-time-to-buy-and-sell-stock-ii) ��.�% Medium

��� Binary Tree Maximum Path Sum (/problems/binary-tree-maximum-path-sum) ��.�% Hard

 ��� Valid Palindrome (/problems/valid-palindrome) ��.�% Easy

��� Word Ladder II (/problems/word-ladder-ii) ��.�% Hard

��� Word Ladder (/problems/word-ladder) ��.�% Hard

��� Longest Consecutive Sequence (/problems/longest-consecutive-sequence) ��.�% Medium

 ��� Sum Root to Leaf Numbers (/problems/sum-root-to-leaf-numbers) ��.�% Medium

 ��� Clone Graph (/problems/clone-graph) ��.�% Medium

��� Gas Station (/problems/gas-station) ��.�% Medium

��� Candy (/problems/candy) ��.�% Hard

 ��� Single Number (/problems/single-number) ��.�% Easy

 ��� Copy List with Random Pointer (/problems/copy-list-with-random-pointer) ��.�% Medium

��� Word Break (/problems/word-break) ��.�% Medium

��� Word Break II (/problems/word-break-ii) ��.�% Hard

��� Reorder List (/problems/reorder-list) ��.�% Medium

 ��� LRU Cache (/problems/lru-cache) ��.�% Medium

 ��� Sort List (/problems/sort-list) ��.�% Medium

��� Max Points on a Line (/problems/max-points-on-a-line) ��.�% Hard

��� Evaluate Reverse Polish Notation (/problems/evaluate-reverse-polish-notation) ��.�% Medium

3 of 10 09/08/22, 15:30
Microsoft - LeetCode https://leetcode.com/company/microsoft/

# Title Acceptance Difficulty Frequency 

 ��� Reverse Words in a String (/problems/reverse-words-in-a-string) ��.�% Medium

 ��� Maximum Product Subarray (/problems/maximum-product-subarray) ��.�% Medium

 ��� Find Minimum in Rotated Sorted Array (/problems/find-minimum-in-rotated-sorted-array) ��.�% Medium

 ��� Min Stack (/problems/min-stack) ��.�% Medium

��� Read N Characters Given read� II - Call Multiple Times (/problems/read-n-characters-given- ��.�% Hard
read�-ii-call-multiple-times) 

��� Longest Substring with At Most Two Distinct Characters (/problems/longest-substring-with-at- ��.�% Medium
most-two-distinct-characters) 

 ��� Intersection of Two Linked Lists (/problems/intersection-of-two-linked-lists) ��.�% Easy

��� Compare Version Numbers (/problems/compare-version-numbers) ��.�% Medium

��� Fraction to Recurring Decimal (/problems/fraction-to-recurring-decimal) ��.�% Medium

��� Excel Sheet Column Title (/problems/excel-sheet-column-title) ��.�% Easy

 ��� Majority Element (/problems/majority-element) ��.�% Easy

��� Excel Sheet Column Number (/problems/excel-sheet-column-number) ��.�% Easy

��� Factorial Trailing Zeroes (/problems/factorial-trailing-zeroes) ��.�% Medium

 ��� Binary Search Tree Iterator (/problems/binary-search-tree-iterator) ��.�% Medium

 ��� Largest Number (/problems/largest-number) ��.�% Medium

 ��� Reverse Words in a String II (/problems/reverse-words-in-a-string-ii)  ��.�% Medium

 ��� Rotate Array (/problems/rotate-array) ��.�% Medium

 ��� Number of � Bits (/problems/number-of-�-bits) ��.�% Easy

��� Word Frequency (/problems/word-frequency) ��.�% Medium

 ��� House Robber (/problems/house-robber) ��.�% Medium

 ��� Binary Tree Right Side View (/problems/binary-tree-right-side-view) ��.�% Medium

 ��� Number of Islands (/problems/number-of-islands) ��.�% Medium

��� Happy Number (/problems/happy-number) ��.�% Easy

 ��� Count Primes (/problems/count-primes) ��.�% Medium

��� Isomorphic Strings (/problems/isomorphic-strings) ��.�% Easy

 ��� Reverse Linked List (/problems/reverse-linked-list) ��.�% Easy

 ��� Course Schedule (/problems/course-schedule) ��.�% Medium

 ��� Implement Trie (Prefix Tree) (/problems/implement-trie-prefix-tree) ��.�% Medium

 ��� Minimum Size Subarray Sum (/problems/minimum-size-subarray-sum) ��.�% Medium

��� Course Schedule II (/problems/course-schedule-ii) ��.�% Medium

��� Design Add and Search Words Data Structure (/problems/design-add-and-search-words-data- ��.�% Medium
structure)

 ��� Word Search II (/problems/word-search-ii) ��.�% Hard

��� Kth Largest Element in an Array (/problems/kth-largest-element-in-an-array) ��.�% Medium

 ��� Contains Duplicate (/problems/contains-duplicate) ��.�% Easy

��� The Skyline Problem (/problems/the-skyline-problem) ��.�% Hard

 ��� Contains Duplicate II (/problems/contains-duplicate-ii) ��.�% Easy

��� Maximal Square (/problems/maximal-square) ��.�% Medium

��� Basic Calculator (/problems/basic-calculator) ��.�% Hard

 ��� Invert Binary Tree (/problems/invert-binary-tree) ��.�% Easy

��� Basic Calculator II (/problems/basic-calculator-ii) ��.�% Medium

��� Majority Element II (/problems/majority-element-ii) ��.�% Medium

4 of 10 09/08/22, 15:30
Microsoft - LeetCode https://leetcode.com/company/microsoft/

# Title Acceptance Difficulty Frequency 

 ��� Kth Smallest Element in a BST (/problems/kth-smallest-element-in-a-bst) ��.�% Medium

 ��� Implement Queue using Stacks (/problems/implement-queue-using-stacks) ��.�% Easy

 ��� Palindrome Linked List (/problems/palindrome-linked-list) ��.�% Easy

 ��� Lowest Common Ancestor of a Binary Tree (/problems/lowest-common-ancestor-of-a-binary- ��.�% Medium

tree)

 ��� Product of Array Except Self (/problems/product-of-array-except-self) ��.�% Medium

��� Sliding Window Maximum (/problems/sliding-window-maximum) ��.�% Hard

 ��� Search a �D Matrix II (/problems/search-a-�d-matrix-ii) ��.�% Medium

 ��� Valid Anagram (/problems/valid-anagram) ��.�% Easy

��� Count Univalue Subtrees (/problems/count-univalue-subtrees)  ��.�% Medium

 ��� Meeting Rooms II (/problems/meeting-rooms-ii)  ��.�% Medium

 ��� Binary Tree Paths (/problems/binary-tree-paths) ��.�% Easy

��� Graph Valid Tree (/problems/graph-valid-tree)  ��.�% Medium

 ��� Missing Number (/problems/missing-number) ��.�% Easy

��� Alien Dictionary (/problems/alien-dictionary)  ��.�% Hard

��� Integer to English Words (/problems/integer-to-english-words) ��.�% Hard

��� H-Index (/problems/h-index) ��.�% Medium

��� Find the Celebrity (/problems/find-the-celebrity)  ��.�% Medium

 ��� First Bad Version (/problems/first-bad-version) ��.�% Easy

 ��� Perfect Squares (/problems/perfect-squares) ��.�% Medium

 ��� Move Zeroes (/problems/move-zeroes) ��.�% Easy

 ��� Inorder Successor in BST (/problems/inorder-successor-in-bst)  ��.�% Medium

 ��� Find the Duplicate Number (/problems/find-the-duplicate-number) ��.�% Medium

 ��� Nim Game (/problems/nim-game) ��.�% Easy

 ��� Find Median from Data Stream (/problems/find-median-from-data-stream) ��.�% Hard

��� Serialize and Deserialize Binary Tree (/problems/serialize-and-deserialize-binary-tree) ��.�% Hard

 ��� Longest Increasing Subsequence (/problems/longest-increasing-subsequence) ��.�% Medium

��� Burst Balloons (/problems/burst-balloons) ��.�% Hard

��� Binary Tree Vertical Order Traversal (/problems/binary-tree-vertical-order-traversal)  ��.�% Medium

��� Count of Smaller Numbers After Self (/problems/count-of-smaller-numbers-after-self) ��.�% Hard

��� Shortest Distance from All Buildings (/problems/shortest-distance-from-all-buildings)  ��.�% Hard

��� Bulb Switcher (/problems/bulb-switcher) ��.�% Medium

��� Coin Change (/problems/coin-change) ��.�% Medium

��� Number of Connected Components in an Undirected Graph (/problems/number-of- ��.�% Medium

connected-components-in-an-undirected-graph) 

��� Wiggle Sort II (/problems/wiggle-sort-ii) ��.�% Medium

��� Largest BST Subtree (/problems/largest-bst-subtree)  ��.�% Medium

��� House Robber III (/problems/house-robber-iii) ��.�% Medium

 ��� Counting Bits (/problems/counting-bits) ��.�% Easy

��� Longest Substring with At Most K Distinct Characters (/problems/longest-substring-with-at- ��.�% Medium
most-k-distinct-characters) 

��� Flatten Nested List Iterator (/problems/flatten-nested-list-iterator) ��.�% Medium

 ��� Reverse String (/problems/reverse-string) ��.�% Easy

 ��� Top K Frequent Elements (/problems/top-k-frequent-elements) ��.�% Medium

5 of 10 09/08/22, 15:30
Microsoft - LeetCode https://leetcode.com/company/microsoft/

# Title Acceptance Difficulty Frequency 

��� Design Tic-Tac-Toe (/problems/design-tic-tac-toe)  ��.�% Medium

��� Intersection of Two Arrays II (/problems/intersection-of-two-arrays-ii) ��.�% Easy

 ��� Design Twitter (/problems/design-twitter) ��.�% Medium

��� Rearrange String k Distance Apart (/problems/rearrange-string-k-distance-apart)  ��.�% Hard

��� Logger Rate Limiter (/problems/logger-rate-limiter)  ��.�% Easy

��� Design Hit Counter (/problems/design-hit-counter)  ��.�% Medium

��� Find Leaves of Binary Tree (/problems/find-leaves-of-binary-tree)  ��.�% Medium

��� Largest Divisible Subset (/problems/largest-divisible-subset) ��.�% Medium

��� Combination Sum IV (/problems/combination-sum-iv) ��.�% Medium

��� Kth Smallest Element in a Sorted Matrix (/problems/kth-smallest-element-in-a-sorted-matrix) ��.�% Medium

 ��� Insert Delete GetRandom O(�) (/problems/insert-delete-getrandom-o�) ��.�% Medium

 ��� First Unique Character in a String (/problems/first-unique-character-in-a-string) ��.�% Easy

��� Decode String (/problems/decode-string) ��.�% Medium

��� Longest Substring with At Least K Repeating Characters (/problems/longest-substring-with-at- ��.�% Medium
least-k-repeating-characters)

��� Evaluate Division (/problems/evaluate-division) ��.�% Medium

��� Remove K Digits (/problems/remove-k-digits) ��.�% Medium

��� Frog Jump (/problems/frog-jump) ��.�% Hard

��� Add Strings (/problems/add-strings) ��.�% Easy

��� Partition Equal Subset Sum (/problems/partition-equal-subset-sum) ��.�% Medium

��� Pacific Atlantic Water Flow (/problems/pacific-atlantic-water-flow) ��.�% Medium

��� Battleships in a Board (/problems/battleships-in-a-board) ��.�% Medium

��� Non-overlapping Intervals (/problems/non-overlapping-intervals) ��.�% Medium

��� Path Sum III (/problems/path-sum-iii) ��.�% Medium

��� Find All Anagrams in a String (/problems/find-all-anagrams-in-a-string) ��.�% Medium

 ��� Find All Duplicates in an Array (/problems/find-all-duplicates-in-an-array) ��.�% Medium

��� String Compression (/problems/string-compression) ��.�% Medium

 ��� Add Two Numbers II (/problems/add-two-numbers-ii) ��.�% Medium

��� Serialize and Deserialize BST (/problems/serialize-and-deserialize-bst) ��.�% Medium

 ��� Delete Node in a BST (/problems/delete-node-in-a-bst) ��.�% Medium

��� Sort Characters By Frequency (/problems/sort-characters-by-frequency) ��.�% Medium

��� Minimum Number of Arrows to Burst Balloons (/problems/minimum-number-of-arrows-to- ��.�% Medium

burst-balloons)

��� Minimum Moves to Equal Array Elements (/problems/minimum-moves-to-equal-array- ��.�% Medium

elements)

��� ��� Pattern (/problems/���-pattern) ��.�% Medium

��� LFU Cache (/problems/lfu-cache) ��.�% Hard

��� Minimum Moves to Equal Array Elements II (/problems/minimum-moves-to-equal-array- ��.�% Medium

elements-ii)

��� Validate IP Address (/problems/validate-ip-address) ��.�% Medium

��� Concatenated Words (/problems/concatenated-words) ��.�% Hard

��� Sliding Window Median (/problems/sliding-window-median) ��.�% Hard

��� Predict the Winner (/problems/predict-the-winner) ��.�% Medium

��� The Maze (/problems/the-maze)  ��.�% Medium

6 of 10 09/08/22, 15:30
Microsoft - LeetCode https://leetcode.com/company/microsoft/

# Title Acceptance Difficulty Frequency 

��� Reverse Pairs (/problems/reverse-pairs) ��.�% Hard

��� Next Greater Element I (/problems/next-greater-element-i) ��.�% Easy

��� Diagonal Traverse (/problems/diagonal-traverse) ��.�% Medium

��� Inorder Successor in BST II (/problems/inorder-successor-in-bst-ii)  ��.�% Medium

��� Contiguous Array (/problems/contiguous-array) ��.�% Medium

��� Minesweeper (/problems/minesweeper) ��.�% Medium

��� Single Element in a Sorted Array (/problems/single-element-in-a-sorted-array) ��.�% Medium

��� �� Matrix (/problems/��-matrix) ��.�% Medium

 ��� Diameter of Binary Tree (/problems/diameter-of-binary-tree) ��.�% Easy

��� Boundary of Binary Tree (/problems/boundary-of-binary-tree)  ��.�% Medium

��� Next Greater Element III (/problems/next-greater-element-iii) ��.�% Medium

��� Reverse Words in a String III (/problems/reverse-words-in-a-string-iii) ��.�% Easy

 ��� Subarray Sum Equals K (/problems/subarray-sum-equals-k) ��.�% Medium

��� Permutation in String (/problems/permutation-in-string) ��.�% Medium

��� Subtree of Another Tree (/problems/subtree-of-another-tree) ��.�% Easy

��� Shortest Unsorted Continuous Subarray (/problems/shortest-unsorted-continuous-subarray) ��.�% Medium

��� Delete Operation for Two Strings (/problems/delete-operation-for-two-strings) ��.�% Medium

��� Design In-Memory File System (/problems/design-in-memory-file-system)  ��.�% Hard

��� Tag Validator (/problems/tag-validator) ��.�% Hard

��� Maximum Product of Three Numbers (/problems/maximum-product-of-three-numbers) ��.�% Easy

��� Smallest Range Covering Elements from K Lists (/problems/smallest-range-covering- ��.�% Hard
elements-from-k-lists)

 ��� Average of Levels in Binary Tree (/problems/average-of-levels-in-binary-tree) ��.�% Easy

��� Solve the Equation (/problems/solve-the-equation) ��.�% Medium

��� Design Search Autocomplete System (/problems/design-search-autocomplete-system)  ��.�% Hard

��� Two Sum IV - Input is a BST (/problems/two-sum-iv-input-is-a-bst) ��.�% Easy

��� Maximum Width of Binary Tree (/problems/maximum-width-of-binary-tree) ��.�% Medium

��� Trim a Binary Search Tree (/problems/trim-a-binary-search-tree) ��.�% Medium

��� Redundant Connection (/problems/redundant-connection) ��.�% Medium

��� Top K Frequent Words (/problems/top-k-frequent-words) ��.�% Medium

 ��� Number of Distinct Islands (/problems/number-of-distinct-islands)  ��.�% Medium

 ��� Max Area of Island (/problems/max-area-of-island) ��.�% Medium

��� Partition to K Equal Sum Subsets (/problems/partition-to-k-equal-sum-subsets) ��.�% Medium

��� Find Pivot Index (/problems/find-pivot-index) ��.�% Easy

��� Number of Atoms (/problems/number-of-atoms) ��.�% Hard

��� Flood Fill (/problems/flood-fill) ��.�% Easy

��� Asteroid Collision (/problems/asteroid-collision) ��.�% Medium

 ��� Daily Temperatures (/problems/daily-temperatures) ��.�% Medium

��� Network Delay Time (/problems/network-delay-time) ��.�% Medium

��� Convert Binary Search Tree to Sorted Doubly Linked List (/problems/convert-binary-search- ��.�% Medium
tree-to-sorted-doubly-linked-list) 

��� Employee Free Time (/problems/employee-free-time)  ��.�% Hard

��� Serialize and Deserialize N-ary Tree (/problems/serialize-and-deserialize-n-ary-tree)  ��.�% Hard

7 of 10 09/08/22, 15:30
Microsoft - LeetCode https://leetcode.com/company/microsoft/

# Title Acceptance Difficulty Frequency 

��� Max Chunks To Make Sorted II (/problems/max-chunks-to-make-sorted-ii) ��.�% Hard

��� Basic Calculator III (/problems/basic-calculator-iii)  ��.�% Hard

 ��� Kth Largest Element in a Stream (/problems/kth-largest-element-in-a-stream) ��.�% Easy

 ��� Binary Search (/problems/binary-search) ��.�% Easy

��� Cheapest Flights Within K Stops (/problems/cheapest-flights-within-k-stops) ��.�% Medium

��� Number of Matching Subsequences (/problems/number-of-matching-subsequences) ��.�% Medium

��� Rotate String (/problems/rotate-string) ��.�% Easy

��� Design HashSet (/problems/design-hashset) ��.�% Easy

��� Design HashMap (/problems/design-hashmap) ��.�% Easy

��� Bus Routes (/problems/bus-routes) ��.�% Hard

��� Design Linked List (/problems/design-linked-list) ��.�% Medium

��� Making A Large Island (/problems/making-a-large-island) ��.�% Hard

��� Design Circular Queue (/problems/design-circular-queue) ��.�% Medium

��� Robot Room Cleaner (/problems/robot-room-cleaner)  ��.�% Hard

��� Rectangle Overlap (/problems/rectangle-overlap) ��.�% Easy

��� Guess the Word (/problems/guess-the-word) ��.�% Hard

��� Longest Mountain in Array (/problems/longest-mountain-in-array) ��.�% Medium

��� Shortest Path Visiting All Nodes (/problems/shortest-path-visiting-all-nodes) ��.�% Hard

��� Maximize Distance to Closest Person (/problems/maximize-distance-to-closest-person) ��.�% Medium

��� All Nodes Distance K in Binary Tree (/problems/all-nodes-distance-k-in-binary-tree) ��.�% Medium

��� Random Pick with Weight (/problems/random-pick-with-weight) ��.�% Medium

��� Boats to Save People (/problems/boats-to-save-people) ��.�% Medium

��� Spiral Matrix III (/problems/spiral-matrix-iii) ��.�% Medium

��� Possible Bipartition (/problems/possible-bipartition) ��.�% Medium

��� Sum of Subarray Minimums (/problems/sum-of-subarray-minimums) ��.�% Medium

��� Snakes and Ladders (/problems/snakes-and-ladders) ��.�% Medium

��� Minimum Add to Make Parentheses Valid (/problems/minimum-add-to-make-parentheses- ��.�% Medium

valid)

��� Flip String to Monotone Increasing (/problems/flip-string-to-monotone-increasing) ��.�% Medium

��� Shortest Bridge (/problems/shortest-bridge) ��.�% Medium

��� Numbers With Same Consecutive Differences (/problems/numbers-with-same-consecutive- ��.�% Medium

differences)

 ��� Fibonacci Number (/problems/fibonacci-number) ��.�% Easy

��� K Closest Points to Origin (/problems/k-closest-points-to-origin) ��.�% Medium

��� Subarray Sums Divisible by K (/problems/subarray-sums-divisible-by-k) ��.�% Medium

��� Squares of a Sorted Array (/problems/squares-of-a-sorted-array) ��.�% Easy

��� Time Based Key-Value Store (/problems/time-based-key-value-store) ��.�% Medium

��� Interval List Intersections (/problems/interval-list-intersections) ��.�% Medium

��� Vertical Order Traversal of a Binary Tree (/problems/vertical-order-traversal-of-a-binary-tree) ��.�% Hard

��� Rotting Oranges (/problems/rotting-oranges) ��.�% Medium

��� Minimum Number of K Consecutive Bit Flips (/problems/minimum-number-of-k-consecutive- ��.�% Hard

bit-flips)

���� Max Consecutive Ones III (/problems/max-consecutive-ones-iii) ��.�% Medium

8 of 10 09/08/22, 15:30
Microsoft - LeetCode https://leetcode.com/company/microsoft/

# Title Acceptance Difficulty Frequency 

���� Construct Binary Search Tree from Preorder Traversal (/problems/construct-binary-search- ��.�% Medium
tree-from-preorder-traversal)

���� Capacity To Ship Packages Within D Days (/problems/capacity-to-ship-packages-within- ��.�% Medium

d-days)

���� Longest Arithmetic Subsequence (/problems/longest-arithmetic-subsequence) ��.�% Medium

���� Two City Scheduling (/problems/two-city-scheduling) ��.�% Medium

���� Maximum Sum of Two Non-Overlapping Subarrays (/problems/maximum-sum-of-two-non- ��.�% Medium

overlapping-subarrays)

���� Stream of Characters (/problems/stream-of-characters) ��.�% Hard

���� As Far from Land as Possible (/problems/as-far-from-land-as-possible) ��.�% Medium

���� Longest Duplicate Substring (/problems/longest-duplicate-substring) ��.�% Hard

���� Remove All Adjacent Duplicates In String (/problems/remove-all-adjacent-duplicates-in- ��.�% Easy

string)

���� Shortest Path in Binary Matrix (/problems/shortest-path-in-binary-matrix) ��.�% Medium

���� Design A Leaderboard (/problems/design-a-leaderboard)  ��.�% Medium

���� Snapshot Array (/problems/snapshot-array) ��.�% Medium

���� Longest Common Subsequence (/problems/longest-common-subsequence) ��.�% Medium

���� Day of the Year (/problems/day-of-the-year) ��.�% Easy

���� Swap For Longest Repeated Character Substring (/problems/swap-for-longest-repeated- ��.�% Medium
character-substring)

���� Web Crawler (/problems/web-crawler)  ��.�% Medium

���� Maximum Number of Balloons (/problems/maximum-number-of-balloons) ��.�% Easy

���� Reverse Substrings Between Each Pair of Parentheses (/problems/reverse-substrings- ��.�% Medium
between-each-pair-of-parentheses)

���� Critical Connections in a Network (/problems/critical-connections-in-a-network) ��.�% Hard

���� Longest Happy String (/problems/longest-happy-string) ��.�% Medium

���� Minimum Number of Moves to Make Palindrome (/problems/minimum-number-of-moves-to- ��.�% Hard

make-palindrome)

���� Maximum Length of a Concatenated String with Unique Characters (/problems/maximum- ��.�% Medium
length-of-a-concatenated-string-with-unique-characters)

���� Number of Closed Islands (/problems/number-of-closed-islands) ��.�% Medium

���� Count Servers that Communicate (/problems/count-servers-that-communicate) ��.�% Medium

���� Find Winner on a Tic Tac Toe Game (/problems/find-winner-on-a-tic-tac-toe-game) ��.�% Easy

���� Shortest Path in a Grid with Obstacles Elimination (/problems/shortest-path-in-a-grid-with- ��.�% Hard
obstacles-elimination)

���� Find N Unique Integers Sum up to Zero (/problems/find-n-unique-integers-sum-up-to-zero) ��.�% Easy

���� Jump Game III (/problems/jump-game-iii) ��.�% Medium

���� Number of Operations to Make Network Connected (/problems/number-of-operations-to- ��.�% Medium

make-network-connected)

���� Number of Steps to Reduce a Number to Zero (/problems/number-of-steps-to-reduce- ��.�% Easy

a-number-to-zero)

���� Angle Between Hands of a Clock (/problems/angle-between-hands-of-a-clock) ��.�% Medium

���� Minimum Number of Taps to Open to Water a Garden (/problems/minimum-number-of-taps- ��.�% Hard
to-open-to-water-a-garden)

���� Count Negative Numbers in a Sorted Matrix (/problems/count-negative-numbers-in-a-sorted- ��.�% Easy

matrix)

���� Cinema Seat Allocation (/problems/cinema-seat-allocation) ��.�% Medium

���� Number of Steps to Reduce a Number in Binary Representation to One (/problems/number- ��.�% Medium
of-steps-to-reduce-a-number-in-binary-representation-to-one)

9 of 10 09/08/22, 15:30
Microsoft - LeetCode https://leetcode.com/company/microsoft/

# Title Acceptance Difficulty Frequency 

���� Count Good Nodes in Binary Tree (/problems/count-good-nodes-in-binary-tree) ��.�% Medium

���� Number of Students Doing Homework at a Given Time (/problems/number-of-students- ��.�% Easy
doing-homework-at-a-given-time)

���� Shuffle the Array (/problems/shuffle-the-array) ��.�% Easy

���� Making File Names Unique (/problems/making-file-names-unique) ��.�% Medium

���� Minimum Insertions to Balance a Parentheses String (/problems/minimum-insertions-to- ��.�% Medium

balance-a-parentheses-string)

���� Maximum Number of Non-Overlapping Subarrays With Sum Equals Target (/problems ��.�% Medium
/maximum-number-of-non-overlapping-subarrays-with-sum-equals-target)

���� Minimum Cost to Cut a Stick (/problems/minimum-cost-to-cut-a-stick) ��.�% Hard

���� Minimum Operations to Make Array Equal (/problems/minimum-operations-to-make-array- ��.�% Medium

equal)

���� Minimum Time to Make Rope Colorful (/problems/minimum-time-to-make-rope-colorful) ��.�% Medium

���� Dot Product of Two Sparse Vectors (/problems/dot-product-of-two-sparse-vectors)  ��.�% Medium

���� Maximal Network Rank (/problems/maximal-network-rank) ��.�% Medium

���� Minimum Deletions to Make String Balanced (/problems/minimum-deletions-to-make-string- ��.�% Medium

balanced)

���� Furthest Building You Can Reach (/problems/furthest-building-you-can-reach) ��.�% Medium

 ���� Minimum Deletions to Make Character Frequencies Unique (/problems/minimum-deletions- ��.�% Medium
to-make-character-frequencies-unique)

���� Ways to Split Array Into Three Subarrays (/problems/ways-to-split-array-into-three-subarrays) ��.�% Medium

���� Longest Nice Substring (/problems/longest-nice-substring) ��.�% Easy

���� Closest Dessert Cost (/problems/closest-dessert-cost) ��.�% Medium

���� Equal Sum Arrays With Minimum Number of Operations (/problems/equal-sum-arrays-with- ��.�% Medium
minimum-number-of-operations)

���� Sign of the Product of an Array (/problems/sign-of-the-product-of-an-array) ��.�% Easy

���� Frequency of the Most Frequent Element (/problems/frequency-of-the-most-frequent- ��.�% Medium

element)

���� Remove Duplicates From an Unsorted Linked List (/problems/remove-duplicates-from-an- ��.�% Medium
unsorted-linked-list) 

���� Egg Drop With � Eggs and N Floors (/problems/egg-drop-with-�-eggs-and-n-floors) ��.�% Medium

���� Minimum Number of Swaps to Make the String Balanced (/problems/minimum-number-of- ��.�% Medium
swaps-to-make-the-string-balanced)

���� Minimum Number of Work Sessions to Finish the Tasks (/problems/minimum-number-of- ��.�% Medium
work-sessions-to-finish-the-tasks)
Copyright © ���� LeetCode
���� Partition
Help Center (/support)
Array Into Bug
Jobs (/jobs)
TwoBounty
Arrays(/bugbounty)
to Minimize Sum Difference (/problems/partition-array-into-
Online Interview (/interview/) Students (/student)
��.�%
Terms (/terms)
Hard
Privacy Policy (/privacy)
two-arrays-to-minimize-sum-difference)
United States (/region)
���� Step-By-Step Directions From a Binary Tree Node to Another (/problems/step-by-step- ��.�% Medium
directions-from-a-binary-tree-node-to-another)

���� Find All Possible Recipes from Given Supplies (/problems/find-all-possible-recipes-from- ��.�% Medium
given-supplies)

���� Minimum Swaps to Group All �'s Together II (/problems/minimum-swaps-to-group-all-�s- ��.�% Medium
together-ii)

���� Removing Minimum Number of Magic Beans (/problems/removing-minimum-number-of- ��.�% Medium

magic-beans)

���� Counting Words With a Given Prefix (/problems/counting-words-with-a-given-prefix) ��.�% Easy

���� Remove Digit From Number to Maximize Result (/problems/remove-digit-from-number-to- ��.�% Easy
maximize-result)

���� Longest Path With Different Adjacent Characters (/problems/longest-path-with-different- ��.�% Hard
adjacent-characters)

10 of 10 09/08/22, 15:30