Given a pointer to the root node of a binary tree, return true if the binary tree is height-balanced. A height-balanced binary tree is a Binary tree in which the difference between the left subtree height and the right subtree height is at most 1. Height of a binary tree is the number of edges between the root node to the longest leaf node.

Height Balanced Binary Tree

Given a string of alphabets (from a to z), Print the count of the character appearing in the string right next to it. This is also called Run Length Encoding or String Compression.

String Compression

Given a 2D matrix of numbers, return a spiral traversal of the matrix in the clockwise direction.

Hewlett-Packard

Height Balanced Binary Tree

String Compression

Spiral Traversal

Pages

Algochurn

Frontend Churn

Friends

Links