Written Round: The written round (conducted on Hackerearth) consisted of two sections: First section consisted of 50 MCQs to be attempted in 1 hours. The… Read More

D. E. Shaw recently carried out intern procedure in our college. The whole process had three rounds. Round 1: It was CV shortlisting. Out of… Read More

Given a string, Check if characters of the given string can be rearranged to form a palindrome. For example characters of “geeksogeeks” can be rearranged to… Read More

There are n stairs, a person standing at the bottom wants to reach the top. The person can climb either 1 stair or 2 stairs… Read More

There are n stairs and a person standing at the bottom wants to reach the top. The person can climb either 1 stair or 2… Read More

Consider the following C implementation of Binary Search function, is there anything wrong in this? // A iterative binary search function. It returns location of… Read More

Given an array of strings, find all anagram pairs in the given array. Example: Input: arr[] = {"geeksquiz", "geeksforgeeks", "abcd", "forgeeksgeeks", "zuiqkeegs"}; Output: (geeksforgeeks, forgeeksgeeks), (geeksquiz,… Read More

Would destructor be called, if yes, then due to which vector? #include <iostream> #include <vector> using namespace std; class a { public : ~a()… Read More

1) Tell me about yourself. 2) About projects, role in project. 3) Why do you want to join Infosys? 4) Strategy to handle major project… Read More

Given a directed graph and two vertices ‘u’ and ‘v’ in it, count all possible walks from ‘u’ to ‘v’ with exactly k edges on… Read More

Given a number as a string, find the number of contiguous subsequences which recursively add up to 9

Given a number as a string, write a function to find the number of substrings (or contiguous subsequences) of the given string which recursively add… Read More