K nearest Element in BST

K nearest Element in BST

  July 05, 2022    

---

Idea is to use a queue in inorder fashion which will make sure that the output is in sorted orderIf queue size>=k which means we have to chek if first of the queue is not nearer to the current root element then poll from the queue and add current    void KnearestElement(Node root, int k, int x, Queue<Integer> q)  {    if(root == null)    ...

Read More

Reverse LinkedList in group of K

Reverse LinkedList in group of K

  May 09, 2022    

---

Idea is to use recursion and reverse K list iteratively and use recursive method to link k diff. reversed linkedList  Solution :public static Node reverse(Node head, int k)    {        if(head == null) return head;        int cur = 0;    Node itr = head;    Node next = null;  ...

Read More

Sum of Nodes with Even-Valued Grandparent Java Solution

Sum of Nodes with Even-Valued Grandparent Java Solution

  May 03, 2022    

---

Problem:Given the root of a binary tree, return the sum of values of nodes with an even-valued grandparent. If there are no nodes with an even-valued grandparent   Solution: public int sumEvenGrandparent(TreeNode root) {        ArrayList<TreeNode> list = new ArrayList<>();        fillList(root, list);       ...

Read More

Deepest Leaves Sum Java Solution

Deepest Leaves Sum Java Solution

  May 03, 2022    

---

Problem:Given the root of a binary tree, return the sum of values of its deepest leaves.  Solution: Idea is to use BFS/ Level order Traversalpublic int deepestLeavesSum(TreeNode root) {        Queue<TreeNode> q = new LinkedList<>();        int curSum = 0;        int maxSum...

Read More

Corresponding Node of a Binary Tree in a Clone Tree Solution

Corresponding Node of a Binary Tree in a Clone Tree Solution

  May 03, 2022    

---

Problem:Given two binary trees original and cloned and given a reference to a node target in the original tree.The cloned tree is a copy of the original tree.Return a reference to the same node in the cloned tree.   Solution:public final TreeNode getTargetCopy(final TreeNode original, final TreeNode cloned, final TreeNode target) {        if(original ==...

Read More

Remove Element Java Solution

Remove Element Java Solution

  May 02, 2022    

---

 Problem :Given an integer array nums and an integer val, remove all occurrences of val in nums in-place. The relative order of the elements may be changed.Input: nums = [3,2,2,3], val = 3Output: 2, nums = [2,2]Explanation: Your function should return k = 2, with the first two elements of nums being 2.It does not matter what you leave beyond the returned kSolution: public int removeElement(int[]...

Read More

Valid Parentheses Java Solution

Valid Parentheses Java Solution

  May 02, 2022    

---

Problem:Given a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.An input string is valid if:    Open brackets must be closed by the same type of close brackets.    Open brackets must be closed in the correct order.   Solution:class Solution {    public boolean isValid(String...

Read More