Kallol Bairagi's Blog
Series

LeetCode Grind 75 in Java

Articles in this series

#104.Maximum Depth of Binary Tree [LeetCode Grind 75 in Java]

Oct 8, 20231 min read

[Problem Link] https://leetcode.com/problems/maximum-depth-of-binary-tree/ · class Solution { public int maxDepth(TreeNode root) { if(root ==...

#104.Maximum Depth of Binary Tree [LeetCode Grind 75 in Java]

#876.Middle of the Linked List [LeetCode Grind 75 in Java]

Oct 8, 20231 min read

[Problem Link] https://leetcode.com/problems/middle-of-the-linked-list/ · class Solution { public ListNode middleNode(ListNode head) { ...

#876.Middle of the Linked List [LeetCode Grind 75 in Java]

#543.Diameter of Binary Tree [LeetCode Grind 75 in Java]

Oct 8, 20231 min read

[Problem Link] https://leetcode.com/problems/diameter-of-binary-tree/ · class Solution { private int diameter = 0; //diameter is longest length...

#543.Diameter of Binary Tree [LeetCode Grind 75 in Java]

#67.Add Binary [LeetCode Grind 75 in Java]

Oct 8, 20231 min read

[Problem Link] https://leetcode.com/problems/add-binary/ · class Solution { public String addBinary(String a, String b) { int ptra =...

#67.Add Binary [LeetCode Grind 75 in Java]

#169.Majority Element [LeetCode Grind 75 in Java]

Oct 8, 20231 min read

[Problem Link] https://leetcode.com/problems/majority-element/ · class Solution { public int majorityElement(int[] nums) { int ans = -1; ...

#169.Majority Element [LeetCode Grind 75 in Java]

#206.Reverse Linked List [LeetCode Grind 75 in Java]

Oct 8, 20231 min read

[Problem Link] https://leetcode.com/problems/reverse-linked-list/ · class Solution { public ListNode reverseList(ListNode head) { ListNode...

#206.Reverse Linked List [LeetCode Grind 75 in Java]