0 for
C# - Total: 1000, Run Time: 305 Seconds, Avg: 24, Min: 14, Max: 32
Wow Avg's < 15 that's pretty good, well I can't beat that but I did take a stab at it so here's my approach. I broke it up word by word then solved them in succession. By determining the length of the first two words and then ma...
1
Balanced binary search trees are essential to guarantee O(log n) lookups (or similar operations). In a dynamic environment where a lot of keys are randomly inserted and/or deleted, trees might degenerate to linked lists which are horrible for lookups. Thus there are various kinds of self-balancin...
You're organizing a treasure hunt for your friends. To conduct things more easily, you want to draw a map of all locations where you hid the precious objects.
Input
A string consisting of the locations of the objects separated by newlines. Each location is represented by two non-negative intege...
Tired Sumo Fighters
king-of-the-hilljavascript
This is a simple KOTH challenge in which you program a bot to push other bots out of a ring. Each round consists of two bots, and every bot will compete against each other bot at least 10 times. The reason that this KOTH is different from other sim...
Hi,
Question: How can I build a function that:
Recive a object by argument;
It's a schema model for the second argument;
The second argument is a array of objects that has not the same model of the first argument;
Objective: The return need be a array of objects with this modif...
-2
Hi I’m in school for programming but haven’t learned enough yet. Do you think someone could explain how it would be possible to open and edit a text file systematically with python 3? As in each open searches for specific string and then replaces it with another string. I want to put it on a GUI ...
Find the k-th largest element of n elements in O(n)
code-golf restricted-complexity
Given a non-empty list L of integers greater than 1, we define d(L) as the smallest positive integer such that n + d(L) is composite for each n in L.
We define the sequence an as:
a0 = 2
ai+1 is the smallest integer greater than ai such that d(a0, ..., ai, ai+1) > d(a0, ..., ai)
Your task
...
Find the first number (X) where X multiplied by 99 is X surrounded by 1s.
For example if we assume X is 456 then it shall hold that:
14561 = 99*456
Obviously it doesn't hold for 456.
Your task is to write function that finds the first X that satisfy the condition and then returns X. The sho...
Fairy Chess is a sort of generalized chess that allows unconventional pieces. The eight queens puzzle is a classic problem where you have to put 8 queens on a chess board such that no two queens threaten each other. This challenge is sort of a generalized combination of the two.
Challenge
Given...
