grindmapcompany-wise LeetCode
All companies

KLA LeetCode Questions

8 questions all-time · 2 easy · 3 medium · 3 hard
# Problem Difficulty Frequency Acceptance
1Maximum Product of First and Last Elements of a Subsequence
Array, Two Pointers
Medium
100
29.8%
2Reaching Points
Math
Hard
80
33.6%
3LRU Cache
Hash Table, Linked List, Design, Doubly-Linked List
Medium
80
45.2%
4Roman to Integer
Hash Table, Math, String
Easy
71
64.9%
5LFU Cache
Hash Table, Linked List, Design, Doubly-Linked List
Hard
71
46.6%
6Maximum Swap
Math, Greedy
Medium
71
51.8%
7Two Sum
Array, Hash Table
Easy
71
55.8%
8Find Median from Data Stream
Two Pointers, Design, Sorting, Heap (Priority Queue), Data Stream
Hard
71
53.3%

How to read this list

The tabs at the top split the questions by how recently people said they were asked in interviews. "Last 30 Days" is the past month, "Last 3 Months" is the past quarter, and so on. "All Time" is every question on record for this company.

Frequency is a score from 0 to 100 for how often a question showed up in that time window. A higher number means it came up more often, so the list starts with the most common questions first. Acceptance is the share of submissions that pass on LeetCode. Click any question to open it on LeetCode.