Theory DFS Theory Arrays Two Sum Buy and Sell Stocks Contains Duplicate Product of Array Except Self Maximum Subarray Maximum Product Subarray Three Sum Container with Most Water Pascal’s Triangle Dynamic Programming Climbing Stairs Coin Change Graphs Number of Islands Clone Graphs Max Area of Island Trees Validate Binary Search Tree Invert Binary Tree Binary Tree Level Order Traversal Maximum Depth of Binary Tree Binary Search Binary Search Find Minimum in Rotated Sorted Array Search a 2D Matrix Binary Tree Postorder Traversal 2ta1O73z0ic

Description Developed an unbeatable Connect 4 AI machine alongside a group of “preternship” software engineers. Utilized backtracking, recursion, and the Mini-Max Algorithm for optimal gameplay. The minimax algorithm is a common technique used in AI to make decisions and determine optimal moves in games. It works by simulating all possible moves and evaluating the outcome of each move to select the best one. Step 1 Click here to download file Step 2 Open the file and add a shebang on the top of it that references your computer’s python interpreter If you’re using MacOS, this is it: #!