| Determine if String Halves Are Alike | Open ↗ |
| Determine if Two Events Have Conflict | Open ↗ |
| Determine if Two Strings Are Close | Open ↗ |
| Determine the Minimum Sum of a k-avoiding Array | Open ↗ |
| Determine the Winner of a Bowling Game | Open ↗ |
| Determine Whether Matrix Can Be Obtained By Rotation | Open ↗ |
| Detonate the Maximum Bombs | Open ↗ |
| Diagonal Traverse | Open ↗ |
| Diagonal Traverse II | Open ↗ |
| Diameter of Binary Tree | Open ↗ |
| Diameter of N-Ary Tree | Open ↗ |
| Dice Roll Simulation | Open ↗ |
| Diet Plan Performance | Open ↗ |
| Difference Between Element Sum and Digit Sum of an Array | Open ↗ |
| Difference Between Maximum and Minimum Price Sum | Open ↗ |
| Difference Between Ones and Zeros in Row and Column | Open ↗ |
| Differences Between Two Objects | Open ↗ |
| Different Ways to Add Parentheses | Open ↗ |
| Digit Count in Range | Open ↗ |
| Digit Operations to Make Two Integers Equal | Open ↗ |
| Dinner Plate Stacks | Open ↗ |
| Disconnect Path in a Binary Matrix by at Most One Flip | Open ↗ |
| Display Table of Food Orders in a Restaurant | Open ↗ |
| Display the First Three Rows | Open ↗ |
| Distance Between Bus Stops | Open ↗ |
| Distance to a Cycle in Undirected Graph | Open ↗ |
| Distant Barcodes | Open ↗ |
| Distinct Echo Substrings | Open ↗ |
| Distinct Numbers in Each Subarray | Open ↗ |
| Distinct Prime Factors of Product of Array | Open ↗ |
| Distinct Subsequences | Open ↗ |
| Distinct Subsequences II | Open ↗ |
| Distribute Candies | Open ↗ |
| Distribute Candies Among Children I | Open ↗ |
| Distribute Candies Among Children II | Open ↗ |
| Distribute Candies Among Children III | Open ↗ |
| Distribute Coins in Binary Tree | Open ↗ |
| Distribute Elements Into Two Arrays I | Open ↗ |
| Distribute Elements Into Two Arrays II | Open ↗ |
| Distribute Money to Maximum Children | Open ↗ |
| Distribute Repeating Integers | Open ↗ |
| DI String Match | Open ↗ |
| Divide an Array Into Subarrays With Minimum Cost I | Open ↗ |
| Divide an Array Into Subarrays With Minimum Cost II | Open ↗ |
| Divide Array in Sets of K Consecutive Numbers | Open ↗ |
| Divide Array Into Arrays With Max Difference | Open ↗ |
| Divide Array Into Equal Pairs | Open ↗ |
| Divide Array Into Increasing Sequences | Open ↗ |
| Divide a String Into Groups of Size k | Open ↗ |
| Divide Chocolate | Open ↗ |
| Divide Intervals Into Minimum Number of Groups | Open ↗ |
| Divide Nodes Into the Maximum Number of Groups | Open ↗ |
| Divide Players Into Teams of Equal Skill | Open ↗ |
| Divide Two Integers | Open ↗ |
| Divisible and Non-divisible Sums Difference | Open ↗ |
| Divisor Game | Open ↗ |
| DNA Pattern Recognition | Open ↗ |
| Domino and Tromino Tiling | Open ↗ |
| Dota2 Senate | Open ↗ |
| Dot Product of Two Sparse Vectors | Open ↗ |
| Double a Number Represented as a Linked List | Open ↗ |
| Double Modular Exponentiation | Open ↗ |
| Dungeon Game | Open ↗ |
| Duplicate Emails | Open ↗ |
| Duplicate Zeros | Open ↗ |
| Earliest Finish Time for Land and Water Rides I | Open ↗ |
| Earliest Finish Time for Land and Water Rides II | Open ↗ |
| Earliest Possible Day of Full Bloom | Open ↗ |
| Earliest Second to Mark Indices I | Open ↗ |
| Earliest Second to Mark Indices II | Open ↗ |
| Eat Pizzas! | Open ↗ |
| Edit Distance | Open ↗ |
| Egg Drop With 2 Eggs and N Floors | Open ↗ |
| Element Appearing More Than 25% In Sorted Array | Open ↗ |
| Eliminate Maximum Number of Monsters | Open ↗ |
| Elimination Game | Open ↗ |
| Employee Bonus | Open ↗ |
| Employee Free Time | Open ↗ |
| Employee Importance | Open ↗ |
| Employees Earning More Than Their Managers | Open ↗ |
| Employees Whose Manager Left the Company | Open ↗ |
| Employees With Deductions | Open ↗ |
| Employees With Missing Information | Open ↗ |
| Encode and Decode Strings | Open ↗ |
| Encode and Decode TinyURL | Open ↗ |
| Encode Number | Open ↗ |
| Encode String with Shortest Length | Open ↗ |
| Encrypt and Decrypt Strings | Open ↗ |
| Equalize Strings by Adding or Removing Characters at Ends | Open ↗ |
| Equal Rational Numbers | Open ↗ |
| Equal Row and Column Pairs | Open ↗ |
| Equal Sum Arrays With Minimum Number of Operations | Open ↗ |
| Equal Sum Grid Partition I | Open ↗ |
| Equal Sum Grid Partition II | Open ↗ |
| Equal Tree Partition | Open ↗ |
| Erect the Fence | Open ↗ |
| Erect the Fence II | Open ↗ |
| Escape a Large Maze | Open ↗ |
| Escape The Ghosts | Open ↗ |
| Escape the Spreading Fire | Open ↗ |