We use backtracking in brute force approach 1) We make a choice and hope it’s a valid one, if it happens to be valid we proceed forward 2) If the option we chose earlier happens to be wrong we go back one step to pick alternate choice, If we run out…

We say two nodes in a binary tree are cousins if they are on same level but have different parents Algorithm: Find the parent nodes and levels of the given nodes Store these in a pair to compare If they happen to have different parents and same level, then they are cousins, else they are not! The code should be self explanatory. Thanks for Reading!!1

Rotting Oranges - LeetCode You are given an m x n grid where each cell can have one of three values: 0 representing an empty cell, 1 representing…leetcode.com This is one of the classic BFS Problems(I guess you could solve using DFS too) and a great one too. Here’s one of the ways to solve it. I started out with keeping track of rotten orange’s co-ordinates(x,y) and freshOranges by traversing through the Grid

I’ve encountered this problem in an Online Assessment(OA), the requirement was not exactly traversing diagonally, but I had to do something traversing diagonally. Thinking about it during my OA hurt my brain, I had to think, after I put decent amount of thought into it, I was able to write…