mirrors/LeetCode-Questions-CompanyWise
1
0
Fork 0
mirror of https://github.com/McSmog/LeetCode-Questions-CompanyWise.git synced 2026-04-19 16:56:45 +00:00
Code Issues Packages Projects Releases Wiki Activity

Update Pow(x;n) as name

Browse Source
This commit is contained in:
Krishna Dey
2020-08-25 16:13:54 +05:30
parent 0331bb542a
commit b73182e156
51 changed files with 51 additions and 51 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
microsoft_6months.csv
View File

@@ -234,7 +234,7 @@
153,Find Minimum in Rotated Sorted Array,45.1%,Medium,0.0037558729598054378, https://leetcode.com/problems/find-minimum-in-rotated-sorted-array
101,Symmetric Tree,46.8%,Easy,0.0034057078469827435, https://leetcode.com/problems/symmetric-tree
122,Best Time to Buy and Sell Stock II,57.0%,Easy,0.0033545821461532107, https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii
50,Pow(x, n),30.3%,Medium,0.0031510424503886844, https://leetcode.com/problems/powx-n
50,Pow(x;n),30.3%,Medium,0.0031510424503886844, https://leetcode.com/problems/powx-n
136,Single Number,65.5%,Easy,0.002869648285357666, https://leetcode.com/problems/single-number
104,Maximum Depth of Binary Tree,66.0%,Easy,0.002787846801433134, https://leetcode.com/problems/maximum-depth-of-binary-tree
106,Construct Binary Tree from Inorder and Postorder Traversal,47.2%,Medium,0.00234041415121758, https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal
1 1239 Maximum Length of a Concatenated String with Unique Characters 47.8% Medium 0.6657761816190897 https://leetcode.com/problems/maximum-length-of-a-concatenated-string-with-unique-characters
234 153 Find Minimum in Rotated Sorted Array 45.1% Medium 0.0037558729598054378 https://leetcode.com/problems/find-minimum-in-rotated-sorted-array
235 101 Symmetric Tree 46.8% Easy 0.0034057078469827435 https://leetcode.com/problems/symmetric-tree
236 122 Best Time to Buy and Sell Stock II 57.0% Easy 0.0033545821461532107 https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii
237 50 Pow(x Pow(x;n) n) 30.3% 30.3% Medium Medium 0.0031510424503886844 0.0031510424503886844 https://leetcode.com/problems/powx-n
238 136 Single Number 65.5% Easy 0.002869648285357666 https://leetcode.com/problems/single-number
239 104 Maximum Depth of Binary Tree 66.0% Easy 0.002787846801433134 https://leetcode.com/problems/maximum-depth-of-binary-tree
240 106 Construct Binary Tree from Inorder and Postorder Traversal 47.2% Medium 0.00234041415121758 https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal