I'm trying to swap the 2nd and 4th elements in a list, but I can't figure out how to do this. I tried to use vector notation, but it didn't work. list<int>
My understanding is that BFS and DFS are graph traversing algorithm while other algorithms like A* and dijkstra are for finding shortest path between two nodes
This is a variation of the gaps and islands problem. I tried finding solutions but they are all SQL based. Problem: Given a list of date ranges, return a combin
I have a list of Sugar. The Sugar class has two field: price and weight: data class Sugar(var price: Double, var weight: Double) And I need to find max/min val
I want to find a target sum in an array by adding integers until it's reached, then return the indexes which add up to the target by using streams. For example,
this is what we start with: '7.7+7' The input of the function is an array of strings (original input converted to postfix): 7.7,7,+ then would get fed back into
I'm looking over the solution to adding 2 binary numbers, using the bit manipulation approach. The input are 2 binary-number strings, and the expected output is
Today I was browsing for some questions that I saw this: Algorithm - Air Battle C ++ time limit: 1 second Java time limit: 2 seconds Python time limit: 10 secon
Based on the answer by Will Ness, I've been using a JavaScript adaptation for the postponed sieve algorithm: function * primes() { yield 2; yield 3;
Given two integers n and r, I want to generate all possible combinations with the following rules: There are n distinct numbers to choose from, 1, 2, ..., n; Ea
I need to find the coins needed to make up a specified amount, not the number of ways or the minimum number of coins, but if the coins end up a minimal number t
I am attempting to solve a coding challenge however my solution is not very performant, I'm looking for advice or suggestions on how I can improve my algorithm.
I was given a question that I can't seem to solve. given a directed graph G=(V,E) and a natural number k, k>0. Find an algorithm that will return "YES" if th
In my algorithm to compare the secret word with the guessed word, I need to manage the duplicated letters. For example, if the secret word is newly and the gue
The question is to distribute candies to N children.Each child has a rating. Distribution should be such that each child have at least one candy and children wi
I have a list of num and string of operator above: final List<dynamic> items = [5.0, "-", 2, "*", 3]; I want to calculate the value inside of it. I can d
Problem Statement- You and two of your friends have just returned back home after visiting various countries. Now you would like to evenly split all the souveni
I'm having trouble simplifying a conditional statement. It looks like this: There is an array of arrays like this, dice = [ [a, b], [c, d] ]. a, b, c, and d rep
Looking for an algorithm to find longest sequences (pairs, triplets, up to quadruplets) that are separated by a constant, non-integer difference k in a sorted a
I'm not very familiar with Big O notation. I'm wondering does the time complexity of the nested loop always be n^2? For example the following function, the inne