practical test -
1. get a sum of two numbers that represent as LinkedList, and return the sum as LinkedList (The digits stored in the LinkedList in reverse).
Example:
Input: List1: 5->6->3 // represents number 365
List2: 8->4->2 // represents number 248
Output: Resultant list: 3->1->6 // represents number 613
2.
check "sum" of 2 strings in array1, equal to one string in array2 and return an array 3 with all the strings from array2 that meet these conditions.
Example:
arr1 = ["bc", "a", "de"]
arr2 = ["dea", "abc", "edcba"]
return arr3 = ["dea", "abc"]
Theoretical test -
1. SQL questions.
2. Write a Design of vending machine that supports purchasing product ("water", "coca-cola", "soda", etc.) with Coins (that have the name of the coin and its value).
3. print a tree (in any logical order) that can have more than 2 children for every node.
4. print the same tree by levels
