Microsoft - LeetCode
Microsoft - LeetCode
Notice
We've improved our algorithm that calculates company tags and their frequencies to be more accurate
and current.
105 Construct Binary Tree from Preorder and Inorder 44.3% Medium
Traversal (/problems/construct-binary-tree-from-
preorder-and-inorder-traversal)
121 Best Time to Buy and Sell Stock (/problems/best-time- 48.8% Easy
to-buy-and-sell-stock)
106 Construct Binary Tree from Inorder and Postorder 42.0% Medium
Traversal (/problems/construct-binary-tree-from-
inorder-and-postorder-traversal)
123 Best Time to Buy and Sell Stock III (/problems/best- 35.4% Hard
time-to-buy-and-sell-stock-iii)
122 Best Time to Buy and Sell Stock II (/problems/best- 53.7% Easy
time-to-buy-and-sell-stock-ii)
426 Convert Binary Search Tree to Sorted Doubly Linked 55.7% Medium
List (/problems/convert-binary-search-tree-to-sorted-
doubly-linked-list)
158 Read N Characters Given Read4 II - Call multiple times 29.4% Hard
(/problems/read-n-characters-given-read4-ii-call-
multiple-times)
34 Find First and Last Position of Element in Sorted Array 34.6% Medium
(/problems/find-first-and-last-position-of-element-in-
sorted-array)
211 Add and Search Word - Data structure design 32.9% Medium
(/problems/add-and-search-word-data-structure-
design)
515 Find Largest Value in Each Tree Row (/problems/find- 58.9% Medium
largest-value-in-each-tree-row)
1013 Partition Array Into Three Parts With Equal Sum 56.7% Easy
(/problems/partition-array-into-three-parts-with-equal-
sum)