“Where there is code, there will be errors” If you have ever been into programming/coding, you must have definitely come across some errors. It is… Read More
Category Archives: DSA
Debugging is a process of finding errors, mistakes, or bugs in the code so that code gives the desired output. Debugging involves pointing out and… Read More
Bellman-Ford Algorithm: The Bellman-Ford algorithm is a single-source shortest-path algorithm that works by iteratively relaxing edges in the graph until the shortest path to all… Read More
The Barrett Reduction Algorithm computes the remainder of a big integer x divided by another large integer mod. The procedure precomputes mu, the inverse of… Read More
The Bubble Sort algorithm has a time complexity of O(N2) and a space complexity of O(1) since it does not require any additional memory space… Read More
The Selection sort algorithm has a time complexity of O(n^2) and a space complexity of O(1) since it does not require any additional memory space… Read More
Solving GATE Previous Year’s Questions (PYQs) not only clears the concepts but also helps to gain flexibility, speed, accuracy, and understanding of the level of… Read More
Solving GATE Previous Year’s Questions (PYQs) not only clears the concepts but also helps to gain flexibility, speed, accuracy, and understanding of the level of… Read More
A heap is a complete binary tree where each node satisfies the heap property. The heap property is different for different types of heaps but,… Read More
Given an array arr[] of length n, the task is to find the minimum number of operations required to make a permutation of integers 1��� Read More
Given an integer n, you need to find the largest integer m (m < n) such that m XOR n is a palindrome. If there… Read More
Data Structure and Algorithms is the most important skill anyone must have in order to crack tech interviews. DSA is the basic foundation to build… Read More
Given that 2 players are playing a die-throw game. The game is one player throws a die and he got a point, he can move… Read More
Given an array X[] of size N, then the task is to output the number of sub-arrays satisfying the given condition: The Sum of (X[i]… Read More
Given a singly linked list, the task is to replace every node with its closest bell number. Bell numbers are a sequence of numbers that… Read More
