Barclays LeetCode Questions
16 questions all-time · 5 easy · 9 medium · 2 hard
| # | Problem | Difficulty | Frequency | Acceptance |
|---|---|---|---|---|
| 1 | Lexicographically Smallest Generated String String, Greedy, String Matching | Hard | 100 | 0.5% |
| 2 | Double Modular Exponentiation Array, Math, Simulation | Medium | 90 | 0.5% |
| 3 | Furthest Point From Origin String, Counting | Easy | 90 | 0.8% |
| 4 | Count Submatrices with Top-Left Element and Sum Less Than k Array, Matrix, Prefix Sum | Medium | 88 | 0.7% |
| 5 | Mark Elements on Array by Performing Queries Array, Hash Table, Sorting, Heap (Priority Queue), Simulation | Medium | 88 | 0.5% |
| 6 | Partition Labels Hash Table, Two Pointers, String, Greedy | Medium | 62 | 0.8% |
| 7 | Lexicographical Numbers Depth-First Search, Trie | Medium | 53 | 0.8% |
| 8 | Valid Parentheses String, Stack | Easy | 53 | 0.4% |
| 9 | Number of Islands Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix | Medium | 53 | 0.6% |
| 10 | Second Highest Salary Database | Medium | 53 | 0.5% |
| 11 | Longest Common Prefix Array, String, Trie | Easy | 53 | 0.5% |
| 12 | Next Greater Element I Array, Hash Table, Stack, Monotonic Stack | Easy | 53 | 0.8% |
| 13 | Reverse Words in a String Two Pointers, String | Medium | 53 | 0.6% |
| 14 | Minimum Number of Days to Make m Bouquets Array, Binary Search | Medium | 53 | 0.6% |
| 15 | Two Sum Array, Hash Table | Easy | 53 | 0.6% |
| 16 | Remove Boxes Array, Dynamic Programming, Memoization | Hard | 53 | 0.5% |
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.