Binary tree preorder traversal in JavaScript
0 Problem Given the root of a binary tree, return the preorder traversal of its nodes’ values. Example 1: Input: root = [1,null,2,3] Output: [1,2,3] Solution
Binary tree in order traversal in JavaScriptc
0 Problem Given the root of a binary tree, return the inorder traversal of its nodes’ values. Example 1: Input: root = [1,null,2,3] Output: [1,3,2] Solution
Find running sum of an array in JavaScript
0 Problem Given an array nums. We define a running sum of an array as runningSum[i] = sum(nums[0]…nums[i]). Return the running sum of nums. Solution
Find pivot index of an array in JavaScript
0 Problem statement Given an array of integers nums, calculate the pivot index of this array. The pivot index is the index where the sum of all the numbers strictly to the left of the index is equal to the sum of all the numbers strictly to the index’s right. If the index is on the left edge of the array, then the left … Read more
What is freelancing?
1 As oxford dictionary says, “a freelancer is a self-employed and hired to work for different companies on particular assignments.”. Quora says “Freelancing is a type of employment in which the worker is not employed by an organization but rather works for multiple employers. This means that freelancers work for different companies and are paid … Read more