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 3 outputs correctly.
| 1 | struct Node { |
| 2 | int val; |
| 3 | Node* next; |
| 4 | }; |
| 5 | |
| 6 | Node* build(const vector<int>& values) { |
| 7 | |
| 8 | Node stub{0, nullptr}; |
| 9 | Node* tail = &stub; |
| 10 | |
| 11 | for (int v : values) { |
| 12 | tail->next = new Node{v, nullptr}; |
| 13 | tail = tail->next; |
| 14 | } |
| 15 | |
| 16 | return stub.next; |
| 17 | } |
| 18 | |
| 19 | vector<int> spill(Node* head) { |
| 20 | |
| 21 | vector<int> out; |
| 22 | |
| 23 | for (Node* p = head; p; p = p->next) { |
| 24 | out.push_back(p->val); |
| 25 | } |
| 26 | |
| 27 | return out; |
| 28 | } |
| 29 | |
| 30 | Node* flipGroups(Node* head, int k) { |
| 31 | |
| 32 | Node* scout = head; |
| 33 | |
| 34 | for (int i = 0; i < k; i++) { |
| 35 | |
| 36 | if (!scout) { |
| 37 | return head; |
| 38 | } |
| 39 | |
| 40 | scout = scout->next; |
| 41 | } |
| 42 | |
| 43 | Node* prev = flipGroups(scout, k); |
| 44 | Node* curr = head; |
| 45 | |
| 46 | for (int i = 0; i < k; i++) { |
| 47 | |
| 48 | Node* next = curr->next; |
| 49 | |
| 50 | curr->next = prev; |
| 51 | prev = curr; |
| 52 | curr = next; |
| 53 | } |
| 54 | |
| 55 | return prev; |
| 56 | } |
| 57 | |
| 58 | vector<int> solution(const vector<int>& values, int k) { |
| 59 | |
| 60 | Node* head = build(values); |
| 61 | |
| 62 | return spill(flipGroups(head, k)); |
| 63 | } |
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.