How to arrange N queens in O(N) time
How to efficiently solve the N Queens problem with a staircase pattern arrangement if you just need one solution.
Articles
-
-
Solving a tricky OA problem related to server clustering
A solution for a tricky Tricky OA problem related to clustering
-
A "hard" Leetcode problem with a stupidly efficient solution
Solving the Leetcode 24 Game by precomputing the results in a relatively small associative array, although it is marked as a HARD problem.
-
Leetcode Pens and Pencils problem in O(log(min(cost1,cost2,total))) time
A clever logarithmical solution for Leetcode Pens and Pencils problem
