https://leetcode.com/problems/single-element-in-a-sorted-array/ Given a sorted array that contains n numbers out of which except one value all the other values are repeated twice. Find the number in the array that occurs only once. Do it with constant space and logn time.
Given a grid, with each cell containing a direction (U, D, L, R) meaning they can only go to the cell above it or below it to to it's left or to its right from the current cell.
Determine if it's possible to go from top left to bottom right.
Follow up: https://leetcode.com/problems/minimum-cost-to-make-at-least-one-valid-path-in-a-grid/
if you are allowed to break this direction rule at any cell and that you have to pay a penalty for everytime you break it, what's the minimum cost to get from top left to bottom right
I could answer the questions but not few follow ups .. will be happy to discuss the solutions. Thank you :)