Similar Topics

Opera

10+ posts

Popular articles

Recent articles

A Product Array Puzzle | Set 3

Last Updated: 26 September 2021

Given an array arr[] consisting of N integers, the task is to construct a Product array of the same size without using division ('/') operator such that each array element ...read more

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

Last Updated: 15 July 2022

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 the elements of arr[] except arr[i]. S ...read more

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

Last Updated: 09 December 2022

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 round. Ro ...read more

Interview Experiences

Opera Interview Experience | Set 3 (IOG division)

Last Updated: 28 June 2021

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 were ...read more

Interview Experiences

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

Last Updated: 01 February 2023

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 considered as 1.All single digit numbers are con ...read more

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

Last Updated: 25 September 2015

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 Experiences

Opera Solutions

Interview Experience Opera Solutions, Noida

Last Updated: 21 June 2021

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 e ...read more

Interview Experiences

Opera Solutions

Travelling Salesman Problem using Dynamic Programming

Last Updated: 19 April 2023

Travelling Salesman Problem (TSP):Given a set of cities and the distance between every pair of cities, the problem is to find the shortest possible route that visits every...read more

Dynamic Programming

Find the number of islands using DFS

Last Updated: 01 August 2023

Given a binary 2D matrix, find the number of islands. A group of connected 1s forms an island. For example, the below matrix contains 4 islands.Example:Input: mat[][] = {{...read more

Streamoid Technologies

graph-connectivity

Product of Array except itself

Last Updated: 27 June 2023

Given an array arr[] of n integers, construct a Product Array prod[] (of the same size) such that prod[i] is equal to the product of all the elements of arr[] except arr[i ...read more