Gameskraft

6 LeetCode interview questions

Difficulty Distribution

Easy

0

0%

Medium

0

0%

Hard

6

100%

Top Topics

Array(3)Depth-First Search(3)Sorting(2)Heap (Priority Queue)(2)Dynamic Programming(2)Tree(2)Greedy(1)Hash Table(1)Linked List(1)Design(1)

All Questions

Title	Difficulty	Acceptance	Frequency	Topics
Maximize Sum of Weights after Edge Removals	Hard	30.4%	100.0%	Dynamic ProgrammingTreeDepth-First Search+1
Maximum Partition Factor	Hard	31.0%	87.5%	ArrayBinary SearchDepth-First Search+3
IPO	Hard	53.3%	62.5%	ArrayGreedySorting+1
LFU Cache	Hard	48.6%	62.5%	Hash TableLinked ListDesign+1
Sliding Window Maximum	Hard	48.4%	62.5%	ArrayQueueSliding Window+2
Count Valid Paths in a Tree	Hard	35.9%	62.5%	MathDynamic ProgrammingTree+2

Showing 6 of 6 questions