Carview!

1 vote

1 answer

149 views

Efficient way to check digits in a number

This is an interview question. Given 3 array lists holding non negative integers, pick a number from each list and find the sum, check if the sum holds only digits 5 and 8 Here is my code: Example: ...

CodeCrusader

758

asked yesterday

-4 votes

0 answers

140 views

Dijkstra's algorithm with speed boost cells [closed]

Trying to solve problem Ace Race in codeforces Given a racetrack with N nodes starting from 1 to N For a normal node, x, it is possible to move to x - 1 or x + 1 in 2 seconds (for x = 1 then only x = ...

Sherif Emad

29

asked 2 days ago

-5 votes

0 answers

43 views

What matching algorithm generates attacker–defender pairs in RL game event logs? [closed]

Context Domain: RL (Reinforcement Learning) tactical multiplayer game, custom protocol Server/Engine: Proprietary RL tactical event protocol server Date: July 2025 Protocol Design: For each event, the ...

Rayan Humane

1

asked Jul 23 at 3:19

-3 votes

0 answers

70 views

Python recursion prints all elements repeatedly instead of printing each elements on the new line called by the function [closed]

I'm trying to write a recursive function that prints all the elements from the list but the output is not what I expected. It first prints the numbers infinity (1)... and then crashes. So what am I ...

DudeLikeProgramming

7

asked Jul 21 at 22:25

1 vote

0 answers

48 views

What are fast GPU algorithms for sequential bin packing? [closed]

I have a sequence of bags in a row, each with a different size up to 256. I would like to pack these bags into bins of size 256. For example, the bags might be 124, 12, 45, 63, 150, 72, 230. I'd like ...

dangerChihuahua007

21k

asked Jul 19 at 17:45

-2 votes

4 answers

129 views

How can I optimize the time complexity of my brute-force solution for finding all unique triplets with sum zero?

I'm solving the "3Sum" problem where I need to find all unique triplets in an array that sum to zero. Here’s my brute-force Java code: public List<List<Integer>> threeSum(int[] ...

Ghanshyam dubey

17

asked Jul 18 at 12:51

-2 votes

3 answers

199 views

LeetCode - 23. Merge k Sorted Lists algo issue

I was trying to solve this LeetCode Problem, and have been failing at it. The problem You are given an array of k linked-lists lists, each linked-list is sorted in ascending order. Merge all the ...

Rajesh

25k

asked Jul 18 at 7:36

-3 votes

0 answers

95 views

matching pair with constraint [closed]

I have the following question that I have been asked in my interview. I gave a simple solution (see below) but apparently that was not correct. I have been told that there is a greedy solution for ...

Nazgol

173

asked Jul 17 at 20:37

0 votes

2 answers

170 views

How can I optimize a Python loop that counts maximum frequency of elements? [closed]

I'm working on a Python function to find the most frequent element in a list and handle ties in a specific way. a = [1, 2, 2, 3, 3, 3, 4] s = 0 count = 1 for i in set(a): if a.count(i) == s: ...

Mosa Siva Mani

27

asked Jul 17 at 14:36

-2 votes

0 answers

34 views

Puzzle swap system alghorithm [closed]

I make a swap system puzzles. So, I have a gid (n x n). So, lets take 3 x 3. And I need to swap the group of tiles. It's easy if the figures are the same height and width. But there are cases when ...

Alice Khomich

1

asked Jul 17 at 8:33

1 vote

0 answers

54 views

Median Position in a Min-Heap can be found at any level - need proof [closed]

I need to prove that the median value in a minimum heap with distinct values can be found at any level. It sounds right intuitively and I can give examples, but not sure how to approach this proof, ...

Hila Grain

21

asked Jul 16 at 16:02

4 votes

3 answers

161 views

Count how many adjacent elements satisfy a predicate

Given a std::vector named v and a predicate p that takes two elements and returns a bool, what is the idiomatic way to count how many adjacent elements in v satisfy p? The obvious way is to use a loop:...

PlsHelp

175

asked Jul 16 at 9:34

0 votes

2 answers

224 views

What is the time complexity of the following algorithm:

int k = 0; for (int a = n; a >= 1; a /= 2) for (int b = a; b >= 1; b--) k++; cout << k; I would say that the answer is O(n), but the book where I have found the exercise says that ...

Andrei Morgovan

81

asked Jul 15 at 21:00

5 votes

2 answers

122 views

C How to generate an arbitrary permutation within range [i,j]?

Does C standard library provide any function that generate a random permutation of consecutive numbers within a range? How to make a function that efficiently does it? I'm thinking of making a random ...

PkDrew

2,253

asked Jul 15 at 1:26

-1 votes

2 answers

155 views

Is there a faster method to compute these distance-based sums over a nonuniform grid of cells?

I'm attempting to implement an algorithm to compute an array of values. Unfortunately, I've found the literal implementation of that algorithm to be too slow for my use case. I suspect there's an ...

PerplexedDimension

149

asked Jul 15 at 0:52

Collectives™ on Stack Overflow

Efficient way to check digits in a number

Dijkstra's algorithm with speed boost cells [closed]

What matching algorithm generates attacker–defender pairs in RL game event logs? [closed]

Python recursion prints all elements repeatedly instead of printing each elements on the new line called by the function [closed]

What are fast GPU algorithms for sequential bin packing? [closed]

How can I optimize the time complexity of my brute-force solution for finding all unique triplets with sum zero?

LeetCode - 23. Merge k Sorted Lists algo issue

matching pair with constraint [closed]

How can I optimize a Python loop that counts maximum frequency of elements? [closed]

Puzzle swap system alghorithm [closed]

Median Position in a Min-Heap can be found at any level - need proof [closed]

Count how many adjacent elements satisfy a predicate

What is the time complexity of the following algorithm:

C How to generate an arbitrary permutation within range [i,j]?

Is there a faster method to compute these distance-based sums over a nonuniform grid of cells?

Hot Network Questions

Collectives™ on Stack Overflow

Related Tags