Traverse the tree in natural order and test if each node is between the previous and the next node. Properly detect duplicate values. If a wrong sub-tree is encountered immediately stop the script and indicate the error.
See code below
Standard problem of trying to maximize the values of item with a constraint. How many items can you put in a knapsack given the value and the weight of the items.
Uses python3
goal: maximize the value of items selected from the get_optimal_value
while the items selected combined weight is less than the inputted capacity
Binary Search Problem
Function below handles a simple search for a needle in a haystack using the binary search algorithm.
The function is called recursively to check if a value is inside the array
See python code below.
Function to take a vector of length n and multiply the two largest values in the vector.
See the code below
Powered by WordPress & Theme by Anders Norén