Telegram Web Link
P R O J E C T
+========+
Having friends is awesome! Programmer friends are even better: and that's what prograchallenges is all about; making friends and learning to code!

In order to strengthen our bonds in the community, a project for enthusiasts was formed. We are going to collectively program an open-sourced website (prograchallenges.com) for taking and posting challenges online and competing in a gamified system to learn coding!

Join the project here: https://www.tg-me.com/joinchat--HfGvN8MHek0YmFi

I can't wait to release the website 🤩🤩🤩
Forwarded from APE | 𝘿𝙀𝙑
Which is best for coding
Anonymous Poll
15%
Mac
33%
Windows
51%
Linux
Mood
+=====+
Write a function that takes in a mood - and outputs "Today, I am feeling <>"!
If no mood was passed to the function, it should output "Today, I am feeling neutral"

+=========+
Please answer to this message with your solution :)
Got a challenge Idea? DM it to @BinaryByter for a chance to be featured on this channel!
Thicc Water!
+=========+
Implement a function that takes height and radius of a cylinder!
The output should be the weight of a column of water of those proportions.
For an additional challenge, round the result to exactly 2 decimals.
+=========+
Please answer to this message with your solution :)
Got a challenge Idea? DM it to @BinaryByter for a chance to be featured on this channel!
Polish your maths!
+==========+
In some areas of computer science, mathematical formulas are notated in polish notation:
4 10 +
=> 14

5 10 -
=> -5

3 3 *
=> 9

Implement a function that takes such an expression and converts it into a "normal" matematical equation

depolish ("4 10 -") => "4 - 10"

+=========+
Please answer to this message with your solution :)
Got a challenge Idea? DM it to @BinaryByter for a chance to be featured on this channel!
ROMAN-tic
+========+
Write a class that holds a roman numeral, implements functions for output and input, addition, subtraction, multiplication, division and conversion to and from integer.

+=========+
Thanks to Michele for suggesting this idea!
Please answer to this message with your solution :)
Got a challenge Idea? DM it to @BinaryByter for a chance to be featured on this channel!
Forwarded from CrazyOne
FREE BOOKS
+==========+
Download programming books for FREE, all books from 2019!

https://www.tg-me.com/progerbooks
How to start into file IO
+======+
Time: 10 minutes
Difficulty: Easy
+========+
Program a tool that empties a file completely! Of course your tool has to be fast!
+==========+
Artistic Coding :D
+===========+
Difficulty: easy
time: 20 minutes
languages: any
+====================+
Write a program that randomly outputs either "@" or "^" or a "%" until the terminal is full. Share your screenshotted results in the group!

Try other characters too!
What kind of music do you listen to while coding?
Anonymous Poll
26%
Classical
29%
Pop/Rock
9%
Hardstyle
12%
Metal
32%
Silence
31%
LoFi-Beats to chill to
RETURN TO SENDER!
+===============+

A boomerang is a V-shaped sequence that is either upright or upside down. Specifically, a boomerang can be defined as: sub-array of length 3, with the first and last digits being the same and the middle digit being different.

[3, 7, 3], [1, -1, 1], [5, 6, 5]

***Create a function that returns the total number of boomerangs in an array.***

[3, 7, 3, 2, 1, 5, 1, 2, 2, -2, 2]
// 3 boomerangs in this sequence: [3, 7, 3], [1, 5, 1], [2, -2, 2]


countBoomerangs([9, 5, 9, 5, 1, 1, 1]) ➞ 2

countBoomerangs([5, 6, 6, 7, 6, 3, 9]) ➞ 1

countBoomerangs([4, 4, 4, 9, 9, 9, 9]) ➞ 0

Notes

[5, 5, 5] (triple identical digits) is NOT considered a boomerang because the middle digit is identical to the first and last.


+=========+
Please answer to this message with your solution :)
Got a challenge Idea? DM it to @BinaryByter for a chance to be featured on this channel!
Stringy
+======+
Given a string "s" containing non-alphabetic characters, reverse the string so that the position of these non-alphabetic characters is still preserved.

var s = "abc^defgh==i"
Expected Output:  "ihg^fedcb==a"

+=======+
Thanks to StarPrince for this suggestion! :)
INTEGER
+========+
Given an integer arrary arr. Count how many elements X there are, such that X+1 is also in arr. If there're duplicates in arr, count them separately.

Example 1:
Input: arr = [1,2,3]
Output: 2

EXPLANATION :
There are 2 such elements: 1 and 2 because 2 and 3 are also in the arrary.

Example 2:
Input: arr = [1,1,3,3,5,5,7,7]
Output: 0

EXPLANATION :
There's no such number because 2, 4, 6 or 8 is not present in the arrary.

Example 3:
Input: arr = [1,3,2,3,5,0]
Output: 3

EXPLANATION:
There are 3 such numbers 0, 1 and 2 because 1, 2 and 3 are in the arrary.

Example 4:
Input: arr = [1,1,2,2]
Output: 2

EXPLANATION:
There are 2 such numbers 1 and 1 because 2 is in the arrary and duplicates are counted separately.

Example 5:
Input: arr = [1,1,2]
Output: 2

EXPLANATION:
There are 2 such numbers: 1 and 1 because 2 is in the arrary and duplicates are counted separately.
+========+
Thanks to star prince for this suggestion! 🤩🤩
Holes! Triangles! Maths!
+==================+

Create a function that takes the dimensions of two triangles (as arrays) and checks if the first triangle fits into the second one.

doesTriangleFit([1, 1, 1], [1, 1, 1]) ➞ true

doesTriangleFit([1, 1, 1], [2, 2, 2]) ➞ true

doesTriangleFit([1, 2, 3], [1, 2, 2]) ➞ false

doesTriangleFit([1, 2, 4], [1, 2, 6]) ➞ true

+=========+
Please answer to this message with your solution :)
Got a challenge Idea? DM it to @BinaryByter for a chance to be featured on this channel!
Electric!
+========+
Create a function that takes voltage and current and returns the calculated power.
circuitPower(230, 10) ➞ 2300

circuitPower(110, 3) ➞ 330

circuitPower(480, 20) ➞ 9600



+=========+
Please answer to this message with your solution :)
Got a challenge Idea? DM it to @BinaryByter for a chance to be featured on this channel!
REMOVE 3
+=========+
Suppose you have an initialized list of numbers {4, 3, 5, 3, 2, 1, 3, 7, 9, 8, 3}. Write a program which removes ALL occurrences of number 3 from the list.

+=========+
https://prograchallenges.com/challenge/remove-3-from-list for your solution :)
Got a challenge Idea? DM it to @BinaryByter for a chance to be featured on this channel!
PATTERNS
+========+
i have a challenge:

implement a "pattern_match(haystack: string, pattern: string) -> bool" function that accepts any string as haystack, and any string as pattern. The pattern can contain * as wildcard and \* as regular * not wildcard. \ not in front of * is treated as a regular character in the pattern.

Use of functions like:
String.indexOf()
String.contains()
String.matches()
String.endsWith()
String.includes()
String.match() / String.matchAll()
String.search()
String.parse() # as in Python
String.split() # as JS or java
and their counterparts in other languages/libraries - is forbidden. Regular expressions and similar mechanisms - are cheating.

Methods that in general are allowed:
String.at()
String.codePointAt()
String.toCharArray()

Tests:
pattern_match(None, "foo") -> False
pattern_match(None, "*") -> False
pattern_match("", "foo") -> False
pattern_match("", "*") -> True
pattern_match("", "") -> True
pattern_match("a", "") -> True
pattern_match("*", "\\*") -> True
pattern_match("*", "*") -> True
pattern_match("abc","c") -> True
pattern_match("abc","b") -> True
pattern_match("abc","*b*") -> True
pattern_match("abc","a*c") -> True
pattern_match("a*c","a\\*c") -> True
pattern_match("a*c","abc") -> False
pattern_match("foo",None) -> False
pattern_match("foo", "foo") -> True
pattern_match("foo", "f") -> True
pattern_match("foo", "f*") -> True # wildcard matches 0 or more characters
pattern_match("foo", "foo*") -> True
pattern_match("lorem ipsum dolor sit amet", "ipsum * sit") -> True
pattern_match("foo*a", "foo\\*") -> True
pattern_match("foo", "bar") -> False
pattern_match("foo*bar", "foo*bar") -> True
pattern_match("żółć","*ó*ć") -> True # chars not in ASCII must be supported too. Single character fits into (java) int, rather not in (java) char
pattern_match(" foo","* * foo") -> True

# optional, bonus challenge:
pattern_match("\uD83D\uDE03","\u1F603") -> True # explanation: d83d is unicode surrogate, it must be read together with the next symbol. Note: surrogates can be stacked.

+=========+
Thanks to mt3o for suggesting this challenge!
2025/07/07 15:16:34
Back to Top
HTML Embed Code: