Outline
+====+
Difficulty: medium
Time: 20minutes
+============+
Given a set of colored pixel (orange and white) , draw a black outline around the orange pixels.

Credits: @OverCoder

#algorythm #input #output #images

Simplify!
+=====+
Difficulty: medium - hard
Time: 2h
+=====+
Given an equation or a formula, simplify it as much as possible.

Elements that the parser should understand:

-) Functions
-) Variables
-) Different types of values
-) Common mathematical Operators

#input #output #maths #parser #algorythm

Solutions to @Linuxer4Fun

Heated Debate!
+===========+
Difficulty: Hard
Time: 30-70min
Language: C++
+===========+
In C++, find a way to make arrays start at 1.

#meme #input #output #vectors #arrays

Solutions to @linuxer4fun!

Simulation
+=======+
Difficulty: Hard
Time: 25h
Language: any
+=====================+
Program a Simulation of Newtonian physics on a microscopic scale.

#physics #maths #input #output #algorythm

First solution sent to @Linuxer4Fun will be put into the

Hall of Fame

Variadics!
+======+
Time: 20 minutes
Difficulty: advanced
Language: any that supports variadic arguments (C++)
+==================+
Learn about variadic arguments and make a function that accepts an infinite amount of arguments.

#learning #magic #input

Good hiding spot
+============+
Difficulty : medium
Time : 2h
+======+
Implement a program that stores a file inside of an image data by only using the least significant bits to store data.

#encrypt #input #outputs

Passwordz
+=======+
Difficulty: difficult
Time: 1h
+=====+
Find a way to securely save passwords. They dont need to be recoverable, two users with identical passwords should not have the same entry.

#encryption #input #output #algorythm

Compressed
+=========+
Difficulty: Quite hard, might require google
Time: 2h
+=====+
Finde the most optimal way (memory space wise) to store text, and implement it

#algorythm #input #output #text

Hashed!
+=====+
Difficulty: Medium
Time: 1h
+=====+
Implement xxHash

#algorythm #specification #input #output

Connection?
+========+
Difficulty: hard
Time: 2d
+====+
Design a protocol for data transmittion.

#algorythm #design #input #output #internet

Linear Regression
+=============+
Time: 2h
Difficulty: Medium
Language: any
Credits: Ddruv
+==========+
Program a program that lets the user create points on a canvas. Then, draw one single straight line that aproximates them as well as possible.

+======+

#math #input #output #canvas
#MachineLearning

#1

Solutions to @Linuxer4Fun

Genetics
+=====+
Time: 20 minutes + Runtime
Difficulty: Medium
Language: Any
Credits: @thelastjedi4
+================+
Make a genetic Algorithm that learns to solve the "Travellings salesman" problem.

+================+

#math #genetic #input #output #runtime #calculation

Challenge Number: #2

Solutions to @Linuxer4Fun

Big Data
+======+
Time: 5h
Difficulty: easy
Languagey: bash
+============+
Make a program that collects the newest articles off of an rss feed.

Use the GNU-Toolset exclusively

+========================+

#input #output #dataScience #gimmeData

Plot Twist!
+========+
Time: 5h
Difficulty: medium
+=============+

Write a CLI program that takes datapoints as arguments and outputs a CLI graph!

+======+

#input #output #modular #datascience

Nice Curves!
+========+
Time: 2h
Difficulty: medium, mathsy
Language: any
+===================+

Implement a bezier curve function that plots a bezier curve with different parameters

+=============+

#graphics #citroen #maths #learning #input #output

Factorization!
+==========+
Time: 1h
Difficulty: medium-hard
+==================+

Implement Shor's algorithm for Factorization of numbers.

+================+

Challenge No #2
#maths #algorithm #learning #input #output

Spinning Safe!
+==========+
Time: 2h
Difficulty: hard-ish
+=============+

Your friend owns a safe with N different inputs from 0-9. It's locking mechanism is peculiar: it blows up after you doing 10 Steps. In one step, you can change any amount of adjacent inputs by any amount, but always the same.

Program a program that calculates wether it is possible to crack the safe without blowing up and dying.

Example:
Current state: 1234
Code: 2345
Needed steps to solve: 1
(rotate each one up by one)

+====================+
#algorithm #maths #learning #input #output #challenge

Because you know i'm all about that base
+================================+
Time: 1h
Difficulty: maths
+============+
Implement a base64 encoding!

+===========+
#encrypt #learning #algorithm #input #output

Draw the Numbers
+==============+
Time: 20mins
Difficulty: easy-ish
+==============+

2 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1
1 0 1 0 1 1 0 1 1 0 1 1 1 1 1 1
1 0 0 0 1 0 0 1 0 0 0 1 1 1 1 1
1 0 1 1 1 1 1 1 0 1 0 1 0 0 0 1
1 0 1 0 0 0 0 1 0 1 0 1 1 1 0 1
1 0 1 0 1 1 0 1 0 1 0 1 1 1 0 1
1 0 0 0 0 1 1 1 0 1 0 0 0 0 0 1
1 1 0 1 1 1 0 1 0 1 0 1 0 1 1 1
1 1 0 1 1 0 0 0 0 0 0 1 0 1 0 1
1 0 0 1 1 1 1 0 1 1 0 1 0 0 0 1
1 0 1 1 1 0 1 0 0 1 0 1 1 1 0 1
1 0 0 0 0 0 1 0 1 1 0 0 0 1 0 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 1
0 0 0 0 0 0 0 0 0 0 0 0 0 1 3 1

Based on those pixels, make a program that gives to each value a different color and then gives the image as output!

Solve the challenge that resulted!

+===========================+

Solutions to @linuxer4fun

#challenge No 3
#numbers #input #output #colors #canvas

Compressed
+=========+
Difficulty: Quite hard, might require google
Time: 2h
+=====+
Finde the most optimal way (memory space wise) to store text, and implement it

#algorythm #input #output #text