Agentic AI: Create MCP Client

Agentic AI: Create MCP Server

0001: Two Sum

0002: Add Two Numbers

0003: Longest Substring Without Repeating Characters

0004: Median of Two Sorted Arrays

0005: Longest Palindromic Substring

0006: Zigzag Conversion

0007: Reverse Integer

0008: String to Integer (atoi)

0009: Palindrome Number

0010: Regular Expression Matching

0011: Container With Most Water

0012: Integer to Roman

0013: Roman to Integer

0014: Longest Common Prefix

0015: 3Sum

0016: 3Sum Closest

0017: Letter Combinations of a Phone Number

0018: 4Sum

0019: Remove Nth Node From End of List

0020: Valid Parentheses

0021: Merge Two Sorted Lists

0022: Generate Parenthesis

0023: Merge k Sorted Lists

0024: Swap Nodes in Pairs

0025: Reverse Nodes in k-Group

0026: Remove Duplicates from Sorted Array

0027: Remove Element

0028: Find the Index of the First Occurrence in a String

0029: Divide Two Integers

0030: Substring with Concatenation of All Words

0033: Search in Rotated Sorted Array

0048: Rotate Image

0049: Group Anagrams

0053: Maximum Subarray

0054: Spiral Matrix

0055: Jump Game

0056: Merge Intervals

0057: Insert Interval

0062: Unique Paths

0070: Climbing Stairs

0073: Set Matrix Zeroes

0076: Minimum Window Substring

0091: Decode Ways

0098: Validate Binary Search Tree

0100: Same Tree

0102: Binary Tree Level Order Traversal

0104: Maximum Depth of Binary Tree

0105: Construct Binary Tree from Preorder and Inorder Traversal

0121: Best Time to Buy and Sell Stock

0124: Binary Tree Maximum Path Sum

0125: Valid Palindrome

0128: Longest Consecutive Sequence

0133: Clone Graph

0139: Word Break

0141: Linked List Cycle

0143: Reorder List

0152: Maximum Product Subarray

0153: Find Minimum in Rotated Sorted Array

0190: Reverse Bits

0191: Number of 1 Bits

0198: House Robber

0200: Number of Islands

0206: Reverse Linked List

0207: Course Schedule

0208: Implement Trie (Prefix Tree)

0211: Design Add and Search Words Data Structure

0212: Word Search II

0213: House Robber II

0217: Contains Duplicate

0226: Invert Binary Tree

0230: Kth Smallest Element in a BST

0235: Lowest Common Ancestor of a Binary Search Tree

0238: Product of Array Except Self

0242: Valid Anagram

0252: Meeting Rooms

0253: Meeting Rooms II

0261: Graph Valid Tree

0268: Missing Number

0269: Alien Dictionary

0271: Encode and Decode Strings

0295: Find Median from Data Stream

0297: Serialize and Deserialize Binary Tree

0300: Longest Increasing Subsequence

0322: Coin Change

0323: Number of Connected Components in an Undirected Graph

0338: Counting Bits

0347: Top K Frequent Elements

0371: Sum of Two Integers

0377: Combination Sum IV

0417: Pacific Atlantic Water Flow

0424: Longest Repeating Character Replacement

0435: Non-overlapping Intervals

0572: Subtree of Another Tree

0647: Palindromic Substrings

1143: Longest Common Subsequence

Blind 75