Courses
π PYQ
πΌ Interview
Sign in
Interview Prep
/
Companies
/
Gameskraft
G
Gameskraft
4 questions tracked
4 with solutions
π
All Time
4
π
Last 6 Months
0
π₯
Last 3 Months
0
β‘
Last 30 Days
0
π
All
Easy
Medium
Hard
Frequency score
Sorted highest β lowest frequency
β Our Solution = we have a detailed walkthrough
Showing 4 of 4 questions
1
Hard
Maximize Sum of Weights after Edge Removals
β Our Solution
100
Dynamic Programming
Tree
Depth-First Search
LeetCode β
29% acc.
2
Hard
IPO
β Our Solution
66
Array
Greedy
Sorting
Heap (Priority Queue)
LeetCode β
53% acc.
3
Hard
LFU Cache
β Our Solution
66
Hash Table
Linked List
Design
Doubly-Linked List
LeetCode β
47% acc.
4
Hard
Sliding Window Maximum
β Our Solution
66
Array
Queue
Sliding Window
Heap (Priority Queue)
+1
LeetCode β
48% acc.