Citrix LeetCode Questions
7 questions all-time · 1 easy · 5 medium · 1 hard
| # | Problem | Difficulty | Frequency | Acceptance |
|---|---|---|---|---|
| 1 | Find All Groups of Farmland Array, Depth-First Search, Breadth-First Search, Matrix | Medium | 100 | 75.5% |
| 2 | Check if Strings Can be Made Equal With Operations II Hash Table, String, Sorting | Medium | 100 | 55.2% |
| 3 | Check if Strings Can be Made Equal With Operations I String | Easy | 100 | 47.1% |
| 4 | Maximum Performance of a Team Array, Greedy, Sorting, Heap (Priority Queue) | Hard | 100 | 47.5% |
| 5 | Remove Nth Node From End of List Linked List, Two Pointers | Medium | 64 | 49.0% |
| 6 | Pairs of Songs With Total Durations Divisible by 60 Array, Hash Table, Counting | Medium | 64 | 53.2% |
| 7 | LRU Cache Hash Table, Linked List, Design, Doubly-Linked List | Medium | 64 | 45.2% |
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.