Search for a command to run...
Articles tagged with #data-structures
This post is part of the Algorithms Problem Solving series. Problem description This is the Running Array Sum problem. The description looks like this: Given an array nums. We define a running sum of an array as runningSum[i] = sum(nums[0]…nums[i]). ...
This post is part of the Algorithms Problem Solving series. Problem description This is the Sort the Matrix Diagonally problem. The description looks like this: Given a m * n matrix mat of integers, sort it diagonally in ascending order from the top-...
This post is part of the Algorithms Problem Solving series. Problem description This is the Odd in Matrix problem. The description looks like this: Given n and m which are the dimensions of a matrix initialized by zeros and given an array indices whe...
This post is part of the Algorithms Problem Solving series. Problem description This is the Construct Binary Search Tree from Preorder Traversal problem. The description looks like this: Return the root node of a binary search tree that matches the g...
This post is part of the Algorithms Problem Solving series. Problem description This is the Insert Into Binary Search Tree problem. The description looks like this: Given the root node of a binary search tree (BST) and a value to be inserted into the...
This post is part of the Algorithms Problem Solving series. Problem description This is the Shuffle the array problem. The description looks like this: Given the array nums consisting of 2n elements in the form [x1,x2,...,xn,y1,y2,...,yn]. Return the...
