## Placement Preparation Guide

This guide will cover everything you need to prepare for your dream job. The basic structure of this course is as follows: Resume Building Application… Read More »

Featured Article

This guide will cover everything you need to prepare for your dream job. The basic structure of this course is as follows: Resume Building Application… Read More »

Featured Article

As the placement season is back so are we to help you ace the interview. We have selected some most commonly asked and must do… Read More »

Featured Article

Topic : Google Facebook Microsoft Adobe Oracle Amazon D E Shaw MAQ Software Directi Yahoo Accolite Walmart Labs Samsung Paytm Ola Cabs Flipkart SAP Labs… Read More »

Introduction: The software needs the architectural design to represents the design of software. IEEE defines architectural design as “the process of defining a collection of… Read More »

Given lengths of n rods in an array a[]. If any person picks any rod, half of the longest rod (or (max + 1) /… Read More »

Given a square chessboard of N x N size, the position of Knight and position of a target is given, the task is to find… Read More »

Given a number N, the task is to print all prime numbers less than or equal to N. Examples: Input: 7 Output: 2, 3, 5,… Read More »

Given an array arr[] containing n + 1 integers where each integer is between 1 and n (inclusive). There is only one duplicate element, find… Read More »

Given a Binary Search Tree and a number N, the task is to find the smallest number in the binary search tree that is greater… Read More »

Given a set of strings, find the longest common prefix. Examples: Input: str[] = {geeksforgeeks, geeks, geek, geezer} Output: gee Input: str[] = {apple, ape,… Read More »

Prerequisites : Recursion Complexity Analysis Backtracking is an algorithmic-technique for solving problems recursively by trying to build a solution incrementally, one piece at a time,… Read More »

There were following sections in the test – C MCQ Section Aptitude Coding with command Line Programming email Writing The written round preparation questions were… Read More »

Generate all prime numbers between two given numbers. The task is to print prime numbers in that range. The Sieve of Eratosthenes is one of… Read More »

Prerequisite – Finite automata, L-graphs and what they represent L-graphs can generate context sensitive languages, but it’s much harder to program a context sensitive language… Read More »

Prerequisite – Finite automata introduction All programming languages can be represented as a finite automata. C, Paskal, Haskell, C++, all of them have a specific… Read More »

Given k sorted arrays of possibly different sizes, merge them and print the sorted output. Examples: Input: k = 3 arr[][] = { {1, 3},… Read More »

The multiset::upper_bound() is a built-in function in C++ STL which returns an iterator pointing to the immediate next element which is just greater than k.… Read More »

The multiset::lower_bound() is a built-in function in C++ STL which returns an iterator pointing to the first element in the container which is equivalent to… Read More »