I
IBM
100 questions tracked93 with solutions
Frequency scoreSorted highest β lowest frequencyβ Our Solution = we have a detailed walkthrough
Showing 100 of 100 questions
8MediumMeeting Rooms II
ArrayTwo PointersGreedySorting+2
10MediumNumber of Divisible Triplet Sums
ArrayHash Table
12ArrayBinary SearchSortingPrefix Sum
14MediumMaximum Profitable Triplets With Increasing Prices I
ArrayBinary Indexed TreeSegment Tree
16MediumActivity Participants
Database
18ArrayBinary SearchBit Manipulation
23ArrayTwo PointersSimulation
27Hash TableStringSliding Window
29ArrayTwo PointersBinary Search
31HardMaximum Profitable Triplets With Increasing Prices II
ArrayBinary Indexed TreeSegment Tree
35StringBinary SearchSliding WindowPrefix Sum
39Hash TableStringBacktracking
40ArrayHash TableSliding Window
42Two PointersStringDynamic Programming
43MediumLexicographically Smallest String After Substring Operationβ Our Solution StringGreedy
45ArrayHash TableUnion Find
46ArrayHash TableStringBit Manipulation+1
47ArrayDivide and ConquerDynamic Programming
50MediumNumber of Divisible Substrings
Hash TableStringCountingPrefix Sum
51TreeDepth-First SearchBinary Search TreeBinary Tree
52ArrayHash TableMathGreedy
53ArrayBinary SearchSliding WindowPrefix Sum
54MathDynamic ProgrammingMemoization
55ArrayHash TableTwo PointersSorting
57ArrayHash TableStringSorting
59ArrayBinary SearchDivide and Conquer
60ArrayBacktrackingBit Manipulation
61Two PointersStringString Matching
62ArrayHash TablePrefix Sum
63Depth-First SearchBreadth-First SearchUnion FindGraph
66Two PointersStringStackSimulation
67ArrayTwo PointersDynamic ProgrammingStack+1
69ArraySortingHeap (Priority Queue)
72ArrayBinary SearchDynamic Programming
73ArrayTwo PointersBit ManipulationMatrix+1
74StringDynamic Programming
76ArrayHash TableTwo PointersBinary Search+1
78Dynamic ProgrammingPrefix Sum
80MediumMinimum Number of Flips to Make the Binary String Alternatingβ Our Solution StringDynamic ProgrammingSliding Window
81ArrayGreedySortingPrefix Sum
82ArrayBit ManipulationPrefix Sum
83Hash TableMathTwo Pointers
85StringDynamic ProgrammingBacktracking
86Hash TableLinked ListDesignDoubly-Linked List
87ArrayHash TableDivide and ConquerSorting+1
88ArrayTwo PointersBinary SearchBit Manipulation
90MediumFind Longest Calls
Database
92ArrayBinary SearchStackMonotonic Stack+1
94ArrayDynamic ProgrammingBinary Indexed TreeSegment Tree
95ArrayHash TableGreedySorting+1
96ArrayHash TableGreedySorting+2
97Dynamic ProgrammingGreedyBit Manipulation
98ArrayMathMatrixNumber Theory
99ArrayHash TableStringDynamic Programming+2
100ArrayTwo PointersBinary SearchGreedy+3