Type an input and write what you think is the output . Each problem is converted to Web Assembly, so any possible input will show the corresponding output. Only correct predictions count.
Locked until you have predicted 4 outputs correctly.
| 1 | struct Node { |
| 2 | int val; |
| 3 | Node* left; |
| 4 | Node* right; |
| 5 | }; |
| 6 | |
| 7 | Node* build(const vector<optional<int>>& level) { |
| 8 | |
| 9 | if (level.empty() || !level[0]) { |
| 10 | return nullptr; |
| 11 | } |
| 12 | |
| 13 | Node* root = new Node{*level[0], nullptr, nullptr}; |
| 14 | |
| 15 | queue<Node*> q; |
| 16 | q.push(root); |
| 17 | |
| 18 | int i = 1; |
| 19 | int n = level.size(); |
| 20 | |
| 21 | while (!q.empty() && i < n) { |
| 22 | |
| 23 | Node* node = q.front(); |
| 24 | q.pop(); |
| 25 | |
| 26 | if (level[i]) { |
| 27 | node->left = new Node{*level[i], nullptr, nullptr}; |
| 28 | q.push(node->left); |
| 29 | } |
| 30 | |
| 31 | i++; |
| 32 | |
| 33 | if (i < n && level[i]) { |
| 34 | node->right = new Node{*level[i], nullptr, nullptr}; |
| 35 | q.push(node->right); |
| 36 | } |
| 37 | |
| 38 | i++; |
| 39 | } |
| 40 | |
| 41 | return root; |
| 42 | } |
| 43 | |
| 44 | int gain(Node* node, int& best) { |
| 45 | |
| 46 | if (!node) { |
| 47 | return 0; |
| 48 | } |
| 49 | |
| 50 | int left = max(gain(node->left, best), 0); |
| 51 | int right = max(gain(node->right, best), 0); |
| 52 | |
| 53 | int through = node->val + left + right; |
| 54 | best = max(best, through); |
| 55 | |
| 56 | return node->val + max(left, right); |
| 57 | } |
| 58 | |
| 59 | int solution(const vector<optional<int>>& level) { |
| 60 | |
| 61 | Node* root = build(level); |
| 62 | int ans = INT_MIN; |
| 63 | |
| 64 | gain(root, ans); |
| 65 | |
| 66 | if (ans == INT_MIN) { |
| 67 | return 0; |
| 68 | } |
| 69 | |
| 70 | return ans; |
| 71 | } |
Names have been stripped. The signature is the only clue you get for free. Compiled as C++20 with the standard headers and using namespace std; already in scope.