Round 1: Written test on their own platform. 10-15 Java MCQs. Coding Q1 – Convert a given tree to its Sum Tree , Q2 –Remove duplicates from… Read More »

#
All Medium Articles

The tasks of the Error Handling process are to detect each error, report it to the user, and then make some recover strategy and implement… Read More »

Consider a series of numbers composed of only digits 2, 3, 5, 7 (primes). First few numbers in the series are 2, 3, 5, 7,… Read More »

Given a midpoint of line(m1, m2) and one coordinate of a line (x1, y1), find the other end point(x2, y2) of a line Examples: Input… Read More »

Given N numbers and Q queries, each query consists of L and R. Task is to write a program which prints the count of numbers… Read More »

Given a binary tree, task is to find subtree with maximum sum in tree. Examples : Input : 1 / \ 2 3 / \… Read More »

Given a rectangular matrix M[0…n-1][0…m-1], and queries are asked to find the sum / minimum / maximum on some sub-rectangles M[a…b][e…f], as well as queries… Read More »

Java 9 onwards, you can include private methods in interfaces. Before Java 9 it was not possible. Interfaces till Java 7 In Java SE 7… Read More »

Round 1: Online Test – Codility Round Test Duration : 90 mins The first round comprised of around 30 questions mostly on Java in which… Read More »

Given an array of elements, task is to sort these elements using stack. Prerequisites : Stacks Examples : Input : 8 5 7 1 9… Read More »

Telephonic Interview 1. (Telephonic + Google Docs Shared) Q1. Given an array of integers, you need to find the local maxima. Example : [1 3… Read More »

Introduction Go is a procedural programming language. It was developed in 2007 by Robert Griesemer, Rob Pike, and Ken Thompson at Google but launched in… Read More »

Given a graph with N nodes numbered from 1 to N and M edges and an array of numbers from 1 to N. Check if… Read More »

Given a matrix m[ ][ ] of size n x n consisting of integers and given a character ‘x’ indicating the direction. Value of ‘x’… Read More »

Prerequisite – K – Map (Karnaugh Map) Implicant is a product/minterm term in Sum of Products (SOP) or sum/maxterm term in Product of Sums (POS)… Read More »

Message dialogs provide information to the user. Message dialogs are created with the JOptionPane.showMessageDialog() method. We call the static showMessageDialog() method of the JOptionPane class… Read More »

Consider the following C program. [sourcecode language=”C”] #include <stdio.h> int main(void) { int a = ‘d’; printf("%d\n", a); /*OUTPUT – 100 (ASCII Code for character… Read More »

Given N and M, task is to find whether numbers 1 to N can be divided into two sets such that the absolute difference between… Read More »

Given a number n, find the number of ways to represent this number as a sum of 2 or more consecutive natural numbers. Examples: Input… Read More »

Given an increasing sequence a[], we need to find the K-th missing contiguous element in the increasing sequence which is not present in the sequence.… Read More »