A

Atlassian

73 questions tracked66 with solutions
πŸ”
Frequency scoreSorted highest β†’ lowest frequencyβœ“ Our Solution = we have a detailed walkthrough

Showing 73 of 73 questions

1
MediumRank Teams by Votesβœ“ Our Solution
100
ArrayHash TableStringSorting+1
2
MediumDesign Snake Game
88
ArrayHash TableDesignQueue+1
3
MediumStock Price Fluctuationβœ“ Our Solution
87
Hash TableDesignHeap (Priority Queue)Data Stream+1
4
HardAll O`one Data Structureβœ“ Our Solution
77
Hash TableLinked ListDesignDoubly-Linked List
5
MediumHigh-Access Employeesβœ“ Our Solution
71
ArrayHash TableStringSorting
6
EasyLogger Rate Limiter
71
Hash TableDesignData Stream
7
MediumMerge Intervalsβœ“ Our Solution
62
ArraySorting
8
MediumMaximum Good Subarray Sumβœ“ Our Solution
59
ArrayHash TablePrefix Sum
9
MediumMinimum Cost to Convert String Iβœ“ Our Solution
59
ArrayStringGraphShortest Path
10
HardMinimum Cost to Convert String IIβœ“ Our Solution
59
ArrayStringDynamic ProgrammingGraph+2
11
MediumMaximum Square Area by Removing Fences From a Fieldβœ“ Our Solution
59
ArrayHash TableEnumeration
12
MediumMeeting Rooms II
59
ArrayTwo PointersGreedySorting+2
13
EasyMaximum Area of Longest Diagonal Rectangleβœ“ Our Solution
59
Array
14
HardNumber of Possible Sets of Closing Branchesβœ“ Our Solution
59
Bit ManipulationGraphHeap (Priority Queue)Enumeration+1
15
HardVerbal Arithmetic Puzzleβœ“ Our Solution
59
ArrayMathStringBacktracking
16
HardCherry Pickupβœ“ Our Solution
59
ArrayDynamic ProgrammingMatrix
17
MediumSmallest Missing Non-negative Integer After Operationsβœ“ Our Solution
59
ArrayHash TableMathGreedy
18
MediumMake Lexicographically Smallest Array by Swapping Elementsβœ“ Our Solution
59
ArrayUnion FindSorting
19
HardMinimum Time to Visit a Cell In a Gridβœ“ Our Solution
59
ArrayBreadth-First SearchGraphHeap (Priority Queue)+2
20
EasyFind the Width of Columns of a Gridβœ“ Our Solution
59
ArrayMatrix
21
MediumGroup Anagramsβœ“ Our Solution
57
ArrayHash TableStringSorting
22
HardText Justificationβœ“ Our Solution
57
ArrayStringSimulation
23
MediumDesign File System
57
Hash TableStringDesignTrie
24
MediumLongest String Chainβœ“ Our Solution
57
ArrayHash TableTwo PointersString+2
25
MediumLongest Increasing Subsequenceβœ“ Our Solution
55
ArrayBinary SearchDynamic Programming
26
MediumLowest Common Ancestor of a Binary Treeβœ“ Our Solution
55
TreeDepth-First SearchBinary Tree
27
MediumMajority Element IIβœ“ Our Solution
52
ArrayHash TableSortingCounting
28
MediumKoko Eating Bananasβœ“ Our Solution
50
ArrayBinary Search
29
EasyBest Time to Buy and Sell Stockβœ“ Our Solution
50
ArrayDynamic Programming
30
EasyCan Place Flowersβœ“ Our Solution
46
ArrayGreedy
31
HardString Transformationβœ“ Our Solution
46
MathStringDynamic ProgrammingString Matching
32
MediumOnline Electionβœ“ Our Solution
46
ArrayHash TableBinary SearchDesign
33
MediumThe Time When the Network Becomes Idleβœ“ Our Solution
46
ArrayBreadth-First SearchGraph
34
MediumTop K Frequent Elementsβœ“ Our Solution
46
ArrayHash TableDivide and ConquerSorting+4
35
MediumWord Searchβœ“ Our Solution
42
ArrayStringBacktrackingDepth-First Search+1
36
MediumLongest Consecutive Sequenceβœ“ Our Solution
42
ArrayHash TableUnion Find
37
HardRussian Doll Envelopesβœ“ Our Solution
42
ArrayBinary SearchDynamic ProgrammingSorting
38
42
ArrayHash Table
39
MediumLongest Substring Without Repeating Charactersβœ“ Our Solution
42
Hash TableStringSliding Window
40
HardCount Vowels Permutationβœ“ Our Solution
37
Dynamic Programming
41
MediumInteger to Romanβœ“ Our Solution
37
Hash TableMathString
42
MediumNth Highest Salaryβœ“ Our Solution
37
Database
43
MediumPairs of Songs With Total Durations Divisible by 60βœ“ Our Solution
37
ArrayHash TableCounting
44
EasyMerge Sorted Arrayβœ“ Our Solution
37
ArrayTwo PointersSorting
45
EasyCrawler Log Folderβœ“ Our Solution
37
ArrayStringStack
46
MediumJump Game IIβœ“ Our Solution
37
ArrayDynamic ProgrammingGreedy
47
MediumBoats to Save Peopleβœ“ Our Solution
37
ArrayTwo PointersGreedySorting
48
MediumDesign Tic-Tac-Toe
37
ArrayHash TableDesignMatrix+1
49
MediumMaximum Number of Occurrences of a Substringβœ“ Our Solution
37
Hash TableStringSliding Window
50
MediumSearch Suggestions Systemβœ“ Our Solution
30
ArrayStringBinary SearchTrie+2
51
EasyKth Largest Element in a Streamβœ“ Our Solution
30
TreeDesignBinary Search TreeHeap (Priority Queue)+2
52
MediumDesign a Food Rating Systemβœ“ Our Solution
30
ArrayHash TableStringDesign+2
53
MediumMaximum Subarrayβœ“ Our Solution
30
ArrayDivide and ConquerDynamic Programming
54
MediumLowest Common Ancestor of a Binary Tree III
30
Hash TableTwo PointersTreeBinary Tree
55
MediumFind First and Last Position of Element in Sorted Arrayβœ“ Our Solution
30
ArrayBinary Search
56
EasyFind Words That Can Be Formed by Charactersβœ“ Our Solution
30
ArrayHash TableStringCounting
57
MediumCount Vowel Strings in Rangesβœ“ Our Solution
30
ArrayStringPrefix Sum
58
MediumContainer With Most Waterβœ“ Our Solution
30
ArrayTwo PointersGreedy
59
MediumDesign Add and Search Words Data Structureβœ“ Our Solution
30
StringDepth-First SearchDesignTrie
60
EasyAssign Cookiesβœ“ Our Solution
30
ArrayTwo PointersGreedySorting
61
30
ArrayTwo PointersSorting
62
HardTrapping Rain Waterβœ“ Our Solution
30
ArrayTwo PointersDynamic ProgrammingStack+1
63
MediumDesign Hit Counter
30
ArrayBinary SearchDesignQueue+1
64
MediumUnique Paths IIβœ“ Our Solution
30
ArrayDynamic ProgrammingMatrix
65
HardMaximum Path Quality of a Graphβœ“ Our Solution
30
ArrayBacktrackingGraph
66
HardTallest Billboardβœ“ Our Solution
30
ArrayDynamic Programming
67
EasyAdd Two Integersβœ“ Our Solution
30
Math
68
MediumFind K Closest Elementsβœ“ Our Solution
30
ArrayTwo PointersBinary SearchSliding Window+2
69
HardNumber of Digit Oneβœ“ Our Solution
30
MathDynamic ProgrammingRecursion
70
EasyValid Anagramβœ“ Our Solution
30
Hash TableStringSorting
71
MediumSingle Element in a Sorted Arrayβœ“ Our Solution
30
ArrayBinary Search
72
MediumCoin Changeβœ“ Our Solution
30
ArrayDynamic ProgrammingBreadth-First Search
73
HardLast Day Where You Can Still Crossβœ“ Our Solution
30
ArrayBinary SearchDepth-First SearchBreadth-First Search+2