BINARY SEARCH
+========+
Time: 30 minutes - 1 hour
Difficulty: Medium
Languages: Any
+========+
Implement a function that performs a binary search on a sorted list of integers and returns the index of the target value if found, or -1 if not found.
+========+
Please answer to this message with your solution :)

TREE TRAVERSAL
+========+
Time: 1 hour - 2 hours
Difficulty: Medium
Languages: Any
+========+
Given the root of a binary tree, implement functions to perform pre-order, in-order, and post-order traversal of the tree and return a list of the visited nodes.
+========+
Please answer to this message with your solution :)

REVERSE A STRING
+========+
Time: 15 minutes
Difficulty: Easy
Languages: Any
+========+
Implement a function that takes in a string and returns the reversed version of the string.
+========+
Please answer to this message with your solution :)

PRINT ALL PATHS
+========+
Time: 1 hour - 2 hours
Difficulty: Medium
Languages: Any
+========+
Given a directed graph and a source vertex, implement a function that prints all the paths from source vertex to every other vertex in the graph.
+========+
Please answer to this message with your solution :)

REVERSE INTEGER
+========+
Time: 15 minutes
Difficulty: Easy
Languages: Any
+========+
Given a 32-bit signed integer, implement a function to reverse digits of an integer.
+========+
Please answer to this message with your solution :)

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 :)

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 :)

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 :)

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 :)

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.

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 :)

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 :)

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 🙂

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 🙂

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 🙂

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 🙂

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 🙂

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 🙂