| Trie Implementation and Advanced Operations | Open ↗ |
| Trie | (Insert and Search) | Open ↗ |
| Trim a Binary Search Tree | Open ↗ |
| Trionic Array I | Open ↗ |
| Trionic Array II | Open ↗ |
| Triples with Bitwise AND Equal To Zero | Open ↗ |
| Triplet Family | Open ↗ |
| Triplet Sum in Array | Open ↗ |
| Trips and Users | Open ↗ |
| Truncate Sentence | Open ↗ |
| Tug of War | Open ↗ |
| Tuple with Same Product | Open ↗ |
| Tushar's Birthday Party | Open ↗ |
| Tweet Counts Per Frequency | Open ↗ |
| Twisted Mirror Path Count | Open ↗ |
| Two Best Non-Overlapping Events | Open ↗ |
| Two City Scheduling | Open ↗ |
| Two Clique Problem | Open ↗ |
| Two Furthest Houses With Different Colors | Open ↗ |
| Two-Letter Card Game | Open ↗ |
| Two Out of Three | Open ↗ |
| Two out of Three | Open ↗ |
| Two Repeated Elements | Open ↗ |
| Two Sum | Open ↗ |
| Two Sum BSTs | Open ↗ |
| Two Sum III - Data structure design | Open ↗ |
| Two Sum II - Input Array Is Sorted | Open ↗ |
| Two Sum IV - Input is a BST | Open ↗ |
| Two Sum Less Than K | Open ↗ |
| Two teams? | Open ↗ |
| Two water Jug problem | Open ↗ |
| Type of Triangle | Open ↗ |
| Ugly Number | Open ↗ |
| Ugly Number II | Open ↗ |
| Ugly Number III | Open ↗ |
| Unbounded knapsack | Open ↗ |
| Unbounded Knapsack (Repetition of items allowed) | Open ↗ |
| Uncommon Words from Two Sentences | Open ↗ |
| Uncrossed Lines | Open ↗ |
| Union-Find | Open ↗ |
| Union of two arrays | Open ↗ |
| Union of Two Linked Lists | Open ↗ |
| Union of Two Sorted Arrays | Open ↗ |
| Union of two sorted arrays | Open ↗ |
| Unique 3-Digit Even Numbers | Open ↗ |
| Unique Binary Search Trees | Open ↗ |
| Unique Binary Search Trees II | Open ↗ |
| Unique BST's | Open ↗ |
| Unique Email Addresses | Open ↗ |
| Unique Length-3 Palindromic Subsequences | Open ↗ |
| Unique Middle Element | Open ↗ |
| Unique Morse Code Words | Open ↗ |
| Unique Number of Occurrences | Open ↗ |
| Unique Paths | Open ↗ |
| Unique Paths II | Open ↗ |
| Unique Paths III | Open ↗ |
| Unique Subsets | Open ↗ |
| Unique Substrings in Wraparound String | Open ↗ |
| Unique Substrings With Equal Digit Frequency | Open ↗ |
| Unique Word Abbreviation | Open ↗ |
| Unit Area of largest region of 1's | Open ↗ |
| Unit Conversion I | Open ↗ |
| Unit Conversion II | Open ↗ |
| Univalued Binary Tree | Open ↗ |
| Unpopular Books | Open ↗ |
| Upper Bound | Open ↗ |
| Url | Open ↗ |
| User Activity for the Past 30 Days I | Open ↗ |
| User Activity for the Past 30 Days II | Open ↗ |
| User Purchase Platform | Open ↗ |
| Users With Two Purchases Within Seven Days | Open ↗ |
| Using a Robot to Print the Lexicographically Smallest String | Open ↗ |
| UTF-8 Validation | Open ↗ |
| Valentine Sum | Open ↗ |
| Valid Anagram | Open ↗ |
| Valid Arrangement of Pairs | Open ↗ |
| Validate Binary Search Tree | Open ↗ |
| Validate Binary Tree Nodes | Open ↗ |
| Validate IP Address | Open ↗ |
| Validate Stack Sequences | Open ↗ |
| Valid Boomerang | Open ↗ |
| Valid BST from Preorder | Open ↗ |
| Valid Compressed String | Open ↗ |
| Valid Expression | Open ↗ |
| Valid Ip Addresses | Open ↗ |
| Valid Mountain Array | Open ↗ |
| Valid Number | Open ↗ |
| Valid Palindrome | Open ↗ |
| Valid Palindrome II | Open ↗ |
| Valid Palindrome III | Open ↗ |
| Valid Palindrome IV | Open ↗ |
| Valid Parentheses | Open ↗ |
| Valid Parenthesis String | Open ↗ |
| Valid Perfect Square | Open ↗ |
| Valid Phone Numbers | Open ↗ |
| Valid Square | Open ↗ |
| Valid Subarrays With Matching Sum Digits I | Open ↗ |
| Valid Sudoku | Open ↗ |
| Valid Tic-Tac-Toe State | Open ↗ |
| Valid Triangle Number | Open ↗ |