## Find maximum possible stolen value from houses

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 »

## Find sum of non-repeating (distinct) elements in an array

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 »

## Oxigen Wallet Interview Experience | Set 3 (On- Campus)

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 »

## Oxigen Wallet Interview Experience | Set 2 (On- Campus)

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 »

## Oxigen Wallet Interview Experience | Set 1 (On-Campus)

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 »

## Find next greater number with same set of digits

Given a number n, find the smallest number that has same set of digits as n and is greater than n. If x is the… Read More »

## AVL Tree | Set 2 (Deletion)

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 | Set 1 (Insertion)

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 »

## Maximum sum such that no two elements are adjacent

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 »