Invert a binary tree public static TreeNode invertBinaryTree(TreeNode root) {if (root == null) {return...
Helpful System Design Tools and Templates Draw.io Visual paradigm Lucid chart 2. Templates Problem...
Pramp BigOCheatSheet Hackerrank Interviewing.io Grokking the system design interview Cracking the coding interview Leetcode
Delete the remote branch git push -d origin <branch_name> Delete the local branch git...
public class LengthOfLongestSubstring { public static int lengthOfLongestSubstring(String s) { if (s == null)...
public class SortedSquare { public static int sortedSquare(int nums) { int result = new...
package us.inest.app.dcp.recursion; import us.inest.app.dcp.tree.TreeNode; public class SumOfLeftLeaves { public static int sumOfLeftLeaves(TreeNode root) {...
LeetCode link: https://leetcode.com/problems/remove-nth-node-from-end-of-list/submissions/684704570/ Java Solution