S

ServiceNow

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

Showing 84 of 84 questions

1
HardTrapping Rain Waterβœ“ Our Solution
100
ArrayTwo PointersDynamic ProgrammingStack+1
2
MediumSubarray Product Less Than Kβœ“ Our Solution
100
ArrayBinary SearchSliding WindowPrefix Sum
3
EasyValid Parenthesesβœ“ Our Solution
98
StringStack
4
MediumGroup Anagramsβœ“ Our Solution
98
ArrayHash TableStringSorting
5
MediumLRU Cacheβœ“ Our Solution
96
Hash TableLinked ListDesignDoubly-Linked List
6
MediumLexicographically Smallest String After Operations With Constraintβœ“ Our Solution
93
StringGreedy
7
MediumGenerate Parenthesesβœ“ Our Solution
93
StringDynamic ProgrammingBacktracking
8
HardNumber of Distinct Roll Sequencesβœ“ Our Solution
93
Dynamic ProgrammingMemoization
9
HardFind Minimum Diameter After Merging Two Treesβœ“ Our Solution
93
TreeDepth-First SearchBreadth-First SearchGraph
10
MediumLongest Substring Without Repeating Charactersβœ“ Our Solution
87
Hash TableStringSliding Window
11
EasyBest Time to Buy and Sell Stockβœ“ Our Solution
79
ArrayDynamic Programming
12
EasyMove Zeroesβœ“ Our Solution
79
ArrayTwo Pointers
13
MediumZigzag Conversionβœ“ Our Solution
79
String
14
EasyDesign HashMapβœ“ Our Solution
79
ArrayHash TableLinked ListDesign+1
15
MediumMerge Intervalsβœ“ Our Solution
79
ArraySorting
16
MediumDaily Temperaturesβœ“ Our Solution
75
ArrayStackMonotonic Stack
17
MediumMaximal Squareβœ“ Our Solution
75
ArrayDynamic ProgrammingMatrix
18
MediumKth Largest Element in an Arrayβœ“ Our Solution
75
ArrayDivide and ConquerSortingHeap (Priority Queue)+1
19
75
ArrayHash Table
20
MediumContainer With Most Waterβœ“ Our Solution
75
ArrayTwo PointersGreedy
21
HardFirst Missing Positiveβœ“ Our Solution
75
ArrayHash Table
22
MediumNumber of Islandsβœ“ Our Solution
69
ArrayDepth-First SearchBreadth-First SearchUnion Find+1
23
MediumLongest Palindromic Substringβœ“ Our Solution
69
Two PointersStringDynamic Programming
24
HardMedian of Two Sorted Arraysβœ“ Our Solution
69
ArrayBinary SearchDivide and Conquer
25
MediumSearch in Rotated Sorted Arrayβœ“ Our Solution
69
ArrayBinary Search
26
MediumPacific Atlantic Water Flowβœ“ Our Solution
69
ArrayDepth-First SearchBreadth-First SearchMatrix
27
MediumTop K Frequent Wordsβœ“ Our Solution
69
ArrayHash TableStringTrie+4
28
EasyReverse Linked Listβœ“ Our Solution
69
Linked ListRecursion
29
HardLFU Cacheβœ“ Our Solution
69
Hash TableLinked ListDesignDoubly-Linked List
30
MediumMaximum Product Subarrayβœ“ Our Solution
69
ArrayDynamic Programming
31
MediumValidate Binary Search Treeβœ“ Our Solution
69
TreeDepth-First SearchBinary Search TreeBinary Tree
32
MediumString Compressionβœ“ Our Solution
69
Two PointersString
33
MediumSet Matrix Zeroesβœ“ Our Solution
61
ArrayHash TableMatrix
34
HardNumber of Visible People in a Queueβœ“ Our Solution
61
ArrayStackMonotonic Stack
35
MediumValidate IP Addressβœ“ Our Solution
61
String
36
EasyFirst Unique Character in a Stringβœ“ Our Solution
61
Hash TableStringQueueCounting
37
MediumNumber of Distinct Substrings in a String
61
StringTrieRolling HashSuffix Array+1
38
MediumBinary Tree Right Side Viewβœ“ Our Solution
61
TreeDepth-First SearchBreadth-First SearchBinary Tree
39
MediumLongest Consecutive Sequenceβœ“ Our Solution
61
ArrayHash TableUnion Find
40
MediumAsteroid Collisionβœ“ Our Solution
61
ArrayStackSimulation
41
MediumSum Root to Leaf Numbersβœ“ Our Solution
61
TreeDepth-First SearchBinary Tree
42
MediumFraction to Recurring Decimalβœ“ Our Solution
61
Hash TableMathString
43
MediumVowels of All Substringsβœ“ Our Solution
61
MathStringDynamic ProgrammingCombinatorics
44
MediumMeeting Rooms II
61
ArrayTwo PointersGreedySorting+2
45
MediumReverse Words in a String II
61
Two PointersString
46
MediumMaximum Subarrayβœ“ Our Solution
61
ArrayDivide and ConquerDynamic Programming
47
MediumLargest Numberβœ“ Our Solution
61
ArrayStringGreedySorting
48
MediumValid Parenthesis Stringβœ“ Our Solution
61
StringDynamic ProgrammingStackGreedy
49
MediumHouse Robberβœ“ Our Solution
50
ArrayDynamic Programming
50
MediumLetter Combinations of a Phone Numberβœ“ Our Solution
50
Hash TableStringBacktracking
51
MediumNumber of Distinct Islands
50
Hash TableDepth-First SearchBreadth-First SearchUnion Find+1
52
EasyPalindrome Linked Listβœ“ Our Solution
50
Linked ListTwo PointersStackRecursion
53
50
ArrayTwo PointersSorting
54
MediumBasic Calculator IIβœ“ Our Solution
50
MathStringStack
55
MediumCombination Sumβœ“ Our Solution
50
ArrayBacktracking
56
MediumTime Needed to Rearrange a Binary Stringβœ“ Our Solution
50
StringDynamic ProgrammingSimulation
57
MediumSubarray Sum Equals Kβœ“ Our Solution
50
ArrayHash TablePrefix Sum
58
MediumNext Permutationβœ“ Our Solution
50
ArrayTwo Pointers
59
MediumGas Stationβœ“ Our Solution
50
ArrayGreedy
60
MediumJump Gameβœ“ Our Solution
50
ArrayDynamic ProgrammingGreedy
61
MediumFind Peak Elementβœ“ Our Solution
50
ArrayBinary Search
62
MediumTarget Sumβœ“ Our Solution
50
ArrayDynamic ProgrammingBacktracking
63
MediumSingle Element in a Sorted Arrayβœ“ Our Solution
50
ArrayBinary Search
64
HardSliding Window Maximumβœ“ Our Solution
50
ArrayQueueSliding WindowHeap (Priority Queue)+1
65
MediumBinary Tree Zigzag Level Order Traversalβœ“ Our Solution
50
TreeBreadth-First SearchBinary Tree
66
MediumAmount of Time for Binary Tree to Be Infectedβœ“ Our Solution
50
Hash TableTreeDepth-First SearchBreadth-First Search+1
67
MediumCoin Changeβœ“ Our Solution
50
ArrayDynamic ProgrammingBreadth-First Search
68
EasyValid Palindromeβœ“ Our Solution
50
Two PointersString
69
HardWord Break IIβœ“ Our Solution
50
ArrayHash TableStringDynamic Programming+3
70
EasyMerge Sorted Arrayβœ“ Our Solution
50
ArrayTwo PointersSorting
71
MediumFind Minimum in Rotated Sorted Arrayβœ“ Our Solution
50
ArrayBinary Search
72
MediumImplement Trie (Prefix Tree)βœ“ Our Solution
50
Hash TableStringDesignTrie
73
MediumPermutationsβœ“ Our Solution
50
ArrayBacktracking
74
MediumFind First and Last Position of Element in Sorted Arrayβœ“ Our Solution
50
ArrayBinary Search
75
50
ArrayTwo PointersSorting
76
MediumPow(x, n)βœ“ Our Solution
50
MathRecursion
77
MediumSearch Suggestions Systemβœ“ Our Solution
50
ArrayStringBinary SearchTrie+2
78
MediumPartition Equal Subset Sumβœ“ Our Solution
50
ArrayDynamic Programming
79
HardMinimum Number of Taps to Open to Water a Gardenβœ“ Our Solution
50
ArrayDynamic ProgrammingGreedy
80
MediumPopulating Next Right Pointers in Each Nodeβœ“ Our Solution
50
Linked ListTreeDepth-First SearchBreadth-First Search+1
81
MediumRotting Orangesβœ“ Our Solution
50
ArrayBreadth-First SearchMatrix
82
MediumRotate Arrayβœ“ Our Solution
50
ArrayMathTwo Pointers
83
HardMinimum One Bit Operations to Make Integers Zeroβœ“ Our Solution
50
Dynamic ProgrammingBit ManipulationMemoization
84
MediumCheck if a Parentheses String Can Be Validβœ“ Our Solution
50
StringStackGreedy