Position:Production Engineer
q1. if you had a program to play the Battleship game, and you had the method "fireBomb()" that took coords on a square matrix of any size, implement an algorithm that has to use the "fireBomb()" method the least amount of times to destroy a battleship.
q.2Print Fastest To Slowest Dianosaurs from CSV
if anyone have leetcode links or optimal solutions please share :)