Skip to content

Interview Solver

FeaturesPricingHelp
Sign In
FeaturesPricingHelpSign In
  1. Interview Questions
  2. /
  3. Globant

Globant LeetCode Interview Questions

Practice 48 real coding problems frequently asked in Globant technical interviews. Master these questions to ace your next Globant software engineering interview.

14 Easy
27 Medium
7 Hard

Top Topics at Globant

ArrayStringDepth-First SearchSortingHash Table

Ace your Globant interview with AI

Get real-time AI assistance during your actual interview. Invisible to screensharing.

Start Free Trial

Globant Interview Problems

ProblemDifficultyDiffFrequencyTopicsAction
Combination Sum
100%
MediumM
100%
ArrayBacktracking
Solve→
Find K Pairs with Smallest Sums
97%
MediumM
97%
ArrayHeap (Priority Queue)
Solve→
Remove All Occurrences of a Substring
89%
MediumM
89%
StringStack+1
Solve→
Flatten Binary Tree to Linked List
83%
MediumM
83%
Linked ListStack+3
Solve→
Zero Array Transformation III
80%
MediumM
80%
ArrayGreedy+3
Solve→
Design an Array Statistics Tracker
80%
HardH
80%
Hash TableBinary Search+5
Solve→
Longest Increasing Path in a Matrix
79%
HardH
79%
ArrayDynamic Programming+6
Solve→
Product of Array Except Self
78%
MediumM
78%
ArrayPrefix Sum
Solve→
LFU Cache
76%
HardH
76%
Hash TableLinked List+2
Solve→
Length of Last Word
76%
EasyE
76%
String
Solve→
Recyclable and Low Fat Products
72%
EasyE
72%
Database
Solve→
Toeplitz Matrix
71%
EasyE
71%
ArrayMatrix
Solve→
Kth Missing Positive Number
70%
EasyE
70%
ArrayBinary Search
Solve→
Move Pieces to Obtain a String
70%
MediumM
70%
Two PointersString
Solve→
Populating Next Right Pointers in Each Node
69%
MediumM
69%
Linked ListTree+3
Solve→
Subsets
68%
MediumM
68%
ArrayBacktracking+1
Solve→
Find Leaves of Binary Tree
68%
MediumM
68%
TreeDepth-First Search+1
Solve→
Boundary of Binary Tree
66%
MediumM
66%
TreeDepth-First Search+1
Solve→
Lowest Common Ancestor of a Binary Tree
63%
MediumM
63%
TreeDepth-First Search+1
Solve→
Group Anagrams
61%
MediumM
61%
ArrayHash Table+2
Solve→
Daily Temperatures
60%
MediumM
60%
ArrayStack+1
Solve→
Integer to English Words
60%
HardH
60%
MathString+1
Solve→
Maximum Number of Occurrences of a Substring
59%
MediumM
59%
Hash TableString+1
Solve→
Maximum Number of Events That Can Be Attended
54%
MediumM
54%
ArrayGreedy+2
Solve→
Regular Expression Matching
52%
HardH
52%
StringDynamic Programming+1
Solve→

Pass your interview with AI assistance

Get real-time solutions during your actual coding interview. Invisible to screensharing.

Start Free Trial
Search Suggestions System
51%
MediumM
51%
ArrayString+4
Solve→
House Robber
50%
MediumM
50%
ArrayDynamic Programming
Solve→
Goat Latin
50%
EasyE
50%
String
Solve→
Design HashMap
50%
EasyE
50%
ArrayHash Table+3
Solve→
The Earliest Moment When Everyone Become Friends
50%
MediumM
50%
ArrayUnion Find+1
Solve→
Flip Columns For Maximum Number of Equal Rows
48%
MediumM
48%
ArrayHash Table+1
Solve→
Merge k Sorted Lists
48%
HardH
48%
Linked ListDivide and Conquer+2
Solve→
Longest Consecutive Sequence
44%
MediumM
44%
ArrayHash Table+1
Solve→
Find K Closest Elements
42%
MediumM
42%
ArrayTwo Pointers+4
Solve→
Closest Binary Search Tree Value
41%
EasyE
41%
Binary SearchTree+3
Solve→
Number of Islands
40%
MediumM
40%
ArrayDepth-First Search+3
Solve→
Sqrt(x)
40%
EasyE
40%
MathBinary Search
Solve→
Nested List Weight Sum
40%
MediumM
40%
Depth-First SearchBreadth-First Search
Solve→
Same Tree
39%
EasyE
39%
TreeDepth-First Search+2
Solve→
Maximum Subarray
38%
MediumM
38%
ArrayDivide and Conquer+1
Solve→
Moving Average from Data Stream
38%
EasyE
38%
ArrayDesign+2
Solve→
Merge Sorted Array
38%
EasyE
38%
ArrayTwo Pointers+1
Solve→
Take Gifts From the Richest Pile
37%
EasyE
37%
ArrayHeap (Priority Queue)+1
Solve→
Sort Colors
35%
MediumM
35%
ArrayTwo Pointers+1
Solve→
Minimum Window Substring
32%
HardH
32%
Hash TableString+1
Solve→
Roman to Integer
29%
EasyE
29%
Hash TableMath+1
Solve→
Best Time to Buy and Sell Stock II
26%
MediumM
26%
ArrayDynamic Programming+1
Solve→
Squares of a Sorted Array
26%
EasyE
26%
ArrayTwo Pointers+1
Solve→

Similar Companies

Explore interview questions from other companies with similar interview patterns.

Alcon
48 problems
Anaplan
48 problems
Ansys
48 problems
Axon
48 problems
Cadence Design Systems
48 problems
Chamberlain Group
48 problems

Frequently Asked Questions

What LeetCode problems does Globant ask in interviews?

Globant commonly asks 48 coding problems in technical interviews, including Combination Sum, Find K Pairs with Smallest Sums, Remove All Occurrences of a Substring. The difficulty breakdown is 14 Easy, 27 Medium, and 7 Hard problems.

How should I prepare for a Globant coding interview?

Focus on the most frequently asked problems first, especially those with high frequency scores. Globant interviews typically emphasize Array and String. Practice explaining your thought process while coding.

What is the difficulty level of Globant coding interviews?

Based on our data, Globant interviews include 14 Easy (29%), 27 Medium (56%), and 7 Hard (15%) problems.

Ready to ace your Globant interview?

Join thousands of engineers who landed offers at top tech companies.

Get Started Free

No credit card required

All CompaniesEasy ProblemsMedium ProblemsHard ProblemsBrowse by Topic
Interview Solver
  • Home
  • Pricing
  • Sign in
  • Contact
  • Blog
  • Companion
  • Help Center
  • Use Cases
  • Software Engineer
  • Product Manager
  • Misc
  • Privacy Policy
  • Terms and Conditions
  • Discord Community
  • Affiliate Program
  • Compare
  • All Comparisons
  • vs Final Round AI
  • vs UltraCode
  • vs Interview Coder
  • vs LockedIn AI
  • vs AI Apply
  • Free Tools
  • ATS Resume Checker
  • STAR Method Builder
  • Salary Lookup
  • Big O Cheat Sheet
  • Total Comp Calculator
  • View All →
  • Interview Questions
  • Google Questions
  • Amazon Questions
  • Microsoft Questions
  • Meta Questions
  • Apple Questions
  • TikTok Questions
  • View All →
© 2026 Interview Solver, Inc. All rights reserved.