LeetCode 257. Binary Tree Paths
Description https://leetcode.com/problems/path-crossing/ Given the root of a binary tree, return all root-to-leaf paths in any order. A leaf is a node with no children. Example 1:…
Be a Good Techer and Tech for Good. www.goodtecher.com
Description https://leetcode.com/problems/path-crossing/ Given the root of a binary tree, return all root-to-leaf paths in any order. A leaf is a node with no children. Example 1:…
Description https://leetcode.com/problems/path-crossing/ Given a string path, where path[i] = ‘N’, ‘S’, ‘E’ or ‘W’, each representing moving one unit north, south, east, or west, respectively. You start…
Description https://leetcode.com/problems/minimum-absolute-difference-in-bst/ Given the root of a Binary Search Tree (BST), return the minimum absolute difference between the values of any two different…
Description https://leetcode.com/problems/final-prices-with-a-special-discount-in-a-shop/ Given the array prices where prices[i] is the price of the ith item in a shop. There is a special discount for items in…
Description https://leetcode.com/problems/sort-array-by-parity-ii/ Given an array of integers nums, half of the integers in nums are odd, and the other half are even. Sort the array…
Description https://leetcode.com/problems/maximum-nesting-depth-of-the-parentheses/ A string is a valid parentheses string (denoted VPS) if it meets one of the following: It is an empty string “”,…
Description https://leetcode.com/problems/article-views-i/ SQL Schema Table: Views +—————+———+ | Column Name | Type | +—————+———+ | article_id | int | | author_id…
Description https://leetcode.com/problems/triangle-judgement/ SQL Schema A pupil Tim gets homework to identify whether three line segments could possibly form a triangle.However,…
Description https://leetcode.com/problems/binary-number-with-alternating-bits/ Given a positive integer, check whether it has alternating bits: namely, if two adjacent bits will always have…
Description https://leetcode.com/problems/word-pattern/ Given a pattern and a string s, find if s follows the same pattern. Here follow means a full match, such that there is a…