Programming Challenges - How to be a breathtaking Programmer

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 🙂

16.4k 0 8 88 29

Programming Challenges - How to be a breathtaking Programmer

15 Aug 2023, 14: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 🙂

14.7k 0 3 35 5

Programming Challenges - How to be a breathtaking Programmer

13 Aug 2023, 13: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 🙂

12.2k 0 2 31 4

Programming Challenges - How to be a breathtaking Programmer

11 Aug 2023, 13: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 🙂

10.6k 0 4 1 4

Programming Challenges - How to be a breathtaking Programmer

9 Aug 2023, 13: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 🙂

8.6k 0 5 9 4

Programming Challenges - How to be a breathtaking Programmer

7 Aug 2023, 13: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 🙂

7.9k 0 2 1 8

Programming Challenges - How to be a breathtaking Programmer

5 Aug 2023, 13: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 🙂

7.2k 0 3 3 6

Programming Challenges - How to be a breathtaking Programmer

3 Aug 2023, 13: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 🙂

6.5k 0 4 1 3

Programming Challenges - How to be a breathtaking Programmer

1 Aug 2023, 13: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 🙂

5.9k 0 4 2 2

Programming Challenges - How to be a breathtaking Programmer

30 Jul 2023, 13: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 🙂

5.7k 0 4 2 6

Programming Challenges - How to be a breathtaking Programmer

28 Jul 2023, 13: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 🙂

5.5k 0 4 3 1

Programming Challenges - How to be a breathtaking Programmer

26 Jul 2023, 13: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 🙂

5.5k 0 1 1 8

Programming Challenges - How to be a breathtaking Programmer

24 Jul 2023, 13: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 🙂

5.3k 0 2 1 3

Programming Challenges - How to be a breathtaking Programmer

22 Jul 2023, 13: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 🙂

5.3k 0 3 4 2

Programming Challenges - How to be a breathtaking Programmer

20 Jul 2023, 13: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 🙂

6.5k 0 2 1

Programming Challenges - How to be a breathtaking Programmer

18 Jul 2023, 13: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 🙂

6.7k 0 3 11 4

Programming Challenges - How to be a breathtaking Programmer

14 Jul 2023, 13: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 🙂

5.3k 0 2 15 2

Programming Challenges - How to be a breathtaking Programmer

1 Jul 2023, 13: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!

5.6k 0 1 3 6

Programming Challenges - How to be a breathtaking Programmer

29 Jun 2023, 13: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 🙂

5.8k 0 4 6 1

Показано 20 последних публикаций.

16 581

подписчиков

Статистика канала

Язык сайта

Воронка за 3 дня

Бот для продажи рекламы в TG-канале

TG-контент, который продаёт!

Programming Challenges - How to be a breathtaking Programmer

Гео и язык канала

Категория

16 581