Recursion
Power Set of a Set of Distinct Integers
AskAI
The problem asks us to print the power set of a given set of distinct integers. A power set is the set of all subsets of a given set, including the empty set and the original set itself. For example, the power set of {1,2,3} would be {{},{1},{2},{3},{1,2},{1,3 },{2,3},{1,2,3}}.
Recursively Summing an Array of Integers
AskAI
This problem asks you to find the sum of all the elements in an array, using recursion. That is, you need to define a function that takes in an array of integers, and returns the sum of all the integers in the array. For example, given the input [1, 2, 3, 4], your function should return 10.
"Sum of values in binary tree greater than or equal to given value"
AskAI
Given a binary tree and a value, return the sum of all values in the tree that are greater than or equal to the given value.
Return all possible subsets of a set of distinct integers.
AskAI
This problem asks us to find all possible subsets of a given set of distinct integers. For example, given the set [1,2,3], we would need to find all possible subsets: [[],[1],[2],[1,2],[3],[1,3],[2,3],[1,2,3]].
Sum of integers in a list (recursive).
AskAI
This technical problem involves finding the sum of integers in a list using recursion. An example input would be [1, 2, 3, 4], and the expected output would be 10.
Longest Path in a 2D Array
AskAI
Given a 2D array of integers, this problem aims to find the longest path of consecutive integers starting from the top left corner. The path can only move to the right or down.
Find the sum of all elements in an array.
AskAI
This technical problem involves finding the sum of all elements in an array. The input is an array of integers, and the output is the sum of all the integers in the array.
Return the first character that does not repeat in a given string.
AskAI
This technical problem involves finding the first character in a string that does not repeat. For example, given the string "aaaaabbbccc", the first character that does not repeat is " d".
