Tag Archives: Oxigen Wallet

There are n houses build in a line, each of which contains some value in it. A thief is going to steal the maximal value… Read More
Given an integer array with repeated elements, the task is to find sum of all distinct elements in array. Examples: Input : arr[] = {12,… Read More
First Round: Online coding test on Cocubes.com Q1. Given two integers m and n write the function to compute the number of bit changes required… Read More
Written Round There was 2 coding questions conducted on cocubes platform Time limit- 40 mins 1. Find the sum of all non- repeated elements in… Read More
It was 3 round process. Round 1: There were 2 online coding question on cocubes. 1. Find the sum of all non repeating element. 2.… Read More
We have discussed AVL insertion in the previous post. In this post, we will follow a similar approach for deletion. Steps to follow for deletion.… Read More
AVL tree is a self-balancing Binary Search Tree (BST) where the difference between heights of left and right subtrees cannot be more than one for… Read More
Given an array of positive numbers, find the maximum sum of a subsequence with the constraint that no 2 numbers in the sequence should be… Read More