Trilogy LeetCode Questions
7 questions all-time · 0 easy · 4 medium · 3 hard
| # | Problem | Difficulty | Frequency | Acceptance |
|---|---|---|---|---|
| 1 | Substring XOR Queries Array, Hash Table, String, Bit Manipulation | Medium | 100 | 0.4% |
| 2 | Handling Sum Queries After Update Array, Segment Tree | Hard | 100 | 0.3% |
| 3 | Bitwise XOR of All Pairings Array, Bit Manipulation, Brainteaser | Medium | 100 | 0.7% |
| 4 | Minimum Time to Kill All Monsters Array, Dynamic Programming, Bit Manipulation, Bitmask | Hard | 100 | 0.6% |
| 5 | Distinct Subsequences String, Dynamic Programming | Hard | 64 | 0.5% |
| 6 | Fraction Addition and Subtraction Math, String, Simulation | Medium | 64 | 0.7% |
| 7 | Range Product Queries of Powers Array, Bit Manipulation, Prefix Sum | Medium | 64 | 0.6% |
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.