How to Design a Tic-Tac-Toe Game?
Design a Tic-tac-toe game that is played between two players on a n x n grid. You may assume the following rules: A move is guaranteed to be valid …
Category: algorithms
The Process Killing Algorithms using Depth First Search or Breadth First Search (Kill a Process)
Given n processes, each process has a unique PID (process id) and its PPID (parent process id). Each process only has one parent process, but may have one or …
Breadth-First Search Algorithm to Solve Puzzle (Rotting Oranges) in a Grid
In a given grid, each cell can have one of three values: the value 0 representing an empty cell; the value 1 representing a fresh orange; the value 2 …
Several Algorithms to Compute the Score of Parentheses
Given a balanced parentheses string S, compute the score of the string based on the following rule: () has score 1 AB has score A + B, where A …
Two Pointer Algorithm to Find Maximum Two Sum Less Than K
June 30, 2019
algorithms, brute force, c / c++, data structure, Hash Map / Hash Set, python, Two Pointer
1 Comment
Given an array A of integers and integer K, return the maximum S such that there exists i < j with A + A = S and S < …