Currently, I was able to get the following function to retreive the max value from an array through recursion const max = ([a,...rest]) => !rest.length || a
I have to write a code that makes use of recursion to sum numbers in a list up until the index is equal to a pre-determined integer value. i.e. list = [1,4,8,
How can I make this code a recursive method? for (int i = 3; i < arr.length; i++) { writer.write(arr[i] + "\n"); strout += arr[i] + "\n"; }
Recursive functions are not my forté, and im pretty sure thats what is needed here. I have a nested json object, which represents a nested checklist It i
Can someone explain the syntax process? How line 5 will be implemented and what is the sequence for these three elements and what is the value each time in the
I want to subtract the values of two objects of the exact same structure. Although one answer exists here, it's limited to objects of no-depth. In my case, I'm
I need to write a recursive method that takes an int as input and returns the longest sequence of identical numbers in it as an int (NOT as a string). counting
I'm learning the recursion concept in js, I got a very basic question of the base code returning problem. function factorial(n) { if (n === 1) { ret
I am solving a problem: Given a list of integers nums, write a function that returns the largest sum of non-adjacent numbers. Numbers can be 0 or negative. Fo
I am preparing a tutorial to solve the generating parentheses problem. (LeetCode #22) LeetCode mentions three different solutions but the third one looks confus
I am trying to get this implementation to work, tho it ends in an infinite loop. What am I missing? def bubbleSort(l: List[Int]): List[Int] = if(isSorted(l)) l
There are similar answers here but all of the ones I've seen and tested don't go pass two levels deep, so I don't think this is a duplicate problem...I am tryin
The algorithm is for calculating 2^n recursively. I have used the Master theorem to determine that the time complexity is indeed O(log n) which seems to correct
Me and my friend have been working on a problem for school. We are traversing a graph with DFS and are counting the number of nodes in each given component. We
This is a game function from pygame. If user press left (pygame.KEYDOWN.K_LEFT), angle -= 1. Else if user press right (pygame.KEYDOWN.K_RIGHT), angle += 1. 'Eve
I'm using treeview to display my hierarchical data. I have following array of objects: const data = [ { id: 1, hierarchyid: "/", level: 0, name: "Mhz" },
I have a php recursive function as shown in the below: function displayDropdown(&$catList, $parent, $current=[], $level=0) { if ($parent==0) { foreac
I got stuck with my binary search method and I don't really know what I'm doing. At this moment I got 1 Error (CS0161) not all code paths return a value int l
I am trying to understand the recursive call within the binary function is_bst. The goal of the function is to check if a tree is a binary search tree or not. N
I am practising recursion and am not sure why my code is failing. def isEqual(arr, n): if(n==1): return arr[n] return arr[n-1]==isEqual(arr, n-1