## Find product of sums of data of leaves at same levels | Set 2

Given a Binary Tree, return following value for it. For every level, compute sum of all leaves if there are leaves at this level. Otherwise… Read More »

- How can one become good at Data structures and Algorithms easily?
- How do Dynamic arrays work?
- Find the node with maximum value in a Binary Search Tree
- Remove last node of the linked list
- Iterative Method To Print Left View of a Binary Tree
- Sort the array of strings according to alphabetical order defined by another string
- Fibonacci Heap - Deletion, Extract min and Decrease key
- Zig-Zag traversal of a Binary Tree using Recursion
- Number of array elements derivable from D after performing certain operations
- Print all nodes between two given levels in Binary Tree
- Sum of nodes at maximum depth of a Binary Tree | Set 2
- Print all odd nodes of Binary Search Tree
- Number of subarrays have bitwise OR >= K
- Reverse zigzag Traversal of a Binary Tree
- Count all Grandparent-Parent-Child Triplets in a binary tree whose sum is greater than X
- Number of sub-strings which are anagram of any sub-string of another string
- A variation of Rat in a Maze : multiple steps or jumps allowed
- Difference between Stack and Queue Data Structures
- Sum and Product of minimum and maximum element of Binary Search Tree
- Minimum number of edges between two vertices of a graph using DFS
- Building Expression tree from Prefix Expression
- Print All Leaf Nodes of a Binary Tree from left to right | Set-2 ( Iterative Approach )
- Sum of minimum elements of all possible sub-arrays of an array
- Delete all odd or even positioned nodes from Circular Linked List
- Sum of all the elements in an array divisible by a given number K
- Sum and Product of the nodes of a Circular Singly Linked List which are divisible by K
- Find maximum among all right nodes in Binary Tree
- Finding the path from one vertex to rest using BFS
- Product of all nodes in a Binary Tree
- Multidimensional Collections in Java

Given a Binary Tree, return following value for it. For every level, compute sum of all leaves if there are leaves at this level. Otherwise… Read More »

Prerequisite: XOR Linked List – A Memory Efficient Doubly Linked List | Set 1 XOR Linked List – A Memory Efficient Doubly Linked List |… Read More »

Given an expression string, write a python program to find whether a given string has balanced parentheses or not. Examples: Input : {[]{()}} Output :… Read More »

Given a complete binary tree, traverse it such that all the boundary nodes are visited in Anti-Clockwise order starting from the root. Example: Input: 18… Read More »

Given an integer X and a square matrix mat[][], the task is to remove the first X rows and columns from the given matrix and… Read More »

The whole process was online. All the interviews were help via HackerRank CodePair Platform in our TPC office since they did not visit the campus.… Read More »

Given a Character matrix as input, the task is to check whether all the enemies are killed or not based on below conditions: 1. The… Read More »

Given a string str containing only characters 0, 1 and 2, you can swap any two adjacent (consecutive) characters 0 and 1 or any two… Read More »

Given two integers X and Y and an array of N integers. Player A can decrease any element of the array by X and Player… Read More »

Given a matrix mat[][] containing the characters Z, P and * where Z is a zombie, P is a plant and * is a bare… Read More »

Given a pattern pat and a string array sArr[], the task is to count the number of strings from the array that ends with the… Read More »

Given a String of three Colours(G, B, Y) as input, the task is to print the resultant combined colour formed according to the rule given… Read More »

Applied through employee referral Round 1: I was sent a link 40 multiple choice questions were there 20 aptitude questions and rest 20 questions from java fundamentals,… Read More »

Given a Singly Linked List. The task is to check if the absolute difference between the consecutive nodes in the linked list is 1 or… Read More »

Given an adjacency list representation of a directed graph, the task is to find the path from source to every other node in the graph… Read More »