## Given an n x n square matrix, find sum of all sub-squares of size k x k

Leave a comment | Filed under ArraysGiven an n x n square matrix, find sum of all sub-squares of size k x k where k is smaller than or equal to n.

Read More »## Minimum no. of iterations to pass information to all nodes in the tree

Leave a comment | Filed under TreesGiven a very large n-ary tree. Where the root node has some information which it wants to pass to all of its children down to the leaves with the constraint that it can only pass the information to one of its children at a time (take it as one iteration).

Read More »Given three arrays sorted in non-decreasing order, print all common elements in these arrays.

Read More »Given an array of integers, find the first repeating element in it. We need to find the element that occurs more than once and whose index of first occurrence is smallest.

Read More »## Find the smallest positive integer value that cannot be represented as sum of any subset of a given array

Leave a comment | Filed under ArraysGiven a sorted array (sorted in non-decreasing order) of positive numbers, find the smallest positive integer value that cannot be represented as sum of elements of any subset of given set.

Read More »Given a Binary Tree where every node has following structure. struct node { int key; struct node *left,*right,*random; } The random pointer points to any random node of the binary tree and can even point to NULL, clone the given binary tree.

Read More »Problem Statement: Given a text txt[0..n-1] and a pattern pat[0..m-1], write a function search(char pat[], char txt[]) that prints all occurrences of pat[] in txt[]. You may assume that n > m.

Read More »## SAP Labs Interview Experience for Developer Associate

Leave a comment | Filed under Interview ExperiencesSAP Labs Procedure consists of 5 rounds. 1) ONLINE EXAM 2) APPLICATION DESIGNE 3) TECHNICAL

Read More »Written round: 1. Write a parser which takes java file as input and give count of uncommented lines as output.

Read More »## [TopTalent.in] Exclusive Interview with Abhishek who got into DE Shaw

Leave a comment | Filed under Interview ExperiencesCracking a Day 1 slot company like DE Shaw is not an easy feat. They try to hire the best candidate out there in campus by offering awesome Job Profile and Salary.

Read More »Amazon visited our campus for summer internship. I prepared from Amazon Interview Sets which were pretty helpful!

Read More »Below is my interview experience with linkedin India for software development intern.

Read More »Recently, we had Citrix written test in our campus. There was a 1 hr aptitude test & 1 hour coding round. The aptitude test had simple questions on c/cpp, Networking, OS etc. and some general quant aptitude questions.

Read More »There were total 2 rounds. Round 1: There were 60 MCQs(20 English + 20 Logical reasoning + 20 Data Interpretation ) to be solved in 1 hour. Round 2: I got 3 coding questions. 1) Given two numbers. I have to find the number of bit which are required to change in binary conversion of […]

Read More »Round 1 : ~200 students Duration 60 minutes Written round, comprising of aptitude question, logical puzzles, and technical questions. (basic aptitude + heavy java)

Read More »Recently I got interviewed with Amazon for SDE1 position and here is my interview experience which I would like to share with others.

Read More »Skype round: 1) Print the last n lines of a file (Hint : treat it like a linked list) 2) Length encoding -

Read More »## Microsoft Research India Interview | Set 36 (On-Campus for Internship)

Leave a comment | Filed under Interview ExperiencesRecently Microsoft research india invited application for internship.They shortlisted based on CV (projects related to your topic of interest and CGPA).

Read More »