Programming Challenges - How to be a breathtaking Programmer

@prograchallenges

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

Programming Challenges - How to be a breathtaking Programmer (English)

Are you looking to enhance your programming skills and become a truly remarkable programmer? Look no further than the Telegram channel 'Programming Challenges - How to be a breathtaking Programmer'! This channel is dedicated to providing programming enthusiasts with a platform to engage in challenges, learn new concepts, and hone their skills to perfection. Led by the talented and experienced @BinaryByter, this channel offers a wealth of challenge ideas that will push your boundaries and take your programming abilities to new heights. From coding puzzles to algorithmic challenges, there is something for everyone to enjoy and learn from.

Join a community of like-minded individuals who share your passion for programming and are eager to support each other on their journey to becoming better programmers. Connect with the best friends you can have by joining the group at https://t.me/joinchat/EXSmZ0dDYKpcZWcLQQH-zw and start engaging in stimulating discussions, sharing knowledge, and collaborating on exciting projects.

Additionally, make sure to check out the channel's Youtube page at https://www.youtube.com/channel/UCE_XffNtPkEXej9iDW4f0sw for video tutorials, coding challenges, and programming tips that will further enhance your learning experience. Whether you are a beginner looking to get started in programming or an experienced coder seeking to level up your skills, 'Programming Challenges - How to be a breathtaking Programmer' is the perfect channel for you. Join today and embark on an exhilarating journey towards becoming the best programmer you can be!

Programming Challenges - How to be a breathtaking Programmer

17 Aug, 11:02

FOURIER TRANSFORM
+========+
Time: 1 hour
Difficulty: Medium
Languages: Any
+========+
Given a sequence of complex numbers, implement a function that performs a Fourier transform on the sequence using the Fast Fourier Transform algorithm
+========+
Please answer to this message with your solution 🙂

25,513

Programming Challenges - How to be a breathtaking Programmer

15 Aug, 11:03

A* SEARCH
+========+
Time: 2 hours - 3 hours
Difficulty: Hard
Languages: Any
+========+
Given a graph represented by an adjacency matrix and a starting and goal vertex, implement a function that finds the shortest path from the starting vertex to the goal vertex using A* search algorithm
+========+
Please answer to this message with your solution 🙂

22,233

Programming Challenges - How to be a breathtaking Programmer

13 Aug, 10:54

BINARY SEARCH
+========+
Time: 30 minutes
Difficulty: Easy
Languages: Any
+========+
Given a sorted list of integers, implement a function that performs a binary search on the list and returns the index of the element if found or -1 if not found
+========+
Please answer to this message with your solution 🙂

18,933

Programming Challenges - How to be a breathtaking Programmer

11 Aug, 10:53

K-MEANS CLUSTERING
+========+
Time: 2 hours - 3 hours
Difficulty: Hard
Languages: Any
+========+
Given a set of points in two-dimensional space, implement a function that performs k-means clustering on the set, using the Lloyd's algorithm
+========+
Please answer to this message with your solution 🙂

15,494

Programming Challenges - How to be a breathtaking Programmer

09 Aug, 10:53

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

12,579

Programming Challenges - How to be a breathtaking Programmer

07 Aug, 10:53

FIBONACCI SEQUENCE
+========+
Time: 30 minutes
Difficulty: Easy
Languages: Any
+========+
Given a number n, implement a function that returns the nth number in the Fibonacci sequence using recursion
+========+
Please answer to this message with your solution 🙂

11,320

Programming Challenges - How to be a breathtaking Programmer

05 Aug, 10:52

TOWER OF HANOI
+========+
Time: 30 minutes
Difficulty: Easy
Languages: Any
+========+
Given a tower of n discs stacked in decreasing order of size and 3 pegs, implement a function that solves the tower of Hanoi puzzle by moving the discs from the first peg to the last peg with the help of the middle peg.
+========+
Please answer to this message with your solution 🙂

10,216

Programming Challenges - How to be a breathtaking Programmer

03 Aug, 10:52

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 🙂

9,078

Programming Challenges - How to be a breathtaking Programmer

01 Aug, 10:52

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 🙂

8,094

Programming Challenges - How to be a breathtaking Programmer

30 Jul, 10:52

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 🙂

7,681

Programming Challenges - How to be a breathtaking Programmer

28 Jul, 10:51

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 🙂

7,387

Programming Challenges - How to be a breathtaking Programmer

26 Jul, 10:51

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 🙂

7,220

Programming Challenges - How to be a breathtaking Programmer

24 Jul, 10:51

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 🙂

6,857

Programming Challenges - How to be a breathtaking Programmer

22 Jul, 10:51

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 🙂

7,481

Programming Challenges - How to be a breathtaking Programmer

20 Jul, 10:49

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 🙂

9,664

Programming Challenges - How to be a breathtaking Programmer

18 Jul, 10:49

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 🙂

9,199

Programming Challenges - How to be a breathtaking Programmer

14 Jul, 10:49

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 🙂

6,401

Programming Challenges - How to be a breathtaking Programmer

01 Jul, 10:48

Summer break 😎

Prograchallenges is on summer vacation the first 2 weeks in July. Hope you have had an amazing 2023 so far, and remember to take some time off and be outside.

See you soon again!

6,730

Programming Challenges - How to be a breathtaking Programmer

29 Jun, 10:47

SINGLE-LINKAGE CLUSTERING
+========+
Time: 30 minutes - 1 hour
Difficulty: Medium
Languages: Any
+========+
Given a set of points in two-dimensional space, implement a function that performs single-linkage clustering on the set, using the nearest-neighbor algorithm
+========+
Please answer to this message with your solution 🙂

8,185