| Text Justification | Open ↗ |
| The celebrity Problem | Open ↗ |
| The celebrity problem | Open ↗ |
| The Dining Philosophers | Open ↗ |
| The Earliest and Latest Rounds Where Players Compete | Open ↗ |
| The Earliest Moment When Everyone Become Friends | Open ↗ |
| The Employee That Worked on the Longest Task | Open ↗ |
| The Knight’s Tour | Open ↗ |
| The Knight’s tour problem | Open ↗ |
| The k Strongest Values in an Array | Open ↗ |
| The kth Factor of n | Open ↗ |
| The k-th Lexicographical String of All Happy Strings of Length n | Open ↗ |
| The K Weakest Rows in a Matrix | Open ↗ |
| The Latest Login in 2020 | Open ↗ |
| The Latest Time to Catch a Bus | Open ↗ |
| The Maze | Open ↗ |
| The Maze II | Open ↗ |
| The Maze III | Open ↗ |
| The Most Frequently Ordered Products for Each Customer | Open ↗ |
| The Most Recent Orders for Each Product | Open ↗ |
| The Most Similar Path in a Graph | Open ↗ |
| The Number of Beautiful Subsets | Open ↗ |
| The Number of Employees Which Report to Each Employee | Open ↗ |
| The Number of Full Rounds You Have Played | Open ↗ |
| The Number of Good Subsets | Open ↗ |
| The Number of Rich Customers | Open ↗ |
| The Number of the Smallest Unoccupied Chair | Open ↗ |
| The Number of Users That Are Eligible for Discount | Open ↗ |
| The Number of Weak Characters in the Game | Open ↗ |
| The Painter's Partition Problem-II | Open ↗ |
| The Score of Students Solving Math Expression | Open ↗ |
| The Skyline Problem | Open ↗ |
| The Time When the Network Becomes Idle | Open ↗ |
| The Two Sneaky Numbers of Digitville | Open ↗ |
| The Users That Are Eligible for Discount | Open ↗ |
| The Winner University | Open ↗ |
| Third Maximum Number | Open ↗ |
| Three Consecutive Odds | Open ↗ |
| Three Divisors | Open ↗ |
| Three Equal Parts | Open ↗ |
| Three way partitioning of an array around a given value | Open ↗ |
| Threshold Majority Queries | Open ↗ |
| Throne Inheritance | Open ↗ |
| Tiling a Rectangle with the Fewest Squares | Open ↗ |
| Tiling With Dominoes | Open ↗ |
| Time Based Key-Value Store | Open ↗ |
| Time Needed to Buy Tickets | Open ↗ |
| Time Needed to Inform All Employees | Open ↗ |
| Time Needed to Rearrange a Binary String | Open ↗ |
| Timeout Cancellation | Open ↗ |
| Time Taken to Cross the Door | Open ↗ |
| Time to Cross a Bridge | Open ↗ |
| To Be Or Not To Be | Open ↗ |
| Toeplitz Matrix | Open ↗ |
| Toggle Light Bulbs | Open ↗ |
| To Lower Case | Open ↗ |
| Top K Frequent Elements | Open ↗ |
| Top K Frequent Words | Open ↗ |
| Topological sort or Kahn's algorithm | Open ↗ |
| Top Three Wineries | Open ↗ |
| Top Travellers | Open ↗ |
| Top View of a tree | Open ↗ |
| Top View of BT | Open ↗ |
| Toss Strange Coins | Open ↗ |
| Total Appeal of A String | Open ↗ |
| Total Characters in String After Transformations I | Open ↗ |
| Total Characters in String After Transformations II | Open ↗ |
| Total Cost to Hire K Workers | Open ↗ |
| Total Distance Traveled | Open ↗ |
| Total Hamming Distance | Open ↗ |
| Total no. of Spanning tree in a graph | Open ↗ |
| Total Sum of Interaction Cost in Tree Groups | Open ↗ |
| Total Waviness of Numbers in Range I | Open ↗ |
| Total Waviness of Numbers in Range II | Open ↗ |
| Tournament Tree and Binary Heap | Open ↗ |
| Tournament Winners | Open ↗ |
| Traffic Signal Color | Open ↗ |
| Transform Array by Parity | Open ↗ |
| Transform Array to All Equal Elements | Open ↗ |
| Transform Binary String Using Subsequence Sort | Open ↗ |
| Transformed Array | Open ↗ |
| Transform One String to Another using Minimum Number of Given Operation | Open ↗ |
| Transform String | Open ↗ |
| Transform to Chessboard | Open ↗ |
| Transpose File | Open ↗ |
| Transpose Matrix | Open ↗ |
| Trapping Rain Water | Open ↗ |
| Trapping Rain Water | Open ↗ |
| Trapping Rain Water II | Open ↗ |
| Trapping Rain water problem | Open ↗ |
| Travelling Salesman Problem | Open ↗ |
| Traversal in Linked List | Open ↗ |
| Traversal Techniques | Open ↗ |
| Tree Diameter | Open ↗ |
| Tree Isomorphism Problem | Open ↗ |
| Tree Node | Open ↗ |
| Tree of Coprimes | Open ↗ |
| Triangle | Open ↗ |
| Triangle Judgement | Open ↗ |
| Trie | (Delete) | Open ↗ |