Using Depth First Search Algorithm to Complete the Minimax Tree
You are given a binary tree root representing a game state of a two person game. Every internal node is filled with an empty value of 0 while the …
Category: c / c++
Just Another Sudoku Solver in Depth First Search (and BackTracking) Algorithm
Sudoku is a puzzle where you’re given a partially-filled 9 by 9 grid with digits. The objective is to fill the grid with the constraint that every row, column, …
Using Breadth First Search Algorithm to Count the Number of Leaves and Internal Nodes in Binary Tree
Given the root to a binary tree root, return a list of two numbers where the first number is the number of leaves in the tree and the second …
Greedy Algorithm to Maximize the Split Product (Integer Break)
Given an integer n, find two or more integers such that their sum is equal to n, where the product of these integers is maximized, and return this product. …
Algorithms to Make List Values Equal
You are given a list of integers nums. Consider an operation where we select some subset of integers in the list and increment all of them by one. Return …