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 🙂

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 🙂

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 🙂

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 🙂

16,000 subscribers. That's a lot!

Thank you guys. So happy ❤️

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 🙂

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 🙂

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 🙂

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 🙂

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 🙂

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 🙂

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 🙂

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 🙂

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 🙂

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 🙂

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 🙂

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 🙂

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 🙂

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 🙂

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!