Atlassian LeetCode Questions
62 questions all-time · 6 easy · 42 medium · 14 hard
| # | Problem | Difficulty | Frequency | Acceptance |
|---|---|---|---|---|
| 1 | Rank Teams by Votes Array, Hash Table, String, Sorting, Counting | Medium | 100 | 0.6% |
| 2 | Stock Price Fluctuation Hash Table, Design, Heap (Priority Queue), Data Stream, Ordered Set | Medium | 95 | 0.5% |
| 3 | All O`one Data Structure Hash Table, Linked List, Design, Doubly-Linked List | Hard | 92 | 0.4% |
| 4 | Design Snake Game Array, Hash Table, Design, Queue, Simulation | Medium | 88 | 0.4% |
| 5 | Merge Intervals Array, Sorting | Medium | 83 | 0.5% |
| 6 | High-Access Employees Array, Hash Table, String, Sorting | Medium | 76 | 0.5% |
| 7 | Lowest Common Ancestor of a Binary Tree Tree, Depth-First Search, Binary Tree | Medium | 74 | 0.7% |
| 8 | Meeting Rooms II Array, Two Pointers, Greedy, Sorting, Heap (Priority Queue), Prefix Sum | Medium | 70 | 0.5% |
| 9 | Number of Possible Sets of Closing Branches Bit Manipulation, Graph Theory, Heap (Priority Queue), Enumeration, Shortest Path | Hard | 64 | 0.5% |
| 10 | Word Search Array, String, Backtracking, Depth-First Search, Matrix | Medium | 64 | 0.5% |
| 11 | Find the Width of Columns of a Grid Array, Matrix | Easy | 64 | 0.7% |
| 12 | Text Justification Array, String, Simulation | Hard | 63 | 0.5% |
| 13 | Make Lexicographically Smallest Array by Swapping Elements Array, Union-Find, Sorting | Medium | 63 | 0.6% |
| 14 | Minimum Cost to Convert String I Array, String, Graph Theory, Shortest Path | Medium | 63 | 0.6% |
| 15 | Minimum Cost to Convert String II Array, String, Dynamic Programming, Graph Theory, Trie, Shortest Path | Hard | 63 | 0.6% |
| 16 | Maximum Good Subarray Sum Array, Hash Table, Prefix Sum | Medium | 63 | 0.2% |
| 17 | Verbal Arithmetic Puzzle Array, Math, String, Backtracking | Hard | 63 | 0.3% |
| 18 | Smallest Missing Non-negative Integer After Operations Array, Hash Table, Math, Greedy | Medium | 63 | 0.6% |
| 19 | Minimum Time to Visit a Cell In a Grid Array, Breadth-First Search, Graph Theory, Heap (Priority Queue), Matrix, Shortest Path | Hard | 63 | 0.6% |
| 20 | Maximum Square Area by Removing Fences From a Field Array, Hash Table, Enumeration | Medium | 63 | 0.5% |
| 21 | Maximum Area of Longest Diagonal Rectangle Array | Easy | 63 | 0.5% |
| 22 | Lowest Common Ancestor of a Binary Tree IV Hash Table, Tree, Depth-First Search, Binary Tree | Medium | 61 | 0.8% |
| 23 | The Time When the Network Becomes Idle Array, Breadth-First Search, Graph Theory | Medium | 56 | 0.6% |
| 24 | Best Time to Buy and Sell Stock Array, Dynamic Programming | Easy | 53 | 0.6% |
| 25 | Logger Rate Limiter Hash Table, Design, Data Stream | Easy | 53 | 0.8% |
| 26 | Top K Frequent Elements Array, Hash Table, Divide and Conquer, Sorting, Heap (Priority Queue), Bucket Sort, Counting, Quickselect | Medium | 53 | 0.7% |
| 27 | Group Anagrams Array, Hash Table, String, Sorting | Medium | 50 | 0.7% |
| 28 | Can Place Flowers Array, Greedy | Easy | 50 | 0.3% |
| 29 | Longest String Chain Array, Hash Table, Two Pointers, String, Dynamic Programming, Sorting | Medium | 45 | 0.6% |
| 30 | Koko Eating Bananas Array, Binary Search | Medium | 45 | 0.5% |
| 31 | Longest Consecutive Sequence Array, Hash Table, Union-Find | Medium | 45 | 0.5% |
| 32 | Russian Doll Envelopes Array, Binary Search, Dynamic Programming, Sorting | Hard | 45 | 0.4% |
| 33 | Two Sum Array, Hash Table | Easy | 40 | 0.6% |
| 34 | Longest Substring Without Repeating Characters Hash Table, String, Sliding Window | Medium | 40 | 0.4% |
| 35 | Jump Game II Array, Dynamic Programming, Greedy | Medium | 40 | 0.4% |
| 36 | Pairs of Songs With Total Durations Divisible by 60 Array, Hash Table, Counting | Medium | 40 | 0.5% |
| 37 | Nth Highest Salary Database | Medium | 40 | 0.4% |
| 38 | Maximum Subarray Array, Divide and Conquer, Dynamic Programming | Medium | 40 | 0.5% |
| 39 | Last Day Where You Can Still Cross Array, Binary Search, Depth-First Search, Breadth-First Search, Union-Find, Matrix | Hard | 40 | 0.7% |
| 40 | Rearranging Fruits Array, Hash Table, Greedy, Sort | Hard | 40 | 0.6% |
| 41 | Design Authentication Manager Hash Table, Linked List, Design, Doubly-Linked List | Medium | 40 | 0.6% |
| 42 | Design File System Hash Table, String, Design, Trie | Medium | 32 | 0.7% |
| 43 | Longest Increasing Subsequence Array, Binary Search, Dynamic Programming | Medium | 32 | 0.6% |
| 44 | Design Hit Counter Array, Binary Search, Design, Queue, Data Stream | Medium | 32 | 0.7% |
| 45 | Find K Closest Elements Array, Two Pointers, Binary Search, Sliding Window, Sorting, Heap (Priority Queue) | Medium | 32 | 0.5% |
| 46 | Boats to Save People Array, Two Pointers, Greedy, Sorting | Medium | 32 | 0.6% |
| 47 | Design Add and Search Words Data Structure String, Depth-First Search, Design, Trie | Medium | 32 | 0.5% |
| 48 | Count Vowel Strings in Ranges Array, String, Prefix Sum | Medium | 32 | 0.7% |
| 49 | Find First and Last Position of Element in Sorted Array Array, Binary Search | Medium | 32 | 0.5% |
| 50 | Lowest Common Ancestor of a Binary Tree III Hash Table, Two Pointers, Tree, Binary Tree | Medium | 32 | 0.8% |
| 51 | Design a Food Rating System Array, Hash Table, String, Design, Heap (Priority Queue), Ordered Set | Medium | 32 | 0.5% |
| 52 | LRU Cache Hash Table, Linked List, Design, Doubly-Linked List | Medium | 32 | 0.5% |
| 53 | Count Palindromic Subsequences String, Dynamic Programming | Hard | 32 | 0.4% |
| 54 | Lowest Common Ancestor of a Binary Tree II Tree, Depth-First Search, Binary Tree | Medium | 32 | 0.7% |
| 55 | Wildcard Matching String, Dynamic Programming, Greedy, Recursion | Hard | 32 | 0.3% |
| 56 | Serialize and Deserialize Binary Tree String, Tree, Depth-First Search, Breadth-First Search, Design, Binary Tree | Hard | 32 | 0.6% |
| 57 | Next Permutation Array, Two Pointers | Medium | 32 | 0.5% |
| 58 | Number of Perfect Pairs Array, Math, Two Pointers, Sorting | Medium | 32 | 0.3% |
| 59 | Maximum Xor Product Math, Greedy, Bit Manipulation | Medium | 32 | 0.3% |
| 60 | Tallest Billboard Array, Dynamic Programming | Hard | 32 | 0.5% |
| 61 | Maximum Score with Co-Prime Element Array, Hash Table, Math, Combinatorics, Enumeration, Number Theory | Hard | 32 | 0.3% |
| 62 | Best Time to Buy and Sell Stock II Array, Dynamic Programming, Greedy | Medium | 32 | 0.7% |
How to read this list
The tabs at the top split the questions by how recently people said they were asked in interviews. "Last 30 Days" is the past month, "Last 3 Months" is the past quarter, and so on. "All Time" is every question on record for this company.
Frequency is a score from 0 to 100 for how often a question showed up in that time window. A higher number means it came up more often, so the list starts with the most common questions first. Acceptance is the share of submissions that pass on LeetCode. Click any question to open it on LeetCode.