Another Casual Coder

The problem this weekend asks for the number of cells that are not guarded. Since the limits of the grid are in the 10^5 range, we're then looking for a O(N) solution. First, it would be wise to add the positions of the guards and the walls in handy hash-tables. Relatively simple. After that, think this way: if you scan the grid in a left-to-right analyzing each row, you can increment the cells that are not reached by a guard in that row from left to right. Any cell that has a 1 at the end of this operation is free from guards in that row from left to right . Now apply the same approach in the other 3 directions: right to left, top down and bottoms-up. By doing so, at the very end, any cell that reaches the number 4 is free from any guard. And that's your answer. Thus, this would be a 4*m*n, and since m*n<=10^5 (as per the constraint), then the solution becomes O(4*10^5), which is very tractable and considered linear in this case. Code is down below, cheers, ACC. Count Ungua

Problem looks scarier than it actually is. There is a set of circles and you need to find the integer points within them. The caveat which is what makes this problem easy is that the number of points to cover is small, in the 0-100 range. Taking into account the radius too, you might want to extrapolate to -100 to 200, covering about 300 X's, 300 Y's and 200 circles, hence a total execution time of about 18M steps, which runs in a blink of an eye. Code below, cheers, ACC. Count Lattice Points Inside a Circle - LeetCode 2249. Count Lattice Points Inside a Circle Medium 64 125 Add to List Share Given a 2D integer array  circles  where  circles[i] = [x i , y i , r i ]  represents the center  (x i , y i )  and radius  r i  of the  i th  circle drawn on a grid, return  the  number of lattice points   that are present inside  at least one  circle . Note: A  lattice point  is a point with integer coordinates. Points that lie  on the circumference of a circle  are also considered to be

Wow, post #500 :) This is an easy LC problem. It is interesting that the solution requires only counting the number of occurrences of each digits, storing in a small array, and then using that to create the largest value. If you can see the implementation, it shows two nested loops, but upon a closer look into the implementation, you'll notice that the outer loop executes in O(LogN) where N is the input number, and the nested loops cannot go beyond 10 steps no matter what, hence the overall Big-O time becomes O(LogN) despite the N^2-like implementation. Code is down below, cheers, ACC. Largest Number After Digit Swaps by Parity - LeetCode 2231. Largest Number After Digit Swaps by Parity Easy 122 133 Add to List Share You are given a positive integer  num . You may swap any two digits of  num  that have the same  parity  (i.e. both odd digits or both even digits). Return  the  largest  possible value of  num  after  any  number of swaps.   Example 1: Input: num = 1234 Output: 3412

I think the use of a full-fledge Math Expression Evaluator (MEE) might be too overkill for solving this particular problem, but it is always good to have an MEE in your portfolio of tools in case it is needed. The hard part of this problem is actually the parsing of the expression to create the final one - not actually hard, just a little annoying with the placement of the indexes. Once you have it, use the MEE and save the smallest val. Code is down below, cheers, ACC. Minimize Result by Adding Parentheses to Expression - LeetCode 2232. Minimize Result by Adding Parentheses to Expression Medium 86 188 Add to List Share You are given a  0-indexed  string  expression  of the form  "<num1>+<num2>"  where  <num1>  and  <num2>  represent positive integers. Add a pair of parentheses to  expression  such that after the addition of parentheses,  expression  is a  valid  mathematical expression and evaluates to the  smallest  possible value. The left parenthes

I think a problem like this one is more like a standard definition of a prefix sum. It is asking, begging for a prefix sum solution. Take a look: Maximum Sum Score of Array - LeetCode 2219. Maximum Sum Score of Array Medium 14 6 Add to List Share You are given a  0-indexed  integer array  nums  of length  n . The  sum  score  of  nums  at an index  i  where  0 <= i < n  is the  maximum  of: The sum of the  first   i + 1  elements of  nums . The sum of the  last   n - i  elements of  nums . Return  the  maximum   sum  score  of  nums  at any index.   Example 1: Input: nums = [4,3,-2,5] Output: 10 Explanation: The sum score at index 0 is max(4, 4 + 3 + -2 + 5) = max(4, 10) = 10. The sum score at index 1 is max(4 + 3, 3 + -2 + 5) = max(7, 6) = 7. The sum score at index 2 is max(4 + 3 + -2, -2 + 5) = max(5, 3) = 5. The sum score at index 3 is max(4 + 3 + -2 + 5, 5) = max(10, 5) = 10. The maximum sum score of nums is 10. Example 2: Input: nums = [-3,-5] Output: -3 Explanation: T