Skip to content

Interview Solver

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

Relativity LeetCode Interview Questions

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

7 Easy
13 Medium
3 Hard

Top Topics at Relativity

ArrayStringTwo PointersMathRecursion

Ace your Relativity interview with AI

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

Start Free Trial

Relativity Interview Problems

ProblemDifficultyDiffFrequencyTopicsAction
Valid Word Abbreviation
100%
EasyE
100%
Two PointersString
Solve→
Basic Calculator
78%
HardH
78%
MathString+2
Solve→
Squares of a Sorted Array
77%
EasyE
77%
ArrayTwo Pointers+1
Solve→
Number of Islands
75%
MediumM
75%
ArrayDepth-First Search+3
Solve→
Palindrome Linked List
74%
EasyE
74%
Linked ListTwo Pointers+2
Solve→
Pow(x, n)
70%
MediumM
70%
MathRecursion
Solve→
Sliding Window Maximum
66%
HardH
66%
ArrayQueue+3
Solve→
Reverse Linked List
65%
EasyE
65%
Linked ListRecursion
Solve→
Create Hello World Function
63%
EasyE
63%
Solve→
Goat Latin
62%
EasyE
62%
String
Solve→
Buildings With an Ocean View
51%
MediumM
51%
ArrayStack+1
Solve→
Final Array State After K Multiplication Operations I
51%
EasyE
51%
ArrayMath+2
Solve→
Shortest Word Distance II
43%
MediumM
43%
ArrayHash Table+3
Solve→
Kth Largest Element in an Array
38%
MediumM
38%
ArrayDivide and Conquer+3
Solve→
Find K Pairs with Smallest Sums
38%
MediumM
38%
ArrayHeap (Priority Queue)
Solve→
Maximum Area Rectangle With Point Constraints I
36%
MediumM
36%
ArrayMath+5
Solve→
Construct Quad Tree
36%
MediumM
36%
ArrayDivide and Conquer+2
Solve→
Reverse Words in a String
32%
MediumM
32%
Two PointersString
Solve→
Find Peak Element
31%
MediumM
31%
ArrayBinary Search
Solve→
Expression Add Operators
30%
HardH
30%
MathString+1
Solve→
Walls and Gates
30%
MediumM
30%
ArrayBreadth-First Search+1
Solve→
Longest Increasing Subsequence
29%
MediumM
29%
ArrayBinary Search+1
Solve→
Binary Tree Vertical Order Traversal
21%
MediumM
21%
Hash TableTree+4
Solve→

Similar Companies

Explore interview questions from other companies with similar interview patterns.

Ampere Computing
23 problems
AT&T
23 problems
Byjus
23 problems
Cerebras Systems
23 problems
Chainalysis
23 problems
Chegg
23 problems

Frequently Asked Questions

What LeetCode problems does Relativity ask in interviews?

Relativity commonly asks 23 coding problems in technical interviews, including Valid Word Abbreviation, Basic Calculator, Squares of a Sorted Array. The difficulty breakdown is 7 Easy, 13 Medium, and 3 Hard problems.

How should I prepare for a Relativity coding interview?

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

What is the difficulty level of Relativity coding interviews?

Based on our data, Relativity interviews include 7 Easy (30%), 13 Medium (57%), and 3 Hard (13%) problems.

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