Skip to content
Gblog 100 Days of Code – A Complete Guide For Beginners and Experienced
Do you want to become a successful software developer and dreaming about getting into the big tech companies? Are you someone who is already working… Read More
Given an array of distinct positive integers, the task is to find the maximum product of increasing subsequence of size 3, i.e., we need to… Read More
Given an array of size n such that array elements are in range from 1 to n. The task is to count a number of… Read More
Round 1:  Tell me about yourself.  Trapping Rain Water:Given n non-negative integers representing an elevation map where the width of each bar is 1, compute… Read More
Given n points in a Cartesian coordinate system. Count the number of triangles formed.  Examples:  Input : point[] = {(0, 0), (1, 1), (2, 0),… Read More
If a class has multiple methods having same name but parameters of the method should be different is known as Method Overloading. If we have… Read More
SELECT TOP clause is used to fetch limited number of rows from a database. This clause is very useful while dealing with large databases. Basic… Read More
Given an array, count those pair whose product value is present in array. Examples:   Input : arr[] = {6, 2, 4, 12, 5, 3} Output :… Read More
A JAR (Java Archive) is a package file format typically used to aggregate many Java class files and associated metadata and resources (text, images, etc.)… Read More
Given a matrix of n*n size, the task is to print its elements in a diagonal pattern.  Input : mat[3][3] = {{1, 2, 3}, {4,… Read More
Given two Binary Search Trees (BST) and a given sum. The task is to find pairs with given sum such that each pair elements must… Read More
Goldman Sachs came for recruiting students for the New Analyst profile. Following is a brief description of the process. Round 1 (Online Test) : 3… Read More
Given an array of n size, the task is to find the longest subsequence such that difference between adjacents is one.  Examples:  Input : arr[]… Read More
Given an array of integers arr[0..n-1], count all pairs (arr[i], arr[j]) in the such that i*arr[i] > j*arr[j], 0 =< i < j < n.… Read More
Given hypotenuse and area of a right angle triangle, get its base and height and if any triangle with given hypotenuse and area is not… Read More
In Java there are four types of references differentiated on the way by which they are garbage collected. Strong References Weak References Soft References Phantom… Read More

Start Your Coding Journey Now!