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
Tag Archives: Oxigen Wallet
Given an integer array with repeated elements, the task is to find sum of all distinct elements in array.Examples: Input : arr[] = {12, 10,… 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
Given a number n, find the smallest number that has same set of digits as n and is greater than n. If n is the… 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… 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 arr[] of positive numbers, the task is to find the maximum sum of a subsequence with the constraint that no 2 numbers… Read More
.png)
What's New
Most popular in Oxigen Wallet
Most Visited Articles