Explore topic-wise InterviewSolutions in .

This section includes InterviewSolutions, each offering curated multiple-choice questions to sharpen your knowledge and support exam preparation. Choose a topic below to get started.

Explore topic-wise InterviewSolutions in .

Maximum sum rectangle in a 2D matrix(http://www.geeksforgeeks.org/dynamic-programming-set-27-max-sum-rectangle-in-a-2d-matrix/)

Given two linked lists both represent a number . Create a linked list that contains its sum

he asked me about the question given to me in the previous round i.e Text Editor . I gave him a brief explanation on my approach . He then gave me another question based on Text Editor. He asked me how could I retrieve K most Frequent words from the text

Given a square area of 1024x1024 on a map with some flats (housing mentality :P) with their location (x,y) and visibility index (~price or value). You have to show every flat with a square of 32x32 in the map.

sort array of 0,1,2 in O(n):time complexity and O(1): space complexity

Given a binary search tree , print the path which has the sum equal to k and has minimum hops. i.e if there are multiple paths with the sum equal to k then print the path with minimum number of nodes

Given names of some places( in a locality) with longitude, latitude mark the boundary of the locality

implement 3 stacks using one array(with space and time complexity optimised)