--- title: "Ajay Dandge (@nobleknight) | Hashnode" description: "Software Developer. Read the latest articles by Ajay Dandge on Hashnode." url: "https://hashnode.com/@nobleknight" --- @nobleknight # Ajay Dandge @nobleknight · India · Joined July 2021 Software Developer [Website](https://nobleknightt.github.io/) ### [LeetCode #2392 Build a Matrix With Conditions, Topological Sort and Kahn's Algorithm](https://nobleknight.hashnode.dev/leetcode-2392-build-a-matrix-with-conditions-topological-sort-and-kahns-algorithm?utm_source=hashnode&utm_medium=feed) You are given a positive integer k. You are also given: a 2D integer array rowConditions of size n where rowConditions\[i\] = \[abovei, belowi\], and a 2D integer array colConditions of size m where colConditions\[i\] = \[lefti<... 3 min read · [nobleknight.hashnode.dev](https://nobleknight.hashnode.dev/leetcode-2392-build-a-matrix-with-conditions-topological-sort-and-kahns-algorithm?utm_source=hashnode&utm_medium=feed) [Jul 22, 2024](https://hashnode.com/posts/leetcode-2392-build-a-matrix-with-conditions-topological-sort-and-kahns-algorithm/669e99a7e22d17ba935713e5) ### [LeetCode #236 Lowest Common Ancestor of a Binary Tree](https://nobleknight.hashnode.dev/leetcode-236-lowest-common-ancestor-of-a-binary-tree?utm_source=hashnode&utm_medium=feed) Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.According to the definition of LCA on Wikipedia: "The lowest common ancestor is defined between two nodes p and q as the lowest node in T that has both p and q ... 1 min read · [nobleknight.hashnode.dev](https://nobleknight.hashnode.dev/leetcode-236-lowest-common-ancestor-of-a-binary-tree?utm_source=hashnode&utm_medium=feed) [Jul 17, 2024](https://hashnode.com/posts/leetcode-236-lowest-common-ancestor-of-a-binary-tree/66980d26a5773871609784b6) ### [LeetCode #1717 Maximum Score From Removing Substrings](https://nobleknight.hashnode.dev/leetcode-1717-maximum-score-from-removing-substrings?utm_source=hashnode&utm_medium=feed) You are given a string s and two integers x and y. You can perform two types of operations any number of times. Remove substring "ab" and gain x points. For example, when removing "ab" from "cabxbae" it becomes "cxbae". Remove substring "ba" and ... 3 min read · [nobleknight.hashnode.dev](https://nobleknight.hashnode.dev/leetcode-1717-maximum-score-from-removing-substrings?utm_source=hashnode&utm_medium=feed) [Jul 12, 2024](https://hashnode.com/posts/leetcode-1717-maximum-score-from-removing-substrings/6691938a2e73518ecf74cc09) ### [LeetCode #1190 Reverse Substrings Between Each Pair of Parentheses and Wormhole Teleportation Technique](https://nobleknight.hashnode.dev/leetcode-1190-reverse-substrings-between-each-pair-of-parentheses-and-wormhole-teleportation-technique?utm_source=hashnode&utm_medium=feed) You are given a string s that consists of lower case English letters and brackets. Reverse the strings in each pair of matching parentheses, starting from the innermost one. Your result should not contain any brackets. Let's traverse string s charac... 2 min read · [nobleknight.hashnode.dev](https://nobleknight.hashnode.dev/leetcode-1190-reverse-substrings-between-each-pair-of-parentheses-and-wormhole-teleportation-technique?utm_source=hashnode&utm_medium=feed) [Jul 11, 2024](https://hashnode.com/posts/leetcode-1190-reverse-substrings-between-each-pair-of-parentheses-and-wormhole-teleportation-technique/669047b49ac53a3523ae5c08) ### [LeetCode #1598 Crawler Log Folder](https://nobleknight.hashnode.dev/leetcode-1598-crawler-log-folder?utm_source=hashnode&utm_medium=feed) The Leetcode file system keeps a log each time some user performs a change folder operation. The operations are described below: "../" : Move to the parent folder of the current folder. (If you are already in the main folder, remain in the same fold... 1 min read · [nobleknight.hashnode.dev](https://nobleknight.hashnode.dev/leetcode-1598-crawler-log-folder?utm_source=hashnode&utm_medium=feed) [Jul 10, 2024](https://hashnode.com/posts/leetcode-1598-crawler-log-folder/668ed47a2caff963e91aa25c)