@kenbitanga

def hanoi(disks, src, temp, dest): if disks < 1: return hanoi(disks - 1, src, dest, temp) print(f'move disk from {src} to {dest}') hanoi(disks - 1, temp, src, dest) for i in range(4): print(f'using {i} {"d

def bsearch(arr, x): min = 0 max = len(arr) - 1 while max >= min: mid = (min + max) // 2 if x == arr[mid]: return mid

def bsearch(arr, x): def recurse(min, max): if min > max: return None mid = (min + max) // 2 if x == arr[mid]: return mid

const promise = new Promise((resolve, reject) =>{ if (true) { resolve('Success'); } resolve('Error'); }); const log = (e) => console.log(e); promise

var memo = hashMapOf<Int, Int>(); fun fib(n: Int): Int { if (memo.containsKey(n)) { return memo[n]!! } var result: Int

fun fib(n: Int): Int { var memo = hashMapOf<Int, Int>(); var result = 0 for (i in 1..n) { if (memo.containsKey(i)) { return memo[i]!! } if (i <= 2) {

const memo = {}; function fib(n) { if (n in memo) { return memo[n]; } if (n <= 2) { result = 1; } else {

function fibo(n) { if (n <= 2) { return 1; } return fib(n - 1) + fib(n - 2); } function memoize(func) { const memo = {}; return function (n) {

def memoize(func): memo = {} def wrapper(n): if n in memo: return memo[n] memo[n] = func(n) return memo[n] return wrapper @memoize

using System; using System.Collections.Generic; namespace MyCompiler { class Program { private static int Fib(int n) { var memo = new Dictionary<int, int>(); var result = 0; for (int i = 1; i <= n; i

import java.util.HashMap; class Main { private static int fib(int n) { HashMap<Integer, Integer> memo = new HashMap<>(); int result = 0; for (int i = 0; i <= n; i++) { if (memo.containsKey(i)) {

import java.util.Arrays; import java.util.List; import java.util.stream.Collectors; class Main { public static void main(String[] args) { List<Integer> list = Arrays.asList(1, 2, 3, 4, 5, 6, 7, 8, 9, 10); List<

#include <iostream> #include <unordered_map> std::unordered_map<int, int> memo {}; int fib(int n) { if (memo.count(n) == 1) { return memo[n]; }

#include <iostream> #include <unordered_map> int fib(int n) { std::unordered_map<int, int> memo {}; if (memo.count(n) == 1) { return memo[n]; }

package main import "fmt" var memo = make(map[int]int) func fib(n int) int { if _, ok := memo[n]; ok { return memo[n] }

package main import "fmt" func fib(n int) int { memo := make(map[int]int) var result int for i := 1; i <= n; i++ { if i <= 2 {

def fib(n): if n < 0: return if n < 1: return 0 memo = {} for i in range(1, n + 1): if i <= 2: memo[i] = 1

memo = {} def fib(n): if n < 1: return 0 if n < 3: return 1 if n not in memo: memo[n] = fib(n - 1) + fib(n - 2) return memo[n] for i in range(10):

#include <iostream> #include <vector> void swap(std::vector<int>& array, int i, int j) { int temp = array[i]; array[i] = array[j]; array[j] = temp; } int index_of_min(const std::vector<int>& array, int start_index) { int min_value =

package main import "fmt" func swap(array []int, i int, j int) { temp := array[i] array[i] = array[j] array[j] = temp } func indexOfMin(array []int, startIndex int) int {