Skip to content

Tag Archives: Boomerang Commerce

Write a function to connect all the adjacent nodes at the same level in a binary tree. Example:  Input Tree A / \ B C… Read More
There were 6 rounds in total. 1) Online coding – hackerearth Three Questions in 1.15hr. Total 50 marks. Questions were in increasing order of the… Read More
The Merge Sort algorithm is a sorting algorithm that is based on the Divide and Conquer paradigm. In this algorithm, the array is initially divided… Read More
Write a function to connect all the adjacent nodes at the same level in a binary tree. Structure of the given Binary Tree node is… Read More
Given a Binary Tree, The task is to connect all the adjacent nodes at the same level starting from the left-most node of that level,… Read More
Given a boolean matrix mat[M][N] of size M X N, modify it such that if a matrix cell mat[i][j] is 1 (or true) then make… Read More
A binary search tree (BST) is a node-based binary tree data structure that has the following properties.  The left subtree of a node contains only… Read More

Start Your Coding Journey Now!