Skip to main content
4 votes
2 answers
122 views

I keep almost solving this. I've got a data set of python dictionaries that contain both lists and dictionaries that also contain lists and dictionaries. I want to find all instances of a substring in ...
pileofrogs's user avatar
-3 votes
0 answers
85 views

public static boolean isWordSymmetric(String[] words, int start, int end){ if (words[start].toLowerCase().equals(words[end - start].toLowerCase())) { if (start == end){ ...
Bry's user avatar
  • 1
3 votes
2 answers
156 views

I do understand I have mistakes in this code #include <stdio.h> #include <stdlib.h> #include <string.h> int diziyi_yazdır(int dizi[], int dizi_uzunluğu) { for (int i ...
Creedance's user avatar
-2 votes
1 answer
175 views

I’m trying to implement an in-place Quick Sort in Python. I have two slightly different versions of my partitioning logic, and I’m confused because both seem correct on small arrays, but the second ...
Lisguen's user avatar
  • 11
2 votes
1 answer
115 views

At the risk of asking a question with an obvious solution: if I have a function in J that takes two arguments and returns two arguments and I want to accumulate the answer's second argument and to use ...
Shmuel Greenberger's user avatar
3 votes
3 answers
85 views

I am working on LeetCode problem 22. Generate Parentheses using a recursive backtracking approach in Python. The function works, but I’m having trouble understanding the flow of recursion, ...
Caleb's user avatar
  • 31
1 vote
2 answers
151 views

My question is focused specifically on assembly (intel). In C for example, recursion can be done with a simple return command but in assembly I feel like there's a lot more things going on, especially ...
Danilo Jonić's user avatar
0 votes
1 answer
87 views

this is kind of a continuation of an improved version of an old question of mine so basically I have a recursive Angular form and I’m using to manage a folder hierarchy. Each folder has a radio button ...
binga58's user avatar
  • 89
1 vote
2 answers
146 views

Let's say our binary tree (bt) looks like this: Node* root = new Node(); root->left = new Node("B"); root->right = new Node(); root->right->right = new Node("A");...
Arun Saini's user avatar
-1 votes
2 answers
165 views

# Iterative factorial function to safely compute very large factorials without hitting Python's recursion limit. # Recursive functions have a maximum depth, usually 1000, and factorial(2000) would ...
user31537598's user avatar
2 votes
1 answer
104 views

I have a recursively defined function my_func that is jitted using jax.jit from the jax library. It is defined below: # Imports import jax import jax.numpy as jnp from functools import partial import ...
Ben's user avatar
  • 539
0 votes
1 answer
67 views

When using this algorithm: jq -s 'def deepmerge(a;b): reduce b[] as $item (a; reduce ($item | keys_unsorted[]) as $key (.; $item[$key] as $val | ($val | ...
staxas's user avatar
  • 149
0 votes
1 answer
34 views

I'm trying to render a tree structure using VLT, by indenting the rendering depending on the level it's on. I tried to use a recursive macro which passes on the $indentLevel variable (see code below). ...
Sebastiaan Voorderhake's user avatar
1 vote
2 answers
91 views

I am trying to convert an XML string into multi-dimensioned PHP array. The difficulties are that XML comes with attributes and has nested values. My code works at parent level data but I am not sure ...
user5705009's user avatar
0 votes
0 answers
157 views

Background I am on an ARM Cortex-A72. To access bit fields of my core's system registers I use a macro code generation mechanism. For the sake of simplicity, I replaced void operator=(const uint64_t v)...
salkin's user avatar
  • 177

15 30 50 per page
1
2 3 4 5
3163