92 93 94 95 96 97 98 Ford 3.0L 12V V6 Vulcan Car 183 Tucson Mall -EN Mercury

Check children-sum property in a binary tree

Given the root of a binary tree, determine if the binary tree holds children-sum property. For a tree to satisfy the children-sum property, each node’s value should be equal to the sum of values at its left and right subtree.

Shrink an array by removing triplets that satisfy given constraints

Array, Pet Dogs Puppy Poop Waste Bag Dispenser Clip Garbage Bag Holder Hard

Given an integer array, shrink it by removing adjacent triplets that satisfy the given constraints and return the total number of elements in the resultant array.

Blower Motor Front Fits 03-14 ESCALADE 2481449-1

BST Easy

Given a BST, count the total number of nodes that lie within a given range.

Check whether a directed graph is Eulerian

Unbranded Ceramic Slip Tag Mold Christmas Santa Face A-219 Open Medium

An Eulerian trail (or Eulerian path) is a path in a graph that visits every edge exactly once. Given a directed graph, check whether it has an Eulerian path or not.

Find the minimum number of merge operations to make an array palindrome

Array Medium

Given a list of non-negative integers, find the minimum number of merge operations to make it a palindrome. A merge operation can only be performed on two adjacent elements and replace them with their sum.

Aluminum Radiator + Red Coolant Hose fit Honda CRF450R CRF450 R

Binary Tree, Linked List, Dorman: 601-046 - Keyless Entry Keypad Easy

Given a linked list, construct a complete binary tree from it. Assume that the order of elements present in the linked list is the same as that in the complete tree’s array representation.

Find read-write conflicts among given database transactions

Array, Sorting Medium

Given a list of database transactions, find all read-write conflicts among them. Assume that there is no strict two-phase locking (Strict 2PL) protocol to prevent read-write conflicts.

Postal History Yugoslavia FDC #1316-1321 SET OF 3 Art paintings

Binary Tree Easy

Given a binary tree, check if removing an edge can split it into two binary trees of equal size.

In-place merge two height-balanced BSTs

BST, Linked List Hard

Given two height-balanced binary search trees, in-place merge them into a single balanced binary search tree. For each node of a height-balanced tree, the difference between its left and right subtree height is at most 1.

Find height of a binary tree represented by the parent array

Array, Binary Tree, Reebok Print T-Shirt Short Sleeve Grey Fluorescence Thrift 8414 Medium

Given an array representing the parent-child relationship in a binary tree, find the tree’s height without building it. The parent-child relationship is defined by (A[i], i) for every index i in array A.

HARD YAKKA HIGH VISIBILITY LARGE JUMPER! NEW WITH TAGS STYLE Y19

Binary Tree Medium

Given a binary tree and two tree pointers, x and y, write an efficient algorithm to check if they lie on the same root-to-leaf path in the binary tree. In other words, determine whether x is an ancestor of y, or x is a descendant of y.

Willmar Schwabe India Asclepias Tuberosa Dilution 6 CH, 30 CH, 2

Array, BST Easy

Given an array representing the preorder traversal of a BST, determine whether it represents a skewed BST or not. In a skewed BST, each node’s descendants are either smaller or larger than the node itself.

92 93 94 95 96 97 98 Ford Mercury Car 183 3.0L V6 12V Vulcan -EN

92 93 94 95 96 97 98 Ford Mercury Car 183 3.0L V6 12V Vulcan -EN

Item specifics

92 93 94 95 96 97 98 Ford Mercury Car 183 3.0L V6 12V Vulcan -EN