LeetCode-Solutions | : green_heart : My own LeetCode solutions | Dataset library

LeetCode-Solutions is a Python library typically used in Artificial Intelligence, Dataset, Example Codes applications. LeetCode-Solutions has no bugs, it has no vulnerabilities, it has a Permissive License and it has low support. However LeetCode-Solutions build file is not available. You can download it from GitLab, GitHub.

Letter Combinations of a Phone Number. Find First and Last Position of Element in Sorted Array. Unique Binary Search Trees II. Validate Binary Search Tree. Binary Tree Level Order Traversal. Binary Tree Zigzag Level Order Traversal 二叉树的锯齿形层序遍历. Construct Binary Tree from Preorder and Inorder Traversal. Construct Binary Tree from Inorder and Postorder Traversal. Minimum Depth of Binary Tree. Flatten Binary Tree to Linked List二叉树展开为链表. Populating Next Right Pointers in Each Node填充每个节点的下一个右侧节点指针. Best Time to Buy and Sell Stock. Best Time to Buy and Sell Stock II. Best Time to Buy and Sell Stock III. Sum Root to Leaf Numbers求根到叶子节点数字之和. Binary Tree Preorder Traversal二叉树的前序遍历. Binary Tree Postorder Traversal二叉树的后序遍历. Find Minimum in Rotated Sorted Array. Two Sum II - Input array is sorted. Best Time to Buy and Sell Stock IV. Kth Largest Element in an Array. Count Complete Tree Nodes完全二叉树的节点个数. Implement Stack using Queues. Kth Smallest Element in a BST二叉搜索树中第K小的元素. Lowest Common Ancestor of a Binary Search Tree二叉搜索树的最近公共祖先. Lowest Common Ancestor of a Binary Tree 二叉树的最近公共祖先. Search a 2D Matrix II. Different Ways to Add Parentheses. Best Time to Buy and Sell Stock with Cooldown. Reverse Vowels of a String. Top K Frequent Elements. Water and Jug Problem. Queue Reconstruction by Height. Pacific Atlantic Water Flow. N-ary Tree Level Order Traversal N 叉树的层序遍历. Delete Node in a BST. Sort Characters By Frequency. Minimum Number of Arrows to Burst Balloons. Most Frequent Subtree Sum出现次数最多的子树元素和. Find Bottom Left Tree Value找树左下角的值. Find Largest Value in Each Tree Row在每个树行中找最大值. Longest Word in Dictionary through Deleting. Minimum Absolute Difference in BST二叉搜索树的最小绝对差. Convert BST to Greater Tree把二叉搜索树转换为累加树. Single Element in a Sorted Array. Diameter of Binary Tree. Maximum Depth of N-ary Tree N 叉树的最大深度. N-ary Tree Preorder Traversal N叉树的前序遍历. N-ary Tree Postorder Traversal N叉树的后序遍历. Construct String from Binary Tree 根据二叉树创建字符串. Add One Row to Tree 在二叉树中增加一行. Sum of Square Numbers. Find Duplicate Subtrees 寻找重复的子树. Two Sum IV - Input is a BST 两数之和 IV - 输入 BST. Print Binary Tree 输出二叉树. Maximum Width of Binary Tree 二叉树最大宽度. Trim a Binary Search Tree 修剪二叉搜索树. Second Minimum Node In a Binary Tree 二叉树中第二小的节点. Max Area of Island. Search in a Binary Search Tree. Insert into a Binary Search Tree. Best Time to Buy and Sell Stock with Transaction Fee. Find Smallest Letter Greater Than Target. Minimum Distance Between BST Nodes二叉搜索树节点最小距离. Middle of the Linked List. Surface Area of 3D Shapes. X of a Kind in a Deck of Cards. Partition Array Into Three Parts With Equal Sum. Binary Search Tree to Greater Sum Tree把二叉搜索树转换为累加树. Greatest Common Divisor of Strings. Shortest Path in Binary Matrix. Distribute Candies to People. Find Words That Can Be Formed by Characters. Number of Substrings Containing All Three Characters. Number of Days Between Two Dates. How Many Numbers Are Smaller Than the Current Number. Rank Teams by Votes. Linked List in Binary Tree. Longest ZigZag Path in a Binary Tree. Generate a String With Characters That Have Odd Counts. Time Needed to Inform All Employees. Lucky Numbers in a Matrix. Design a Stack With Increment Operation. Balance a Binary Search Tree. Find the Distance Value Between Two Arrays. Sort Integers by The Power Value. Create Target Array in the Given Order. Find Lucky Integer in an Array. Count Number of Teams. String Matching in an Array. Queries on a Permutation With Key. HTML Entity Parser HTML. 面试题 57 - II.