DSA Doctor
Verified Company Vault
Gameskraft DSA Interview Questions
4 curated coding interview questions directly asked in Gameskraft technical rounds, sorted by frequency with recency and difficulty diagnostics.
4
Total Questions
0 (0%)
Easy Problems
0 (0%)
Medium Problems
4 (100%)
Hard Problems
🔥 Most Tested Topics:
Arrays (3)Dynamic Programming (1)Strings (1)Trees (1)
📂 Sourced Datasets:
All questionsOlder than 6 months
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 3367 | Maximize Sum of Weights after Edge Removals | Hard | Arrays | Sorting / Prefix / Scan | 31.0% | 100.0% | all |
| 3710 | Maximum Partition Factor | Hard | Arrays; Dynamic Programming | Sorting / Prefix / Scan; State Transition | 31.8% | 87.5% | all |
| 239 | Sliding Window Maximum | Hard | Arrays | Sorting / Prefix / Scan; Sliding Window | 48.8% | 62.5% | all |
| 2867 | Count Valid Paths in a Tree | Hard | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 36.2% | 62.5% | all |