I am part of a small team working on a fairly small website with user accounts; there are about 100 users at this time. And we are using Amazon Cognito for user
I have a nested, recursive JSON of arbitrary depth where a node can either be a parent of more nodes (i.e. it has a structure array containing nodes, which is t
I have the following dataframe which contains Parent child relation: data = pd.DataFrame({'Parent':['a','a','b','c','c','f','q','z','k'],
Can someone please explain how this method works? I tried adding System.out.print statements but it didn't get me anywhere and I simply cannot
Can someone please explain how this method works? I tried adding System.out.print statements but it didn't get me anywhere and I simply cannot
I have a product table: Product (ID, Version) And I am having trouble creating a recursive table named "Update". this table should have a product ID and for eac
Hei Coders, I have a string "1+1", with javascript build in function eval() i can do eval("1+1") so the return value will be 2 But how about if i want to imp
This is a very common problem in which we would have to find the longest substring which is also a palindrome substring for the given input string. Now there ar
The function should return an array containing the shortest combination of numbers that add up to exactly the target sum. If there are two (or more) possibiliti
**I am having a problem with solving the question below. Implement the sum_positive_numbers function, as a recursive function that returns the sum of all positi
My code: #include <bits/stdc++.h> using namespace std; using ll = long long; vector<ll> generate_all(map<ll, int> mp, int keys
Question: I have a React functional component that recursively renders nested lists. That part is working fine. The part that I am struggling with is getting t
is there a PHP function that would create a (deep) array key from an array ? It's quite difficult to explain, see that example: function myst
I'm looking for a way to remove object properties with negative values. Although an existing solution is provided here, it works only with no-depth objects. I'm
I am trying to understand how JavaScript merge sort function work. And I struggle understanding how the recursive function work. This is the code: const mergeSo
I am currently developing a web app which uses the Facebook Graph API. What I would like to achieve is to get all posts of a user. However, this is not that e
I've got an assignment in which I need to code a recursive function (with no loops) in python that returns: [[]] if n is 1 [[],[[]]] if n is 2 [[],[[]],[[],[[]]
I have a programming exam in a few days so I'm doing some exercises just to practice. However, I've been stuck with this problem and I started to doubt if it's
I write this code for show fibonacci series using recursion.But It not show correctly for n>43 (ex: for n=100 show:-980107325). #include<stdio.h> #in
I'm having a difficult time finding a very simple program that multiplies two 2x2 matrices recursively. Can anyone help me out? Just need to multiply X and Y wi