Skip to content

Interview Solver

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

Angi LeetCode Interview Questions

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

14 Easy
29 Medium
7 Hard

Top Topics at Angi

ArrayStringTwo PointersHash TableDynamic Programming

Ace your Angi interview with AI

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

Start Free Trial

Angi Interview Problems

ProblemDifficultyDiffFrequencyTopicsAction
Median of Two Sorted Arrays
100%
HardH
100%
ArrayBinary Search+1
Solve→
4Sum
89%
MediumM
89%
ArrayTwo Pointers+1
Solve→
Generate Parentheses
86%
MediumM
86%
StringDynamic Programming+1
Solve→
Reveal Cards In Increasing Order
85%
MediumM
85%
ArrayQueue+2
Solve→
Merge Strings Alternately
83%
EasyE
83%
Two PointersString
Solve→
Take Gifts From the Richest Pile
81%
EasyE
81%
ArrayHeap (Priority Queue)+1
Solve→
Minimum Operations to Make Character Frequencies Equal
81%
HardH
81%
Hash TableString+3
Solve→
Find the Index of the First Occurrence in a String
79%
EasyE
79%
Two PointersString+1
Solve→
Maximum Swap
78%
MediumM
78%
MathGreedy
Solve→
Maximum Nesting Depth of the Parentheses
77%
EasyE
77%
StringStack
Solve→
Dot Product of Two Sparse Vectors
77%
MediumM
77%
ArrayHash Table+2
Solve→
Subsets
77%
MediumM
77%
ArrayBacktracking+1
Solve→
Course Schedule
76%
MediumM
76%
Depth-First SearchBreadth-First Search+2
Solve→
Word Break
75%
MediumM
75%
ArrayHash Table+4
Solve→
Minimum Array Sum
75%
MediumM
75%
ArrayDynamic Programming
Solve→
Linked List Cycle
74%
EasyE
74%
Hash TableLinked List+1
Solve→
Convert Sorted List to Binary Search Tree
73%
MediumM
73%
Linked ListDivide and Conquer+3
Solve→
Regular Expression Matching
70%
HardH
70%
StringDynamic Programming+1
Solve→
Reverse Linked List
69%
EasyE
69%
Linked ListRecursion
Solve→
House Robber II
69%
MediumM
69%
ArrayDynamic Programming
Solve→
Binary Tree Vertical Order Traversal
66%
MediumM
66%
Hash TableTree+4
Solve→
Add Strings
66%
EasyE
66%
MathString+1
Solve→
Largest Rectangle in Histogram
66%
HardH
66%
ArrayStack+1
Solve→
Insert Delete GetRandom O(1) - Duplicates allowed
66%
HardH
66%
ArrayHash Table+3
Solve→
Missing Ranges
64%
EasyE
64%
Array
Solve→

Pass your interview with AI assistance

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

Start Free Trial
Palindromic Substrings
61%
MediumM
61%
Two PointersString+1
Solve→
Number of Islands
59%
MediumM
59%
ArrayDepth-First Search+3
Solve→
Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit
58%
MediumM
58%
ArrayQueue+4
Solve→
Maximum Number of Occurrences of a Substring
57%
MediumM
57%
Hash TableString+1
Solve→
Moving Average from Data Stream
56%
EasyE
56%
ArrayDesign+2
Solve→
Longest Increasing Subsequence
54%
MediumM
54%
ArrayBinary Search+1
Solve→
Move Zeroes
53%
EasyE
53%
ArrayTwo Pointers
Solve→
Next Permutation
52%
MediumM
52%
ArrayTwo Pointers
Solve→
Interval List Intersections
51%
MediumM
51%
ArrayTwo Pointers
Solve→
Add Two Numbers
50%
MediumM
50%
Linked ListMath+1
Solve→
Search Insert Position
50%
EasyE
50%
ArrayBinary Search
Solve→
Best Time to Buy and Sell Stock II
46%
MediumM
46%
ArrayDynamic Programming+1
Solve→
Longest Repeating Character Replacement
45%
MediumM
45%
Hash TableString+1
Solve→
Group Anagrams
43%
MediumM
43%
ArrayHash Table+2
Solve→
Maximum Sum of Distinct Subarrays With Length K
43%
MediumM
43%
ArrayHash Table+1
Solve→
Make String a Subsequence Using Cyclic Increments
40%
MediumM
40%
Two PointersString
Solve→
Minimum Time to Visit a Cell In a Grid
34%
HardH
34%
ArrayBreadth-First Search+4
Solve→
Combination Sum
32%
MediumM
32%
ArrayBacktracking
Solve→
Maximum Units on a Truck
31%
EasyE
31%
ArrayGreedy+1
Solve→
Number of Islands II
29%
HardH
29%
ArrayHash Table+1
Solve→
Implement Queue using Stacks
26%
EasyE
26%
StackDesign+1
Solve→
Insert into a Sorted Circular Linked List
24%
MediumM
24%
Linked List
Solve→
Combination Sum II
24%
MediumM
24%
ArrayBacktracking
Solve→
Valid Palindrome
23%
EasyE
23%
Two PointersString
Solve→
Search a 2D Matrix
22%
MediumM
22%
ArrayBinary Search+1
Solve→

Similar Companies

Explore interview questions from other companies with similar interview patterns.

American Express
50 problems
Amobee
50 problems
Amperity
50 problems
Appdynamics
50 problems
Avalara
50 problems
Biomérieux
50 problems

Frequently Asked Questions

What LeetCode problems does Angi ask in interviews?

Angi commonly asks 50 coding problems in technical interviews, including Median of Two Sorted Arrays, 4Sum, Generate Parentheses. The difficulty breakdown is 14 Easy, 29 Medium, and 7 Hard problems.

How should I prepare for a Angi coding interview?

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

What is the difficulty level of Angi coding interviews?

Based on our data, Angi interviews include 14 Easy (28%), 29 Medium (58%), and 7 Hard (14%) problems.

Ready to ace your Angi 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.