Programming Challenges - How to be a breathtaking Programmer

18 января 2024 16:04

/channel/prograchallenges?boost

Hey everybody, please help by boosting this channel 🥰

Programming Challenges - How to be a breathtaking Programmer

15 августа 2023 13: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 🙂

Programming Challenges - How to be a breathtaking Programmer

11 августа 2023 12: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 🙂

Programming Challenges - How to be a breathtaking Programmer

07 августа 2023 12: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 🙂

Programming Challenges - How to be a breathtaking Programmer

03 августа 2023 12: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 🙂

Programming Challenges - How to be a breathtaking Programmer

30 июля 2023 12: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 🙂

Programming Challenges - How to be a breathtaking Programmer

26 июля 2023 12: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 🙂

Programming Challenges - How to be a breathtaking Programmer

22 июля 2023 12: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 🙂

Programming Challenges - How to be a breathtaking Programmer

18 июля 2023 12: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 🙂

Programming Challenges - How to be a breathtaking Programmer

01 июля 2023 12: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!

Programming Challenges - How to be a breathtaking Programmer

27 июня 2023 12:47

IMAGE SEGMENTATION
+========+
Time: 1 hour - 2 hours
Difficulty: Hard
Languages: Any
+========+
Given an image represented by a matrix, implement a function that segments the image into multiple regions using the region growing algorithm
+========+
Please answer to this message with your solution 🙂

Programming Challenges - How to be a breathtaking Programmer

23 июня 2023 12:46

TSP
+========+
Time: 2 hours - 3 hours
Difficulty: Hard
Languages: Any
+========+
Given a set of cities and the distance between each pair of them, implement a function that finds the shortest possible route that visits each city exactly once and returns to the origin city using the branch and bound algorithm
+========+
Please answer to this message with your solution 🙂

Programming Challenges - How to be a breathtaking Programmer

19 июня 2023 12:46

GRAPH COLORING
+========+
Time: 1 hour - 2 hours
Difficulty: Hard
Languages: Any
+========+
Given an undirected graph represented by an adjacency matrix, implement a function that finds the smallest number of colors that can be used to color the graph such that no two adjacent vertices have the same color, using the Welsh-Powell algorithm
+========+
Please answer to this message with your solution 🙂

Programming Challenges - How to be a breathtaking Programmer

15 июня 2023 12:46

MAXIMUM FLOW
+========+
Time: 2 hours - 3 hours
Difficulty: Hard
Languages: Any
+========+
Given a network represented by a directed graph with capacities on the edges, implement a function that finds the maximum flow through the network using the Ford-Fulkerson algorithm
+========+
Please answer to this message with your solution 🙂

Programming Challenges - How to be a breathtaking Programmer

11 июня 2023 12:44

ART GALLERY PROBLEM
+========+
Time: 1 hour - 2 hours
Difficulty: Hard
Languages: Any
+========+
Given a set of points in two-dimensional space that represent the corners of a polygon, implement a function that finds the smallest number of guards that can be placed at the vertices of the polygon such that every point on the interior of the polygon is visible to at least one guard, using the Chvátal's algorithm
+========+
Please answer to this message with your solution 🙂

Programming Challenges - How to be a breathtaking Programmer

17 августа 2023 13: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 🙂

Programming Challenges - How to be a breathtaking Programmer

13 августа 2023 12: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 🙂

Programming Challenges - How to be a breathtaking Programmer

09 августа 2023 12: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 🙂

Programming Challenges - How to be a breathtaking Programmer

05 августа 2023 12: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 🙂

Programming Challenges - How to be a breathtaking Programmer

01 августа 2023 12: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 🙂

Programming Challenges - How to be a breathtaking Programmer

28 июля 2023 12: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 🙂

Programming Challenges - How to be a breathtaking Programmer

24 июля 2023 12: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 🙂

Programming Challenges - How to be a breathtaking Programmer

20 июля 2023 12: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 🙂

Programming Challenges - How to be a breathtaking Programmer

14 июля 2023 12: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 🙂

Programming Challenges - How to be a breathtaking Programmer

29 июня 2023 12: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 🙂

Programming Challenges - How to be a breathtaking Programmer

25 июня 2023 12:46

MINIMUM SPANNING TREE
+========+
Time: 30 minutes - 1 hour
Difficulty: Medium
Languages: Any
+========+
Given an undirected graph represented by an adjacency matrix, implement a function that finds the minimum spanning tree using the Kruskal's algorithm
+========+
Please answer to this message with your solution 🙂

Programming Challenges - How to be a breathtaking Programmer

21 июня 2023 12:46

AVL TREE
+========+
Time: 30 minutes - 1 hour
Difficulty: Medium
Languages: Any
+========+
Given a list of integers, implement a function that constructs an AVL tree from the list and a function that performs an in-order traversal of the tree
+========+
Please answer to this message with your solution 🙂

Programming Challenges - How to be a breathtaking Programmer

17 июня 2023 12:46

DYNAMIC PROGRAMMING COIN CHANGE
+========+
Time: 30 minutes - 1 hour
Difficulty: Medium
Languages: Any
+========+
Given a target value and a list of coin values, implement a function that finds the number of ways to make the target value using the given coin denominations with dynamic programming.
+========+
Please answer to this message with your solution 🙂

Programming Challenges - How to be a breathtaking Programmer

13 июня 2023 12:44

BINARY TREE TRAVERSAL
+========+
Time: 30 minutes - 1 hour
Difficulty: Medium
Languages: Any
+========+
Given the root of a binary tree, implement a function that performs a preorder, in-order and post-order traversal of the tree.
+========+
Please answer to this message with your solution 🙂

Programming Challenges - How to be a breathtaking Programmer

09 июня 2023 12:44

STRING MATCHING
+========+
Time: 30 minutes - 1 hour
Difficulty: Medium
Languages: Any
+========+
Given two strings text and pattern, implement a function that finds all occurrences of pattern in the text using the Boyer-Moore string matching algorithm
+========+
Please answer to this message with your solution 🙂