HP LeetCode Interview Questions
HP has asked 4 distinct LeetCode questions across all recorded interviews: 3 easy, 1 medium and 0 hard. The questions reported most often are Minimum Recolors to Get K Consecutive Black Blocks, Minimum Cost Homecoming of a Robot in a Grid and Longest Palindrome. Each question links straight to LeetCode.
| # | Problem | Difficulty | Frequency | Acceptance | |
|---|---|---|---|---|---|
| 1 | Minimum Recolors to Get K Consecutive Black Blocks | Easy | 100 | 0.7% | |
| 2 | Minimum Cost Homecoming of a Robot in a Grid | Medium | 91 | 0.5% | |
| 3 | Longest Palindrome | Easy | 76 | 0.6% | |
| 4 | Valid Parentheses | Easy | 76 | 0.4% |
Where this data comes from
These questions come from the public leetcode-company-wise-problems data set, which collects interview reports from candidates. They are community-reported rather than published by HP, so treat the list as a strong signal of what gets asked, not an official or exhaustive syllabus. Last refreshed .
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. It is a relative popularity signal within HP's questions, not a probability that you will be asked it. Acceptance is LeetCode's own share of submissions that pass for that problem, across all users, not something specific to HP. Click any question to open it on LeetCode.