0% found this document useful (0 votes)
18 views3 pages

ByteDance - LeetCode

ByteDance has improved its algorithm for calculating company tags and their frequencies, which will now be updated weekly. The document lists various problems with their acceptance rates, difficulty levels, and frequencies, indicating the performance of each problem. Users can filter results based on different time periods.

Uploaded by

V DIVYA
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
18 views3 pages

ByteDance - LeetCode

ByteDance has improved its algorithm for calculating company tags and their frequencies, which will now be updated weekly. The document lists various problems with their acceptance rates, difficulty levels, and frequencies, indicating the performance of each problem. Users can filter results based on different time periods.

Uploaded by

V DIVYA
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

 ByteDance

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 0 / 45 problems.

Show problem tags Select time period: All time

# Title Acceptance Difficulty Frequency 

440 K-th Smallest in Lexicographical Order (/problems/k- 27.7% Hard


th-smallest-in-lexicographical-order)

42 Trapping Rain Water (/problems/trapping-rain-water) 45.8% Hard

1202 Smallest String With Swaps (/problems/smallest-string- 41.7% Medium


with-swaps)

470 Implement Rand10() Using Rand7() 45.5% Medium


(/problems/implement-rand10-using-rand7)

670 Maximum Swap (/problems/maximum-swap) 41.2% Medium

146 LRU Cache (/problems/lru-cache) 28.6% Medium

1057 Campus Bikes (/problems/campus-bikes)  58.3% Medium

85 Maximal Rectangle (/problems/maximal-rectangle) 35.2% Hard

33 Search in Rotated Sorted Array (/problems/search-in- 33.4% Medium


rotated-sorted-array)

25 Reverse Nodes in k-Group (/problems/reverse-nodes- 38.7% Hard


in-k-group)

71 Simplify Path (/problems/simplify-path) 30.3% Medium

31 Next Permutation (/problems/next-permutation) 31.4% Medium

445 Add Two Numbers II (/problems/add-two-numbers-ii) 52.0% Medium


# Title Acceptance Difficulty Frequency 

143 Reorder List (/problems/reorder-list) 33.2% Medium

54 Spiral Matrix (/problems/spiral-matrix) 32.1% Medium

160 Intersection of Two Linked Lists 36.6% Easy


(/problems/intersection-of-two-linked-lists)

317 Shortest Distance from All Buildings 39.6% Hard


(/problems/shortest-distance-from-all-buildings) 

23 Merge k Sorted Lists (/problems/merge-k-sorted-lists) 37.1% Hard

199 Binary Tree Right Side View (/problems/binary-tree- 50.5% Medium


right-side-view)

11 Container With Most Water (/problems/container-with- 47.8% Medium


most-water)

286 Walls and Gates (/problems/walls-and-gates)  51.4% Medium

3 Longest Substring Without Repeating Characters 29.2% Medium


(/problems/longest-substring-without-repeating-
characters)

2 Add Two Numbers (/problems/add-two-numbers) 32.3% Medium

314 Binary Tree Vertical Order Traversal (/problems/binary- 42.6% Medium


tree-vertical-order-traversal) 

958 Check Completeness of a Binary Tree 50.4% Medium


(/problems/check-completeness-of-a-binary-tree)

21 Merge Two Sorted Lists (/problems/merge-two-sorted- 50.1% Easy


lists)

41 First Missing Positive (/problems/first-missing-positive) 30.2% Hard

329 Longest Increasing Path in a Matrix 41.5% Hard


(/problems/longest-increasing-path-in-a-matrix)

1 Two Sum (/problems/two-sum) 44.8% Easy

53 Maximum Subarray (/problems/maximum-subarray) 45.1% Easy

103 Binary Tree Zigzag Level Order Traversal 44.2% Medium


(/problems/binary-tree-zigzag-level-order-traversal)

72 Edit Distance (/problems/edit-distance) 40.3% Hard


# Title Acceptance Difficulty Frequency 

232 Implement Queue using Stacks (/problems/implement- 45.9% Easy


queue-using-stacks)

209 Minimum Size Subarray Sum (/problems/minimum- 36.0% Medium


size-subarray-sum)

236 Lowest Common Ancestor of a Binary Tree 41.1% Medium


(/problems/lowest-common-ancestor-of-a-binary-tree)

215 Kth Largest Element in an Array (/problems/kth-largest- 51.0% Medium


element-in-an-array)

15 3Sum (/problems/3sum) 25.3% Medium

206 Reverse Linked List (/problems/reverse-linked-list) 58.1% Easy

10 Regular Expression Matching (/problems/regular- 25.9% Hard


expression-matching)

83 Remove Duplicates from Sorted List 43.8% Easy


(/problems/remove-duplicates-from-sorted-list)

167 Two Sum II - Input array is sorted (/problems/two-sum- 51.9% Easy


ii-input-array-is-sorted)

152 Maximum Product Subarray (/problems/maximum- 30.4% Medium


product-subarray)

543 Diameter of Binary Tree (/problems/diameter-of-binary- 47.8% Easy


tree)

124 Binary Tree Maximum Path Sum (/problems/binary- 31.7% Hard


tree-maximum-path-sum)

104 Maximum Depth of Binary Tree (/problems/maximum- 63.0% Easy


depth-of-binary-tree)

Copyright © 2019 LeetCode


Help Center (/support/) | Terms (/terms/) | Privacy Policy (/privacy/)
United States (/region/)

You might also like