A
Atlassian
73 questions tracked66 with solutions
Frequency scoreSorted highest β lowest frequencyβ Our Solution = we have a detailed walkthrough
Showing 73 of 73 questions
1ArrayHash TableStringSorting+1
2MediumDesign Snake Game
ArrayHash TableDesignQueue+1
3Hash TableDesignHeap (Priority Queue)Data Stream+1
4Hash TableLinked ListDesignDoubly-Linked List
5ArrayHash TableStringSorting
6EasyLogger Rate Limiter
Hash TableDesignData Stream
8ArrayHash TablePrefix Sum
9ArrayStringGraphShortest Path
10ArrayStringDynamic ProgrammingGraph+2
11ArrayHash TableEnumeration
12MediumMeeting Rooms II
ArrayTwo PointersGreedySorting+2
14Bit ManipulationGraphHeap (Priority Queue)Enumeration+1
15ArrayMathStringBacktracking
16ArrayDynamic ProgrammingMatrix
17ArrayHash TableMathGreedy
18MediumMake Lexicographically Smallest Array by Swapping Elementsβ Our Solution ArrayUnion FindSorting
19ArrayBreadth-First SearchGraphHeap (Priority Queue)+2
21ArrayHash TableStringSorting
23MediumDesign File System
Hash TableStringDesignTrie
24ArrayHash TableTwo PointersString+2
25ArrayBinary SearchDynamic Programming
26TreeDepth-First SearchBinary Tree
27ArrayHash TableSortingCounting
31MathStringDynamic ProgrammingString Matching
32ArrayHash TableBinary SearchDesign
33ArrayBreadth-First SearchGraph
34ArrayHash TableDivide and ConquerSorting+4
35ArrayStringBacktrackingDepth-First Search+1
36ArrayHash TableUnion Find
37ArrayBinary SearchDynamic ProgrammingSorting
39Hash TableStringSliding Window
46ArrayDynamic ProgrammingGreedy
47ArrayTwo PointersGreedySorting
48MediumDesign Tic-Tac-Toe
ArrayHash TableDesignMatrix+1
49Hash TableStringSliding Window
50ArrayStringBinary SearchTrie+2
51TreeDesignBinary Search TreeHeap (Priority Queue)+2
52ArrayHash TableStringDesign+2
53ArrayDivide and ConquerDynamic Programming
54MediumLowest Common Ancestor of a Binary Tree III
Hash TableTwo PointersTreeBinary Tree
56ArrayHash TableStringCounting
59StringDepth-First SearchDesignTrie
60ArrayTwo PointersGreedySorting
62ArrayTwo PointersDynamic ProgrammingStack+1
63MediumDesign Hit Counter
ArrayBinary SearchDesignQueue+1
64ArrayDynamic ProgrammingMatrix
68ArrayTwo PointersBinary SearchSliding Window+2
69MathDynamic ProgrammingRecursion
72ArrayDynamic ProgrammingBreadth-First Search
73ArrayBinary SearchDepth-First SearchBreadth-First Search+2