Programming Challenges - How to be a breathtaking Programmer

07 июня 2023 12:43

CLOSEST PAIR
+========+
Time: 2 hours - 3 hours
Difficulty: Hard
Languages: Any
+========+
Given a set of points in two-dimensional space, implement a function that finds the closest pair of points among them, using the divide and conquer approach.
+========+
Please answer to this message with your solution 🙂

Programming Challenges - How to be a breathtaking Programmer

03 июня 2023 12:43

SIMPLEX METHOD
+========+
Time: 2 hours - 3 hours
Difficulty: Hard
Languages: Any
+========+
Given a linear programming problem in the standard form, implement the simplex method algorithm to solve it
+========+
Please answer to this message with your solution 🙂

Programming Challenges - How to be a breathtaking Programmer

01 июня 2023 12:42

BINARY TREE LEVEL ORDER TRAVERSAL
+========+
Time: 30 minutes - 1 hour
Difficulty: Medium
Languages: Any
+========+
Given the root of a binary tree, implement a function that performs a level-order traversal of the tree, and returns a list of lists, where each list contains the nodes at that level.
+========+
Please answer to this message with your solution 🙂

Programming Challenges - How to be a breathtaking Programmer

28 мая 2023 12:42

PALINDROME PARTITIONING
+========+
Time: 30 minutes - 1 hour
Difficulty: Medium
Languages: Any
+========+
Given a string, implement a function that finds all possible partitions of the string such that each partition is a palindrome, using dynamic programming approach
+========+
Please answer to this message with your solution 🙂

Programming Challenges - How to be a breathtaking Programmer

24 мая 2023 12:41

TOPOLOGICAL SORT
+========+
Time: 30 minutes - 1 hour
Difficulty: Medium
Languages: Any
+========+
Given a directed acyclic graph represented by an adjacency list, implement a function that performs a topological sort 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:41

BINARY TREE SERIALIZATION
+========+
Time: 30 minutes - 1 hour
Difficulty: Medium
Languages: Any
+========+
Given the root of a binary tree, implement a function that serializes the tree to a string and a function that deserializes the string back to the original tree.
+========+
Please answer to this message with your solution 🙂

Programming Challenges - How to be a breathtaking Programmer

16 мая 2023 17:41

SHORTEST PATH BETWEEN TWO NODES
+========+
Time: 30 minutes - 1 hour
Difficulty: Medium
Languages: Any
+========+
Given a graph represented by an adjacency matrix, implement a function that finds the shortest path between two given nodes using Dijkstra's algorithm.
+========+
Please answer to this message with your solution 🙂

Programming Challenges - How to be a breathtaking Programmer

12 мая 2023 04:12

HEAP SORT
+========+
Time: 30 minutes - 1 hour
Difficulty: Easy
Languages: Any
+========+
Given a list of integers, implement a function that sorts the list using the heap sort algorithm.
+========+
Please answer to this message with your solution 🙂

Programming Challenges - How to be a breathtaking Programmer

08 мая 2023 12:39

MINIMUM 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 minimum number of coins needed to make the target value, using dynamic programming approach.
+========+
Please answer to this message with your solution 🙂

Programming Challenges - How to be a breathtaking Programmer

04 мая 2023 12:38

UNION FIND
+========+
Time: 30 minutes - 1 hour
Difficulty: Easy
Languages: Any
+========+
Given a set of elements, implement a function that performs the union-find algorithm to determine if two elements are in the same set or not.
+========+
Please answer to this message with your solution 🙂

Programming Challenges - How to be a breathtaking Programmer

01 мая 2023 16:22

Coding advice
+==========+
When you google "coding advice", you always get the same answers - they are very boring.

Join /channel/codingadvice for more unusual and even controversial advice! And also for a fun time! 😉

Programming Challenges - How to be a breathtaking Programmer

28 апреля 2023 11:32

KMP
+========+
Time: 1 hour - 2 hours
Difficulty: Hard
Languages: Any
+========+
Given a text string and a pattern string, implement a function that performs the Knuth-Morris-Pratt algorithm to find all occurrences of the pattern in the text.
+========+
Please answer to this message with your solution 🙂

Programming Challenges - How to be a breathtaking Programmer

24 апреля 2023 12:36

IMAGE THRESHOLDING
+========+
Time: 30 minutes - 1 hour
Difficulty: Medium
Languages: Any
+========+
Given an image represented by a matrix, implement a function that applies a thresholding effect to the image, converting it to a binary image.
+========+
Please answer to this message with your solution 🙂

Programming Challenges - How to be a breathtaking Programmer

20 апреля 2023 10:35

HUFFMAN ENCODING
+========+
Time: 1 hour - 2 hours
Difficulty: Hard
Languages: Any
+========+
Given a string of characters, implement a function that performs Huffman encoding on the string, and returns the encoded string and a dictionary of the binary codes for each character.
+========+
Please answer to this message with your solution 🙂

Programming Challenges - How to be a breathtaking Programmer

16 апреля 2023 12:34

IMAGE BLURRING
+========+
Time: 30 minutes - 1 hour
Difficulty: Medium
Languages: Any
+========+
Given an image represented by a matrix, implement a function that applies a blurring effect to the image using a convolution matrix.
+========+
Please answer to this message with your solution 🙂

Programming Challenges - How to be a breathtaking Programmer

05 июня 2023 12:43

BINARY SEARCH TREE
+========+
Time: 1 hour - 2 hours
Difficulty: Medium
Languages: Any
+========+
Given a list of integers, implement a function that constructs a binary search 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

01 июня 2023 17:08

16,000 subscribers. That's a lot!

Thank you guys. So happy ❤️

Programming Challenges - How to be a breathtaking Programmer

30 мая 2023 12:42

DISJOINT SET
+========+
Time: 30 minutes - 1 hour
Difficulty: Easy
Languages: Any
+========+
Given a collection of items, implement a function that performs the disjoint set data structure to track a set of elements partitioned into a number of disjoint (non-overlapping) subsets
+========+
Please answer to this message with your solution 🙂

Programming Challenges - How to be a breathtaking Programmer

26 мая 2023 12:42

GRAPH ISOMORPHISM
+========+
Time: 1 hour - 2 hours
Difficulty: Hard
Languages: Any
+========+
Given two graphs represented by an adjacency matrix, implement a function that checks if the two graphs are isomorphic by using the VF2 algorithm
+========+
Please answer to this message with your solution 🙂

Programming Challenges - How to be a breathtaking Programmer

22 мая 2023 12:41

MINIMUM CUT
+========+
Time: 2 hours - 3 hours
Difficulty: Hard
Languages: Any
+========+
Given a graph represented by an adjacency matrix, implement a function that finds the minimum cut of the graph using the Karger's algorithm
+========+
Please answer to this message with your solution 🙂

Programming Challenges - How to be a breathtaking Programmer

18 мая 2023 12:41

CONVEX HULL
+========+
Time: 1 hour - 2 hours
Difficulty: Hard
Languages: Any
+========+
Given a set of points in two-dimensional space, implement a function that finds the convex hull of the set using the Jarvis march algorithm.
+========+
Please answer to this message with your solution 🙂

Programming Challenges - How to be a breathtaking Programmer

14 мая 2023 12:41

DYNAMIC PROGRAMMING MULTI-OBJECTIVE OPTIMIZATION
+========+
Time: 2 hours - 3 hours
Difficulty: Hard
Languages: Any
+========+
Given a set of items, each with a value and a weight, and a knapsack with a maximum weight capacity and a maximum value capacity, implement a function that finds the maximum value and weight that can be placed in the knapsack using dynamic programming approach.
+========+
Please answer to this message with your solution 🙂

Programming Challenges - How to be a breathtaking Programmer

10 мая 2023 10:39

IMAGE MORPHOLOGY
+========+
Time: 30 minutes - 1 hour
Difficulty: Medium
Languages: Any
+========+
Given an image represented by a matrix, implement a function that applies a morphological operation to the image using a structuring element.
+========+
Please answer to this message with your solution 🙂

Programming Challenges - How to be a breathtaking Programmer

06 мая 2023 14:38

RASTERIZATION
+========+
Time: 1 hour - 2 hours
Difficulty: Hard
Languages: Any
+========+
Given the vertices of a polygon and the resolution of a raster image, implement a function that rasterizes the polygon and returns a matrix representing the image.
+========+
Please answer to this message with your solution 🙂

Programming Challenges - How to be a breathtaking Programmer

02 мая 2023 07:38

IMAGE EDGE DETECTION
+========+
Time: 30 minutes - 1 hour
Difficulty: Medium
Languages: Any
+========+
Given an image represented by a matrix, implement a function that applies an edge detection effect to the image using a convolution matrix.
+========+
Please answer to this message with your solution 🙂

Programming Challenges - How to be a breathtaking Programmer

30 апреля 2023 08:37

LCS
+========+
Time: 30 minutes - 1 hour
Difficulty: Medium
Languages: Any
+========+
Given two strings, implement a function that finds the length of the longest common subsequence of the two strings, using dynamic programming approach.
+========+
Please answer to this message with your solution 🙂

Programming Challenges - How to be a breathtaking Programmer

26 апреля 2023 12:37

BFS
+========+
Time: 30 minutes - 1 hour
Difficulty: Easy
Languages: Any
+========+
Given a graph represented by an adjacency list, 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

22 апреля 2023 09:36

LIS
+========+
Time: 30 minutes - 1 hour
Difficulty: Medium
Languages: Any
+========+
Given a list of integers, implement a function that finds the length of the longest increasing subsequence of the list, using dynamic programming approach.
+========+
Please answer to this message with your solution 🙂

Programming Challenges - How to be a breathtaking Programmer

18 апреля 2023 12:34

DFS
+========+
Time: 30 minutes - 1 hour
Difficulty: Easy
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

14 апреля 2023 12:34

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