Adobe LeetCode Questions Categorized
by Difficulty and String Tag
🟢 Easy (~58 Questions)
• Two Sum
• Reverse Integer
• Combine Two Tables
• Jewels and Stones
• Merge Two Sorted Lists
• Reverse Linked List
• Unique Email Addresses (string)
• Big Countries
• Maximum Subarray
• Count Binary Substrings (string)
• Longest Common Prefix (string)
• Roman to Integer (string)
• Valid Phone Numbers (string)
• Best Time to Buy and Sell Stock II
• Nth Digit
• Find All Numbers Disappeared in an Array
• Positions of Large Groups (string)
• Palindrome Number (string/number)
• Merge Sorted Array
• Missing Number
• Tenth Line
• Add Binary (string)
• Climbing Stairs
• Search Insert Position
• Rectangle Overlap
• Sort Array By Parity
• Valid Parentheses (string)
• Simplify Path (string)
• Design HashMap
• Linked List Cycle
• Ugly Number
• Sum of Two Integers
• Max Area of Island
• Reverse String (string)
• To Lower Case (string)
• Squares of a Sorted Array
• Pascal’s Triangle II
• Single Number
• Remove Linked List Elements
• Robot Return to Origin (string)
• Count and Say (string)
• Length of Last Word (string)
• Minimum Depth of Binary Tree
• Add Digits
• Convert Sorted Array to BST
• Invert Binary Tree
• Lowest Common Ancestor of BST
• Path Sum
• Two Sum II – Sorted
• Majority Element
• Fibonacci Number
• Diameter of Binary Tree
• Search Insert Position
• Factorial Trailing Zeroes
• Binary Tree Level Order Traversal II
• Binary Tree Inorder Traversal
• Symmetric Tree
• Merge Intervals
🟡 Medium (~65 Questions)
• Add Two Numbers
• Longest Substring Without Repeating Characters (string)
• 3Sum
• Longest Palindromic Substring (string)
• Copy List with Random Pointer
• Container With Most Water
• 3Sum Closest
• Word Frequency (string)
• Largest Divisible Subset
• Product of Array Except Self
• Bitwise AND of Numbers Range
• Spiral Matrix
• Integer to Roman (string)
• Subsets
• Remove Nth Node From End of List
• Palindrome Partitioning (string)
• Longest Increasing Subsequence
• Evaluate Division
• Kth Smallest Element in Matrix
• Word Break (string)
• Zigzag Conversion (string)
• Group Anagrams (string)
• Rotate Array
• Contains Duplicate II
• Palindromic Substrings (string)
• House Robber
• Permutations
• Flatten Binary Tree to Linked List
• Construct Binary Tree from Preorder & Inorder
• Decode Ways (string)
• Letter Combinations of a Phone Number (string)
• Implement strStr() (string)
• Swap Nodes in Pairs
• Generate Parentheses
• Merge Intervals
• Max Area of Island
• Max Increase to Keep City Skyline
• Binary Tree Zigzag Level Order Traversal
• Remove Linked List Elements
• Valid Parentheses
• Binary Tree Right Side View
• Unique Binary Search Trees II
• Minimum Path Sum
• Merge k Sorted Lists
• LRU Cache
• Reverse Linked List II
• Pow(x, n)
• Vertical Order Traversal of a Binary Tree
• Basic Calculator (string)
• Rotate Image
• Linked List Cycle
• Diameter of Binary Tree
• Min Stack
• Search in Rotated Sorted Array II
• 4Sum
• Permutations II
• Sort Colors
• Remove K Digits (string)
• Maximal Rectangle
• Encode and Decode TinyURL (string)
• Jump Game II
• Department Top Three Salaries
• Construct BST from Sorted Array
• Binary Tree Level Order Traversal II
• Validate Binary Search Tree
🔴 Hard (~24 Questions)
• Median of Two Sorted Arrays
• Substring with Concatenation of All Words (string)
• Regular Expression Matching (string)
• LFU Cache
• Max Points on a Line
• Trapping Rain Water
• Edit Distance (string)
• Longest Valid Parentheses (string)
• Wildcard Matching (string)
• Largest Rectangle in Histogram
• Sliding Window Maximum
• Next Permutation
• Count of Smaller Numbers After Self
• Second Highest Salary
• Trips and Users
• Basic Calculator
• Next Greater Element III
• Number of Atoms
• Maximal Rectangle
• Department Top Three Salaries
• Evaluate Division
• Binary Tree Inorder Traversal
• Flatten Binary Tree to Linked List
• Construct Binary Tree from Preorder and Inorder
📊 Summary
Difficulty | Total | String-Based
-----------|--------|---------------
Easy | ~58 | 15+
Medium | ~65 | 16+
Hard | ~24 | 6+
**Total** | **147** | **37+**