## A product array puzzle | Set 2 (O(1) Space)

Given an array arr[] of n integers, construct a Product Array prod[] (of same size) such that prod[i] is equal to the product of all… Read More »

## Opera Interview Experience | Set 4 ( On Campus-Software Engineer )

Opera Solutions visited our college for full time Software Engineer profile. Selection process was consist of 6 rounds. Total 138 students were there for written… Read More »

## Opera Interview Experience | Set 3 (IOG division)

First round was a test that had 35 questions having negative marks. The test consisted of aptitude, technical questions in dbms, os,  programming questions, and there… Read More »

## Print all Jumping Numbers smaller than or equal to a given value

A number is called as a Jumping Number if all adjacent digits in it differ by 1. The difference between ‘9’ and ‘0’ is not… Read More »

## Opera Interview Experience | Set 2 (On-Campus For Software Engineer)

WRITTEN TEST: Consists of questions on: A) General computer Science:- os, networking,library functions in c/c++ etc. B) Data structures and Algorithms(Highest wattage) C) Sq l… Read More »

## Interview Experience Opera Solutions, Noida

Day 1: Technical MCQ questions (90 mins) Round 1 consists of three sections- general question- contains questions on unix commands, languages etc. programming- questions on… Read More »

## Travelling Salesman Problem | Set 1 (Naive and Dynamic Programming)

Travelling Salesman Problem (TSP): Given a set of cities and distance between every pair of cities, the problem is to find the shortest possible route… Read More »

## Find the number of islands | Set 1 (Using DFS)

Given a boolean 2D matrix, find the number of islands. A group of connected 1s forms an island. For example, the below matrix contains 5… Read More »

## A Product Array Puzzle

Given an array arr[] of n integers, construct a Product Array prod[] (of same size) such that prod[i] is equal to the product of all… Read More »