Programming Challenges

Public

View Channel

Can't Join? @prograchallenges

15.8k Members

Updated: May 25, 2026 at 1:21 PM

Programming Challenges

I will make you the best Programmer you can be! Group of the best friends you can have: https://t.me/joinchat/EXSmZ0dDYKpcZWcLQQH-zw Challenge ideas: @BinaryByter Youtube: https://www.youtube.com/channel/UCE_XffNtPkEXej9iDW4f0sw

Join @prograchallenges for exclusive friends and challenge content and discussions in 1

Ranking

Global Ranking

#45600

-2462

Language Ranking

#6816

-94

Category Ranking

#242

-16

Participant Growth (Last 30 Days)

Total: 15.8K

24h growth: -105 1%

Latest Posts

Programming Challenges

Apr 23, 2026, 01:41 PM

BUBBLE SORT
+========+
Time: 30 minutes
Difficulty: Easy
Languages: Any
+========+
Given a list of integers, implement a function that performs a bubble sort on the list
+========+
Please answer to this message with your solution 🙂

11,400

Programming Challenges

Apr 23, 2026, 01:41 PM

QUICKSORT
+========+
Time: 1 hour
Difficulty: Medium
Languages: Any
+========+
Given a list of integers, implement a function that performs a quicksort on the list
+========+
Please answer to this message with your solution 🙂

12,000

Programming Challenges

Apr 23, 2026, 01:41 PM

Dijkstra's Shortest Path
+========+
Time: 2 hours - 3 hours
Difficulty: Hard
Languages: Any
+========+
Given a directed graph represented by an adjacency matrix and a source vertex, implement a function that finds the shortest path from the source vertex to all other vertices using Dijkstra's shortest path algorithm
+========+
Please answer to this message with your solution 🙂

13,600

Programming Challenges

Apr 23, 2026, 01:41 PM

GRADIENT DESCENT
+========+
Time: 1 hour - 2 hours
Difficulty: Hard
Languages: Any
+========+
Given a set of data points and a cost function, implement a function that finds the minimum of the cost function using gradient descent algorithm.
+========+
Please answer to this message with your solution 🙂

11,600

Programming Challenges

Apr 23, 2026, 01:41 PM

HUFFMAN CODING
+========+
Time: 30 minutes - 1 hour
Difficulty: Medium
Languages: Any
+========+
Given a string of characters, implement a function that performs Huffman coding on the string to compress it.
+========+
Please answer to this message with your solution 🙂

10,900

Programming Challenges

Apr 23, 2026, 01:41 PM

DEPTH-FIRST SEARCH
+========+
Time: 2 hours - 3 hours
Difficulty: Hard
Languages: Any
+========+
Given a graph represented by an adjacency list, implement a function that performs a depth-first search of the graph, and returns a list of the visited nodes.
+========+
Please answer to this message with your solution 🙂

11,800

Programming Challenges

Apr 23, 2026, 01:41 PM

BFS
+========+
Time: 30 minutes - 1 hour
Difficulty: Medium
Languages: Any
+========+
Given a graph represented by an adjacency list and a starting vertex, implement a function that performs a breadth-first search of the graph and returns a list of the visited nodes
+========+
Please answer to this message with your solution 🙂

11,500

Programming Challenges

Apr 23, 2026, 01:41 PM

GREEDY ALGORITHM
+========+
Time: 30 minutes - 1 hour
Difficulty: Medium
Languages: Any
+========+
Given a set of items, each with a value and a weight, and a knapsack with a maximum weight capacity, implement a function that finds the maximum value that can be placed in the knapsack using a greedy algorithm.
+========+
Please answer to this message with your solution 🙂

12,000

Programming Challenges

Apr 23, 2026, 01:41 PM

PRIM'S ALGORITHM
+========+
Time: 1 hour - 2 hours
Difficulty: Hard
Languages: Any
+========+
Given an undirected graph represented by an adjacency matrix, implement a function that finds the minimum spanning tree using the Prim's algorithm
+========+
Please answer to this message with your solution 🙂

13,100

Programming Challenges

Apr 23, 2026, 01:41 PM

BELLMAN-FORD
+========+
Time: 2 hours - 3 hours
Difficulty: Hard
Languages: Any
+========+
Given a directed graph represented by an adjacency matrix and a source vertex, implement a function that finds the shortest path from the source vertex to all other vertices using the Bellman-Ford algorithm.
+========+
Please answer to this message with your solution 🙂

9,740

Showing 10 of 10 posts

No more posts

Loading posts...

Rating

User Reviews (0)

No reviews yet. Be the first to share your experience!

Loading reviews...

Related Telegram Channels

FEATURED

Loading recommended channels...

Programming Challenges

Programming Challenges

Ranking

Participant Growth (Last 30 Days)

Latest Posts

Rating

User Reviews (0)

Related Telegram Channels

Evening with a Sound Engineer

Roxman

Zaya

Code & Coffee

Code Stars

shego.codes

Android source code free download

The Coding Space: C, C++, C#, Java, Python, Rust, Go, PHP and More

Related Telegram Channels

Evening with a Sound Engineer

Roxman

Zaya

Code & Coffee

Code Stars

shego.codes

Android source code free download

The Coding Space: C, C++, C#, Java, Python, Rust, Go, PHP and More

User Reviews (0)

Latest Posts