Serialize and Deserialize Binary TreeProblem Serialization is the process of converting a data structure or object into a sequence of bits so that it can be stored in a file or memory buffer, or transmitted across a network connection liOct 10 · 3 min readchetan77.hashnode.dev
Recover Binary Search TreeProblem You are given the root of a binary search tree (BST), where the values of exactly two nodes of the tree were swapped by mistake. Recover the tree without changing its structure. (link) ExampleOct 6 · 3 min readchetan77.hashnode.dev
Java 17 - One consistent syntax referenceGoal: One consistent, modern syntax reference for Java, DSA & backend interviews. 1. Comparator Integer.compare(a,b); // ⭐ Ascending (avoid a-b overflow) Integer.compare(b,a); // ⭐ Descending a.Jul 18 · 3 min readchetan77.hashnode.dev
Shortest Path in a Grid with Obstacles EliminationProblem You are given an m x n integer matrix grid where each cell is either 0 (empty) or 1 (obstacle). You can move up, down, left, or right from and to an empty cell in one step. Return the minimum Jul 11 · 9 min readchetan77.hashnode.dev
Fractional KnapsackProblem Given two arrays, val[] and wt[] , representing the values and weights of items, and an integer capacity representing the maximum weight a knapsack can hold, determine the maximum total value Jun 7 · 2 min readchetan77.hashnode.dev
