Here Technologies LeetCode Interview Questions
Practice 46 real coding problems frequently asked in Here Technologies technical interviews. Master these questions to ace your next Here Technologies software engineering interview.
Top Topics at Here Technologies
Ace your Here Technologies interview with AI
Get real-time AI assistance during your actual interview. Invisible to screensharing.
Here Technologies Interview Problems
| Problem | DifficultyDiff | Action |
|---|---|---|
Zero Array Transformation II 100% | MediumM | Solve→ |
Interval List Intersections 92% | MediumM | Solve→ |
Design Tic-Tac-Toe 88% | MediumM | Solve→ |
Merge Intervals 86% | MediumM | Solve→ |
Closest Binary Search Tree Value 84% | EasyE | Solve→ |
Two City Scheduling 84% | MediumM | Solve→ |
Find Leaves of Binary Tree 80% | MediumM | Solve→ |
Move Zeroes 80% | EasyE | Solve→ |
Friends Of Appropriate Ages 77% | MediumM | Solve→ |
Kth Largest Element in an Array 73% | MediumM | Solve→ |
Continuous Subarray Sum 73% | MediumM | Solve→ |
Minimum Area Rectangle 71% | MediumM | Solve→ |
Minimum Operations to Make Character Frequencies Equal 66% | HardH | Solve→ |
Maximum Subarray 66% | MediumM | Solve→ |
Rotting Oranges 64% | MediumM | Solve→ |
Minimum Difference in Sums After Removal of Elements 61% | HardH | Solve→ |
Single Number 59% | EasyE | Solve→ |
Best Time to Buy and Sell Stock 58% | EasyE | Solve→ |
Word Pattern II 58% | MediumM | Solve→ |
Coin Change II 57% | MediumM | Solve→ |
Subsets II 56% | MediumM | Solve→ |
Number of Islands II 56% | HardH | Solve→ |
Sort Integers by The Power Value 56% | MediumM | Solve→ |
Dot Product of Two Sparse Vectors 56% | MediumM | Solve→ |
Merge Sorted Array 55% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Valid Palindrome 53% | EasyE | Solve→ |
Search a 2D Matrix 53% | MediumM | Solve→ |
4Sum 51% | MediumM | Solve→ |
Basic Calculator 45% | HardH | Solve→ |
Implement Queue using Stacks 45% | EasyE | Solve→ |
Minimum Add to Make Parentheses Valid 44% | MediumM | Solve→ |
Merge Two Sorted Lists 44% | EasyE | Solve→ |
Coin Change 41% | MediumM | Solve→ |
Asteroid Collision 39% | MediumM | Solve→ |
Make String a Subsequence Using Cyclic Increments 38% | MediumM | Solve→ |
Maximum Sum Circular Subarray 35% | MediumM | Solve→ |
Digit Operations to Make Two Integers Equal 35% | MediumM | Solve→ |
Zero Array Transformation III 35% | MediumM | Solve→ |
Maximum Size Subarray Sum Equals k 34% | MediumM | Solve→ |
Two Sum II - Input Array Is Sorted 33% | MediumM | Solve→ |
Word Ladder 30% | HardH | Solve→ |
Ransom Note 28% | EasyE | Solve→ |
Unique Paths 27% | MediumM | Solve→ |
Reveal Cards In Increasing Order 27% | MediumM | Solve→ |
Spiral Matrix 22% | MediumM | Solve→ |
Median of Two Sorted Arrays 21% | HardH | Solve→ |
Similar Companies
Explore interview questions from other companies with similar interview patterns.
Frequently Asked Questions
What LeetCode problems does Here Technologies ask in interviews?
Here Technologies commonly asks 46 coding problems in technical interviews, including Zero Array Transformation II, Interval List Intersections, Design Tic-Tac-Toe. The difficulty breakdown is 9 Easy, 31 Medium, and 6 Hard problems.
How should I prepare for a Here Technologies coding interview?
Focus on the most frequently asked problems first, especially those with high frequency scores. Here Technologies interviews typically emphasize Array and Hash Table. Practice explaining your thought process while coding.
What is the difficulty level of Here Technologies coding interviews?
Based on our data, Here Technologies interviews include 9 Easy (20%), 31 Medium (67%), and 6 Hard (13%) problems.
Ready to ace your Here Technologies interview?
Join thousands of engineers who landed offers at top tech companies.
Get Started FreeNo credit card required