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_1year.csv
View File

@@ -341,7 +341,7 @@
64,Minimum Path Sum,54.5%,Medium,0.006127470152097104, https://leetcode.com/problems/minimum-path-sum
144,Binary Tree Preorder Traversal,55.7%,Medium,0.0060975798681185, https://leetcode.com/problems/binary-tree-preorder-traversal
973,K Closest Points to Origin,63.8%,Medium,0.005773688094426333, https://leetcode.com/problems/k-closest-points-to-origin
50,Pow(x, n),30.3%,Medium,0.0055950070772402055, https://leetcode.com/problems/powx-n
50,Pow(x;n),30.3%,Medium,0.0055950070772402055, https://leetcode.com/problems/powx-n
167,Two Sum II - Input array is sorted,54.1%,Easy,0.005507380022589096, https://leetcode.com/problems/two-sum-ii-input-array-is-sorted
112,Path Sum,41.2%,Easy,0.00546972510956646, https://leetcode.com/problems/path-sum
106,Construct Binary Tree from Inorder and Postorder Traversal,47.2%,Medium,0.005258250021550252, 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 1.08746055306763 https://leetcode.com/problems/maximum-length-of-a-concatenated-string-with-unique-characters
341 64 Minimum Path Sum 54.5% Medium 0.006127470152097104 https://leetcode.com/problems/minimum-path-sum
342 144 Binary Tree Preorder Traversal 55.7% Medium 0.0060975798681185 https://leetcode.com/problems/binary-tree-preorder-traversal
343 973 K Closest Points to Origin 63.8% Medium 0.005773688094426333 https://leetcode.com/problems/k-closest-points-to-origin
344 50 Pow(x Pow(x;n) n) 30.3% 30.3% Medium Medium 0.0055950070772402055 0.0055950070772402055 https://leetcode.com/problems/powx-n
345 167 Two Sum II - Input array is sorted 54.1% Easy 0.005507380022589096 https://leetcode.com/problems/two-sum-ii-input-array-is-sorted
346 112 Path Sum 41.2% Easy 0.00546972510956646 https://leetcode.com/problems/path-sum
347 106 Construct Binary Tree from Inorder and Postorder Traversal 47.2% Medium 0.005258250021550252 https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal