Category: algorithms

Given a collection of distinct numbers, return all possible permutations. For example, have the following permutations: , , , , , and . Recursive Permutation Algorithm At position 1, …

Given a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by level). For example: 3 / \ 9 20 / …

Find the least number of perfect square numbers (1, 4, 9, 16, 25 …) which sum to the given integer n. For example, given n = 5, return 2 …

Given a singly linked list, determine if it is a palindrome. A palindrome is a string/number that mirrors itself, for example, 21312 reverse is also 21312. We are given …

Rotate an array of n elements to the right by k steps. For example, with n = 7 and k = 3, the array is rotated to . Pop …