Turing LeetCode Questions
37 questions all-time · 10 easy · 23 medium · 4 hard
| # | Problem | Difficulty | Frequency | Acceptance |
|---|---|---|---|---|
| 1 | Longest Substring Without Repeating Characters Hash Table, String, Sliding Window | Medium | 100 | 0.4% |
| 2 | Valid Parentheses String, Stack | Easy | 92 | 0.4% |
| 3 | Validate IP Address String | Medium | 90 | 0.3% |
| 4 | Minimum Cost For Tickets Array, Dynamic Programming | Medium | 86 | 0.7% |
| 5 | Koko Eating Bananas Array, Binary Search | Medium | 83 | 0.5% |
| 6 | Baseball Game Array, Stack, Simulation | Easy | 76 | 0.8% |
| 7 | Minimum Length of Anagram Concatenation Hash Table, String, Counting | Medium | 76 | 0.4% |
| 8 | Longest Arithmetic Subsequence Array, Hash Table, Binary Search, Dynamic Programming | Medium | 72 | 0.5% |
| 9 | Longest Palindromic Substring Two Pointers, String, Dynamic Programming | Medium | 67 | 0.4% |
| 10 | Apply Operations to Make Sum of Array Greater Than or Equal to k Math, Greedy, Enumeration | Medium | 67 | 0.4% |
| 11 | Minimum Number of Operations to Satisfy Conditions Array, Dynamic Programming, Matrix | Medium | 67 | 0.4% |
| 12 | Minimum Adjacent Swaps for K Consecutive Ones Array, Greedy, Sliding Window, Prefix Sum | Hard | 67 | 0.4% |
| 13 | Longest Common Prefix Array, String, Trie | Easy | 61 | 0.5% |
| 14 | Number of Islands Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix | Medium | 61 | 0.6% |
| 15 | Best Time to Buy and Sell Stock Array, Dynamic Programming | Easy | 61 | 0.6% |
| 16 | Two Sum Array, Hash Table | Easy | 61 | 0.6% |
| 17 | Find the Town Judge Array, Hash Table, Graph Theory | Easy | 52 | 0.5% |
| 18 | Maximum Subarray Array, Divide and Conquer, Dynamic Programming | Medium | 52 | 0.5% |
| 19 | Merge Intervals Array, Sorting | Medium | 52 | 0.5% |
| 20 | Degree of an Array Array, Hash Table | Easy | 52 | 0.6% |
| 21 | Product of Array Except Self Array, Prefix Sum | Medium | 52 | 0.7% |
| 22 | Maximum Repeating Substring String, Dynamic Programming, String Matching | Easy | 52 | 0.4% |
| 23 | Partition Array Into Three Parts With Equal Sum Array, Greedy | Easy | 52 | 0.4% |
| 24 | Kth Largest Element in an Array Array, Divide and Conquer, Sorting, Heap (Priority Queue), Quickselect | Medium | 52 | 0.7% |
| 25 | Find First and Last Position of Element in Sorted Array Array, Binary Search | Medium | 52 | 0.5% |
| 26 | Race Car Dynamic Programming | Hard | 52 | 0.4% |
| 27 | Jump Game Array, Dynamic Programming, Greedy | Medium | 52 | 0.4% |
| 28 | Minimum Number of Operations to Make Word K-Periodic Hash Table, String, Counting | Medium | 52 | 0.6% |
| 29 | Group Anagrams Array, Hash Table, String, Sorting | Medium | 52 | 0.7% |
| 30 | Sum of Digit Differences of All Pairs Array, Hash Table, Math, Counting | Medium | 52 | 0.4% |
| 31 | 3Sum Array, Two Pointers, Sorting | Medium | 52 | 0.4% |
| 32 | Median of Two Sorted Arrays Array, Binary Search, Divide and Conquer | Hard | 52 | 0.5% |
| 33 | K Divisible Elements Subarrays Array, Hash Table, Trie, Rolling Hash, Hash Function, Enumeration | Medium | 52 | 0.6% |
| 34 | Count Square Sum Triples Math, Enumeration | Easy | 52 | 0.8% |
| 35 | Non-decreasing Array Array | Medium | 52 | 0.3% |
| 36 | Minimum Cost Walk in Weighted Graph Array, Bit Manipulation, Union-Find, Graph Theory | Hard | 52 | 0.7% |
| 37 | Ugly Number II Hash Table, Math, Dynamic Programming, Heap (Priority Queue) | Medium | 52 | 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.