All companies
Databricks
2 Easy22 Medium7 Hard31 total
| No. | Problem | Difficulty | Frequency |
|---|---|---|---|
| 751 | IP to CIDR | Medium | |
| 362 | Design Hit Counter | Medium | |
| 2096 | Step-By-Step Directions From a Binary Tree Node to Another | Medium | |
| 198 | House Robber | Medium | |
| 348 | Design Tic-Tac-Toe | Medium | |
| 981 | Time Based Key-Value Store | Medium | |
| 438 | Find All Anagrams in a String | Medium | |
| 213 | House Robber II | Medium | |
| 2131 | Longest Palindrome by Concatenating Two Letter Words | Medium | |
| 1146 | Snapshot Array | Medium | |
| 742 | Closest Leaf in a Binary Tree | Medium | |
| 933 | Number of Recent Calls | Easy | |
| 1293 | Shortest Path in a Grid with Obstacles Elimination | Hard | |
| 900 | RLE Iterator | Medium | |
| 68 | Text Justification | Hard | |
| 2468 | Split Message Based on Limit | Hard | |
| 980 | Unique Paths III | Hard | |
| 567 | Permutation in String | Medium | |
| 2251 | Number of Flowers in Full Bloom | Hard | |
| 3043 | Find the Length of the Longest Common Prefix | Medium | |
| 1865 | Finding Pairs With a Certain Sum | Medium | |
| 54 | Spiral Matrix | Medium | |
| 845 | Longest Mountain in Array | Medium | |
| 8 | String to Integer (atoi) | Medium | |
| 56 | Merge Intervals | Medium | |
| 1091 | Shortest Path in Binary Matrix | Medium | |
| 1928 | Minimum Cost to Reach Destination in Time | Hard | |
| 2276 | Count Integers in Intervals | Hard | |
| 1197 | Minimum Knight Moves | Medium | |
| 994 | Rotting Oranges | Medium | |
| 1 | Two Sum | Easy |
