404 Not Found
Maybe your looking for one of these pages?
cons(a, b) constructs a pair, and car(pair) and cdr(pair) returns the first and last element of that pair. For example, car(cons(3, 4)) returns 3, and cdr(cons(3, 4)) returns 4.
minimizing coins cases solution
In this challenge, you are required to calculate and print the sum of the elements in an array, keeping in mind that some of those integers may be quite large
Consider a pair of integers, (a,b). The following operations can be performed on (a,b) in any order, zero or more times: - (a,b) -> ( a+b, b ) - (a,b) -> ( a, a+b )
leet code two sum
Max Product Of Three Integers
Create a program that finds the minimum value in these numbers
Algorithms - Max value
two lowest positive numbers given an array of minimum
mini-max sum hackerrank
program Pr115_3; var k, n : integer; suma : real; begin readln(n); suma := 0; for k := 1 to n do suma := suma + 1 / sqr(2*k+1); writeln(suma); readln; end.
1281. Subtract the Product and Sum of Digits of an Integer leetcode solution in c++
Maximum Pairwise Modular Sum codechef solution in c++
Largest number with given sum
sum of 2 problem in code
A pile of N identical coins lies on the table. Each individual move arranges these N coins into groups with exactly out coins in each group, where out is guaranteed to be a positive integer greater than one. The mod(N, Out) leftover coins that do not fit
Top K Frequent code in java Given an integer array nums and an integer k, return the k most frequent elements. You may return the answer in sorted order. Note: Your algorithm's time complexity must be better than O(n log n), where n is the array's size
Feature #4: Maximum Profit
Feature #4: Maximum Profit
write the following in javascript:
Frequency of Maximum ValueFor a given array of integers, determine the maximum value in the segment from each index to the highest index element, inclusive. After that has been determined, determine the number of times t