Skip to content
Gblog SDE SHEET – A Complete Guide for SDE Preparation
What is SDE Sheet? SDE Sheet is a list of the most important topics or the most popular questions that are asked in the Software… Read More
Developing something and making it accessible to everyone on the internet is possible only because of web developers. A web developer should be well versed… Read More
In today’s data-driven world, the success of any business relies heavily on a huge amount of data. These data are highly important for the efficiency,… Read More
Application Process: Zomato hires only via referrals so develop a good profile and ask for a referral. I applied using Referral and then got a… Read More
I applied for the Infosys off-campus drive on 13th December 2021 and I received the confirmation on 15th Jan that I have been shortlisted. On… Read More
Given a number N and a mapping of letters to each integer from 1 to 8, which are: {1: ‘abc’, 2: ‘def’, 3: ‘ghi’, 4: ‘jkl’,… Read More
Doubly linked list is a type of linked list in which nodes contains information and two pointers i.e. left pointer and right pointer. The left… Read More
Round 1: First round was an online test. It was conducted on the HackerEarth platform. This round consisted of 22 questions in which: 20 –… Read More
A weighted graph is a special type of graph in which the edges are assigned some weights which represent cost, distance and many other relative… Read More
Unweighted graph is a type of graph with no edge weight. In an unweighted graph, the edges represent the connection between two nodes. If there… Read More
Deque is a type of queue in which insert and deletion can be performed from either front or rear. It does not follow the FIFO… Read More
Circular Queue is a linear data structure that follows FIFO (first in first out) principle which means the item that is inserted first in the… Read More
Given an array arr[] of size N, the task is to find the maximum value that can be obtained by following the below conditions: Select… Read More
A height-balanced binary tree is defined as a binary tree in which the height of the left and the right subtree of any node differ… Read More
In this article, we will see the “Uncaught ReferenceError: $ is not a function“. The ReferenceError is an object that represents an error that arises… Read More
Given an array A[], the task is to find the circulant matrix made by this array.  A circulant matrix is a square matrix of order… Read More
Given an array arr[] of size N and a positive integer K, the task is to check if the array can be reordered such that… Read More
Given a directed graph with N nodes and M edges in array V[], the task is to find the number of nodes that are accessible… Read More

Start Your Coding Journey Now!