Freaks City

To compute the sum of all left leaf nodes in a binary tree, implement a recursive traversal that identifies nodes where the left child exists and has no children. When such a node is found, accuumlate its value. A helper function using reference accumulation: void accumulateLeftLeafSum(TreeNode* root, int& total) { if (!root) return; ...

1. Gymnastic Team Formation Given the small input constraints, a brute-force approach with backtracking and pruning is suitable. The solution uses depth-first search (DFS) to explore valid permutations while eliminating invalid paths early. #include <iostream> using namespace std; int constraints[11] = {0}; bool used[11] = {false}; int v ...

Problem 1: Optimized Dynamic Programming with Prefix Sums This problem involves a basic dynamic programming approach where we process from the end to the beginning. The naive solution has a time complexity of O(n²), but we can optimize it using prefix sums and binary search. We maintain a prefix sum array and for each position, use binary searc ...

Maximum Depth of a Binary Tree Given a binary tree, determine its maximum depth - the number of nodes along the longest path from the root node to the farthest leaf node. Recursive Approach Using postorder traversal (left-right-root) to calculate node height: struct TreeNode { int val; TreeNode* left; TreeNode* right; TreeNode(i ...

House Robber I The classic house robber problem involves selecting houses to rob such that adjacent houses cannot both be robbed, maximizing total profit. For each house, there are two choices: rob it or skip it. The decision at each position aims to maximize accumulated wealth. State Defniition: wealth[i] represents the maximum money obtainabl ...

Binary Search Trees A. Binary Search Tree Implementation Problem Analysis The key consideration in this problem is that the input may contain duplicate elements, but these duplicates should not appear in the output binary tree traversal sequences. This detail is not explicit mentioned in the problem statement. Code Implementation #include < ...

Given the input string abcdefghij, construct a binary tree by inserting characters level by level — that is, fill nodes row-wise from left to right. The resulting tree must yield the following traversal outputs: In-order: hdibjeafcg Post-order: hidjebfgca Level-order: abcdefghij The construction follows breadth-first insertion: the first char ...

The objective is to compute the diameter of a given binary tree. In this context, the diameter is defined as the length of the longest path between any two nodes within the structure. This path does not necessarily need to pass through the root node. The length of a path is quantified by the number of edges connecting the nodes. Algorithmic Str ...

Problem A: Interval Completion Timing The task involves determining the exact timestamp when a cumulative workload finishes with in a timeline defined by alternating active and inactive periods. First, compute the total required duration. If no intervals are provided or the total duration exceeds the final boundary, the task is impossible. Othe ...

Preorder Traversal Implementation Implementing preorder traversal for LeetCode requires attention to specific interface requirmeents. The function signature expects dynamically allocated memory for the result array and a pointer to track the number of elements. int getNodeCount(struct TreeNode* node) { if (node == NULL) { return 0; ...