Similar Topics

Web Technologies32.1K+ articles

DSA20.4K+ articles

Amazon1.9K+ articles

Tree911+ articles

Microsoft811+ articles

Google398+ articles

Oracle354+ articles

Adobe280+ articles

OYO94+ articles

Ola Cabs79+ articles

Boomerang Commerce

7 posts

Connect Nodes at same Level (Level Order Traversal)

Last Updated: 04 October 2024

Given a binary tree, the task is to connect the nodes that are at the same level. Given an additionnextRightpointer for the same. Initially, all the next rightpointers poi...read more

article_image

Boomerang Commerce

tree-level-order

Boomerang Commerce Interview Experience | Set 2 (Associate Software Developer 1)

Last Updated: 17 April 2016

There were 6 rounds in total.1) Online coding - hackerearthThree Questions in 1.15hr. Total 50 marks.Questions were in increasing order of the difficulty as per the marks....read more

Interview Experiences

Boomerang Commerce

Last Updated: 03 October 2025

Merge sort is a popular sorting algorithm known for its efficiency and stability. It follows the Divide and Conquer approach. It works by recursively dividing the input...read more

article_image

Divide and Conquer

Target Corporation

Boomerang Commerce

Connect nodes at same level using constant extra space

Last Updated: 13 February 2025

Given a binary tree, the task is to connect the nodes that are at the same level. Given an additionnextRightpointer for the same. Initially, all the nextRightpointers poin...read more

article_image

Boomerang Commerce

Connect nodes at same level

Last Updated: 01 April 2026

Given a binary tree, connect the nodes that are at the same level. Given an addition nextRight pointer for the same. Initially, all the next right pointers point to garbag...read more

article_image

Boomerang Commerce

A Boolean Matrix Question

Last Updated: 11 December 2024

Given a boolean matrixmatwhere each cell contains either 0 or 1, the task is to modify it such that if a matrix cell matrix[i][j] is 1 then all the cells in its ithrow and...read more

Boomerang Commerce

Check if a Binary Tree is BST or not

Last Updated: 23 April 2026

Given the root of a binary tree, determine whether it is a Binary Search Tree (BST).A Binary Search Tree is a binary tree that satisfies the following conditions:All nodes...read more

article_image

Binary Search Tree

Boomerang Commerce