Programming Challenges - How to be a breathtaking Programmer

12 Apr 2023 11:34

WORD BREAK
+========+
Time: 30 minutes - 1 hour
Difficulty: Medium
Languages: Any
+========+
Given a string and a list of words, implement a function that checks whether the string can be segmented into a space-separated sequence of one or more dictionary words, using dynamic programming approach.
+========+
Please answer to this message with your solution 🙂

Programming Challenges - How to be a breathtaking Programmer

08 Apr 2023 12:32

MINIMUM SPANNING TREE
+========+
Time: 1 hour - 2 hours
Difficulty: Hard
Languages: Any
+========+
Given a graph represented by an adjacency matrix, implement a function that finds the minimum spanning tree of the graph using Prim's algorithm.
+========+
Please answer to this message with your solution 🙂

Programming Challenges - How to be a breathtaking Programmer

04 Apr 2023 09:31

WORD LADDER
+========+
Time: 1 hour - 2 hours
Difficulty: Hard
Languages: Any
+========+
Given two words and a list of words, implement a function that finds the shortest sequence of transformations from the start word to the end word, where each transformation is a change of a single letter to any other letter.
+========+
Please answer to this message with your solution 🙂

Programming Challenges - How to be a breathtaking Programmer

30 Mar 2023 12:31

ALL PAIRS SHORTEST PATH
+========+
Time: 1 hour - 2 hours
Difficulty: Hard
Languages: Any
+========+
Given a graph represented by an adjacency matrix, implement a function that finds the shortest path between every pair of vertices using the Floyd-Warshall algorithm.
+========+
Please answer to this message with your solution 🙂

Programming Challenges - How to be a breathtaking Programmer

26 Mar 2023 14:31

STRING COMPRESSION
+========+
Time: 30 minutes - 1 hour
Difficulty: Easy
Languages: Any
+========+
Given a string, implement a function that performs basic string compression using the counts of repeated characters.
+========+
Please answer to this message with your solution 🙂

Programming Challenges - How to be a breathtaking Programmer

20 Mar 2023 12:29

BUBBLE SORT
+========+
Time: 15 minutes - 30 minutes
Difficulty: Easy
Languages: Any
+========+
Implement the bubble sort algorithm for sorting a list of integers.
+========+
Please answer to this message with your solution 🙂

Programming Challenges - How to be a breathtaking Programmer

12 Mar 2023 12:27

FIBONACCI
+========+
Time: 15 minutes - 30 minutes
Difficulty: Easy
Languages: Any
+========+
Implement a function that returns the nth Fibonacci number in a sequence.
+========+
Please answer to this message with your solution 🙂

Programming Challenges - How to be a breathtaking Programmer

06 Mar 2023 12:26

MAXIMUM SUM SUBSEQUENCE
+========+
Time: 30 minutes - 1 hour
Difficulty: Medium
Languages: Any
+========+
Given a list of integers, implement a function that finds the maximum sum that can be formed by selecting any contiguous subsequence of the integers.
+========+
Please answer to this message with your solution 🙂

Programming Challenges - How to be a breathtaking Programmer

02 Mar 2023 09:25

SHORTEST PATH
+========+
Time: 30 minutes - 1 hour
Difficulty: Hard
Languages: Any
+========+
Given a graph represented by an adjacency matrix and a starting vertex, implement a function that finds the shortest path to every other vertex in the graph using Dijkstra's algorithm.
+========+
Please answer to this message with your solution 🙂

Programming Challenges - How to be a breathtaking Programmer

26 Feb 2023 08:24

MAXIMUM PROFIT
+========+
Time: 30 minutes - 1 hour
Difficulty: Medium
Languages: Any
+========+
Given a list of stock prices, implement a function that finds the maximum profit that can be made by buying and selling the stock, with the restriction that you can't buy and sell the stock on the same day.
+========+
Please answer to this message with your solution 🙂

Programming Challenges - How to be a breathtaking Programmer

22 Feb 2023 13:23

MINIMUM COST PATH
+========+
Time: 30 minutes - 1 hour
Difficulty: Medium
Languages: Any
+========+
Given a matrix of integers where each cell represents the cost of traversing that cell and a starting position, implement a function that finds the path with the minimum cost from the starting position to the bottom-right corner of the matrix.
+========+
Please answer to this message with your solution 🙂

Programming Challenges - How to be a breathtaking Programmer

18 Feb 2023 07:22

CHECK PARENTHESES
+========+
Time: 15 minutes
Difficulty: Easy
Languages: Any
+========+
Given a string, implement a function that checks whether the string has balanced parentheses or not.
+========+
Please answer to this message with your solution 🙂

Programming Challenges - How to be a breathtaking Programmer

14 Feb 2023 13:16

COUNTING OCCURRENCES
+========+
Time: 15 minutes
Difficulty: Easy
Languages: Any
+========+
Given a list of integers, implement a function that counts the number of times a given integer occurs in the list.
+========+
Please answer to this message with your solution :)

Programming Challenges - How to be a breathtaking Programmer

10 Feb 2023 11:15

ANAGRAM
+========+
Time: 15 minutes
Difficulty: Easy
Languages: Any
+========+
Implement a function that takes in two strings and returns a boolean indicating whether or not the second string is an anagram of the first string.
+========+
Please answer to this message with your solution :)

Programming Challenges - How to be a breathtaking Programmer

06 Feb 2023 15:14

MAXIMUM SUBARRAY
+========+
Time: 1 hour - 2 hours
Difficulty: Medium
Languages: Any
+========+
Given an array of integers, implement a function that finds the contiguous subarray with the largest sum, and returns the sum
+========+
Please answer to this message with your solution :)

Programming Challenges - How to be a breathtaking Programmer

10 Apr 2023 12:33

TEMPLATE MATCHING
+========+
Time: 30 minutes - 1 hour
Difficulty: Medium
Languages: Any
+========+
Given two images represented by two matrices, implement a function that finds the location of the template image within the larger image using the normalized cross-correlation method.
+========+
Please answer to this message with your solution 🙂

Programming Challenges - How to be a breathtaking Programmer

06 Apr 2023 12:32

GRAPH COLORING
+========+
Time: 1 hour - 2 hours
Difficulty: Hard
Languages: Any
+========+
Given a graph represented by an adjacency matrix, implement a function that colors the graph with the minimum number of colors 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

02 Apr 2023 08:31

MAXIMUM SUBARRAY
+========+
Time: 30 minutes - 1 hour
Difficulty: Medium
Languages: Any
+========+
Given an array of integers, implement a function that finds the contiguous subarray with the largest sum of its elements.
+========+
Please answer to this message with your solution 🙂

Programming Challenges - How to be a breathtaking Programmer

28 Mar 2023 12:32

QUICKSORT
+========+
Time: 30 minutes - 1 hour
Difficulty: Medium
Languages: Any
+========+
Implement the quicksort algorithm for sorting a list of integers.
+========+
Please answer to this message with your solution 🙂

Programming Challenges - How to be a breathtaking Programmer

24 Mar 2023 07:29

BINARY TREE ZIGZAG 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 zigzag level-order traversal of the tree and return a list of lists of the nodes at each level.
+========+
Please answer to this message with your solution 🙂

Programming Challenges - How to be a breathtaking Programmer

16 Mar 2023 09:28

MAXIMUM WATER TRAPPED
+========+
Time: 30 minutes - 1 hour
Difficulty: Hard
Languages: Any
+========+
Given an array of non-negative integers representing a landscape, where the width of each bar is 1, implement a function that finds the amount of water that can be trapped in the landscape.
+========+
Please answer to this message with your solution 🙂

Programming Challenges - How to be a breathtaking Programmer

10 Mar 2023 06:27

PRIMES
+========+
Time: 30 minutes - 1 hour
Difficulty: Hard
Languages: Any
+========+
Implement a function that returns a list of all prime numbers less than a given number n
+========+
Please answer to this message with your solution 🙂

Programming Challenges - How to be a breathtaking Programmer

04 Mar 2023 13:25

MAXIMUM PRODUCT SUBSET
+========+
Time: 30 minutes - 1 hour
Difficulty: Medium
Languages: Any
+========+
Given a list of integers, implement a function that finds the maximum product that can be formed by selecting any subset of the integers.
+========+
Please answer to this message with your solution 🙂

Programming Challenges - How to be a breathtaking Programmer

28 Feb 2023 10:24

LONGEST COMMON PREFIX
+========+
Time: 30 minutes - 1 hour
Difficulty: Easy
Languages: Any
+========+
Given a list of strings, implement a function that finds the longest common prefix of the strings.
+========+
Please answer to this message with your solution 🙂

Programming Challenges - How to be a breathtaking Programmer

24 Feb 2023 16:24

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

Programming Challenges - How to be a breathtaking Programmer

20 Feb 2023 04:22

ARRAY ROTATION
+========+
Time: 15 minutes
Difficulty: Easy
Languages: Any
+========+
Given an array and a number k, implement a function that rotates the elements of the array by k positions to the right.
+========+
Please answer to this message with your solution 🙂

Programming Challenges - How to be a breathtaking Programmer

16 Feb 2023 16:17

SIMPLE ENCRYPTION
+========+
Time: 15 minutes
Difficulty: Easy
Languages: Any
+========+
Given a string, implement a simple encryption method that shifts each letter of the string by a given number of positions and returns the encoded string.
+========+
Please answer to this message with your solution :)

Programming Challenges - How to be a breathtaking Programmer

12 Feb 2023 17:15

WORD LADDER
+========+
Time: 30 minutes - 1 hour
Difficulty: Hard
Languages: Any
+========+
Given two words and a list of words, implement a function that finds the length of the shortest sequence of transformations from the start word to the end word such that only one letter can be changed at a time, and each transformed word must exist in the given list of words.

Programming Challenges - How to be a breathtaking Programmer

08 Feb 2023 09:14

LONGEST COMMON SUBSEQUENCE
+========+
Time: 30 minutes - 1 hour
Difficulty: Hard
Languages: Any
+========+
Given two sequences, implement a function that finds the length of the longest common subsequence of the two sequences and returns it.
+========+
Please answer to this message with your solution :)

Programming Challenges - How to be a breathtaking Programmer

04 Feb 2023 08:13

VOWEL COUNT
+========+
Time: 15 minutes
Difficulty: Easy
Languages: Any
+========+
Implement a function that takes in a string and returns the number of vowels in the string.
+========+
Please answer to this message with your solution :)