Hanxiong94. Binary Tree Inorder TraversalGiven the root of a binary tree, return the inorder traversal of its nodes' values.Nov 12, 2023Nov 12, 2023
Hanxiong876. Middle of the Linked ListGiven the head of a singly linked list, return the middle node of the linked list.Nov 12, 2023Nov 12, 2023
Hanxiong2667. Create Hello World FunctionWrite a function createHelloWorld. It should return a new function that always returns "Hello World".Nov 11, 2023Nov 11, 2023
Hanxiong1512. Number of Good PairsGiven an array of integers nums, return the number of good pairs.Nov 11, 2023Nov 11, 2023
Hanxiong1480. Running Sum of 1d ArrayGiven an array nums. We define a running sum of an array as runningSum[i] = sum(nums[0]…nums[i]).Feb 15, 2023Feb 15, 2023
Hanxiong1513. Number of Substrings With Only 1sGiven a binary string s, return the number of substrings with all characters 1's. Since the answer may be too large, return it modulo 10^9…Jul 26, 2022Jul 26, 2022
Hanxiong1365. How Many Numbers Are Smaller Than the Current NumberGiven the array nums, for each nums[i] find out how many numbers in the array are smaller than it. That is, for each nums[i] you have to…Jul 15, 2022Jul 15, 2022
Hanxiong452. Minimum Number of Arrows to Burst BalloonsThere are some spherical balloons taped onto a flat wall that represents the XY-plane. The balloons are represented as a 2D integer array…Jul 11, 2022Jul 11, 2022
Hanxiong781. Rabbits in ForestThere is a forest with an unknown number of rabbits. We asked n rabbits “How many rabbits have the same color as you?” and collected the…Jul 11, 2022Jul 11, 2022