ad1tyaVMoving to a new city — USAI recently moved to a new city for work, to Chicago, from Philadelphia.May 19, 2022May 19, 2022
ad1tyaVGenerate-Parentheses Brute Force to Optimal LeetcodeWe 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…Aug 2, 2021Aug 2, 2021
ad1tyaVFind if two nodes are cousins in Binary TreeWe say two nodes in a binary tree are cousins if they are on same level but have different parentsJul 1, 2021Jul 1, 2021
ad1tyaVRotting Oranges LeetcodeThis is one of the classic BFS Problems(I guess you could solve using DFS too) and a great one too.Jun 13, 2021Jun 13, 2021
ad1tyaVDiagonal Traversal of Matrix using DFSI’ve encountered this problem in an Online Assessment(OA), the requirement was not exactly traversing diagonally, but I had to do something…Jun 8, 2021Jun 8, 2021
