2 docs tagged with "Hash Table"

Given a binary tree, return the inorder traversal of its nodes' values.

Given four lists A, B, C, D of integer values, compute how many tuples (i, j, k, l) there are such that A[i] + B[j] + C[k] + D[l] is zero.