Problems
Callback's own problems and the LeetCode questions companies have been asking, in one place — filter by category, company, topic, difficulty, and how recently a question showed up.
Asked on LeetCode
58 questions at Atlassian · all time
- Rank Teams by VotesmediumArrayHash TableStringSorting+1frequency 100.0
- Stock Price FluctuationmediumHash TableDesignHeap (Priority Queue)Data Stream+1frequency 94.7
- All O`one Data StructurehardHash TableLinked ListDesignDoubly-Linked Listfrequency 92.3
- Design Snake GamemediumArrayHash TableDesignQueue+1frequency 88.2
- Merge IntervalsmediumArraySortingQuicksortfrequency 82.3
- High-Access EmployeesmediumArrayHash TableStringSortingfrequency 74.6
- Lowest Common Ancestor of a Binary TreemediumTreeDepth-First SearchBinary TreeBinary Lifting+1frequency 74.6
- Meeting Rooms IImediumArrayTwo PointersGreedySorting+2frequency 71.2
- Find the Width of Columns of a GrideasyArrayMatrixfrequency 65.3
- Word SearchmediumArrayStringBacktrackingDepth-First Search+1frequency 65.3
- Text JustificationhardArrayStringSimulationfrequency 63.5
- Lowest Common Ancestor of a Binary Tree IVmediumHash TableTreeDepth-First SearchBinary Tree+2frequency 61.5
- Number of Possible Sets of Closing BrancheshardBit ManipulationGraph TheoryHeap (Priority Queue)Enumeration+1frequency 61.5
- Make Lexicographically Smallest Array by Swapping ElementsmediumArrayUnion-FindSortingfrequency 59.3
- Maximum Good Subarray SummediumArrayHash TablePrefix Sumfrequency 59.3
- Minimum Cost to Convert String ImediumArrayStringGraph TheoryShortest Pathfrequency 59.3
- Minimum Cost to Convert String IIhardArrayStringDynamic ProgrammingGraph Theory+2frequency 59.3
- Minimum Time to Visit a Cell In a GridhardArrayBreadth-First SearchGraph TheoryHeap (Priority Queue)+2frequency 59.3
- Smallest Missing Non-negative Integer After OperationsmediumArrayHash TableMathGreedyfrequency 59.3
- Verbal Arithmetic PuzzlehardArrayMathStringBacktrackingfrequency 59.3
- Best Time to Buy and Sell StockeasyArrayDynamic Programmingfrequency 56.8
- Logger Rate LimitereasyHash TableDesignData Streamfrequency 56.8
- The Time When the Network Becomes IdlemediumArrayBreadth-First SearchGraph Theoryfrequency 56.8
- Top K Frequent ElementsmediumArrayHash TableDivide and ConquerSorting+4frequency 50.4
- Can Place FlowerseasyArrayGreedyfrequency 46.2
- Russian Doll EnvelopeshardArrayBinary SearchDynamic ProgrammingSorting+1frequency 46.2
- Design Authentication ManagermediumHash TableLinked ListDesignDoubly-Linked Listfrequency 40.8
- Group AnagramsmediumArrayHash TableStringSortingfrequency 40.8
- Jump Game IImediumArrayDynamic ProgrammingGreedyfrequency 40.8
- Koko Eating BananasmediumArrayBinary Searchfrequency 40.8
- LRU CachemediumHash TableLinked ListDesignDoubly-Linked Listfrequency 40.8
- Last Day Where You Can Still CrosshardArrayBinary SearchDepth-First SearchBreadth-First Search+2frequency 40.8
- Longest Consecutive SequencemediumArrayHash TableUnion-Findfrequency 40.8
- Longest Substring Without Repeating CharactersmediumHash TableStringSliding Windowfrequency 40.8
- Maximum SubarraymediumArrayDivide and ConquerDynamic Programmingfrequency 40.8
- Maximum Xor ProductmediumMathGreedyBit Manipulationfrequency 40.8
- Minimum Difficulty of a Job SchedulehardArrayDynamic Programmingfrequency 40.8
- Nth Highest SalarymediumDatabasefrequency 40.8
- Pairs of Songs With Total Durations Divisible by 60mediumArrayHash TableCountingfrequency 40.8
- Rearranging FruitshardArrayHash TableGreedySortfrequency 40.8
- Two SumeasyArrayHash Tablefrequency 40.8
- Best Time to Buy and Sell Stock IImediumArrayDynamic ProgrammingGreedyfrequency 33.3
- Count Palindromic SubsequenceshardStringDynamic Programmingfrequency 33.3
- Count Vowel Strings in RangesmediumArrayStringPrefix Sumfrequency 33.3
- Design Add and Search Words Data StructuremediumStringDepth-First SearchDesignTriefrequency 33.3
- Design Hit CountermediumArrayBinary SearchDesignQueue+1frequency 33.3
- Design a Food Rating SystemmediumArrayHash TableStringDesign+2frequency 33.3
- Find First and Last Position of Element in Sorted ArraymediumArrayBinary Searchfrequency 33.3
- Find K Closest ElementsmediumArrayTwo PointersBinary SearchSliding Window+2frequency 33.3
- Longest Increasing SubsequencemediumArrayBinary SearchDynamic ProgrammingLongest Increasing Subsequencefrequency 33.3
Listings only — titles, difficulty, and tags link out to LeetCode. Imported from the leetcode-company-wise-problems snapshot dated 1 June 2025. Frequency is that dataset's own relative score within a company and time range.