LeetCode 657. Robot Return to Origin
Description https://leetcode.com/problems/robot-return-to-origin/ There is a robot starting at position (0, 0), the origin, on a 2D plane. Given a sequence…
Be a Good Techer and Tech for Good. www.goodtecher.com
Description https://leetcode.com/problems/robot-return-to-origin/ There is a robot starting at position (0, 0), the origin, on a 2D plane. Given a sequence…
Description https://leetcode.com/problems/n-ary-tree-postorder-traversal/ Given an n-ary tree, return the preorder traversal of its nodes’ values. Nary-Tree input serialization is represented in their level order…
Description https://leetcode.com/problems/n-ary-tree-postorder-traversal/ Given an n-ary tree, return the postorder traversal of its nodes’ values. Nary-Tree input serialization is represented in their level order…
Description https://leetcode.com/problems/sum-of-digits-in-the-minimum-number/ Given an array A of positive integers, let S be the sum of the digits of the minimal element of A. Return 0…
Description https://leetcode.com/problems/determine-if-string-halves-are-alike/ You are given a string s of even length. Split this string into two halves of equal lengths, and let a be…
Description https://leetcode.com/problems/self-dividing-numbers/ A self-dividing number is a number that is divisible by every digit it contains. For example, 128 is a self-dividing…
Description https://leetcode.com/problems/count-negative-numbers-in-a-sorted-matrix/ Given a m x n matrix grid which is sorted in non-increasing order both row-wise and column-wise, return the number of negative numbers in grid. Example…
Description https://leetcode.com/problems/find-numbers-with-even-number-of-digits/ Given an array nums of integers, return how many of them contain an even number of digits. Example 1: Input: nums =…
Description https://leetcode.com/problems/sum-of-unique-elements/ You are given an integer array nums. The unique elements of an array are the elements that appear exactly once in…
Description https://leetcode.com/problems/deepest-leaves-sum/ Given a binary tree, return the sum of values of its deepest leaves. Example 1: Input: root =…