APIs (Application Programming Interface) acts as an interface between two applications to interact and provide the relevant data. It uses a set of protocols using… Read More
College life is always special in every student’s learning phase, it teaches them how to build a career, have real fun, explore opportunities, etc. Well,… Read More
Prerequisite: NP-Completeness, NP Class, Clique, Independent Set Problem: Given an undirected graph G = (V, E) and an integer K, determine if a clique of… Read More
Prerequisites: NP-Completeness, NP Class, Dense Subgraph Problem: Given graph G = (V, E) and two integers a and b. A set of a number of… Read More
A sparse array or sparse matrix is an array in which most of the elements are zero. Characteristics of Sparse array: The sparse array is… Read More
Array: An array is a collection of similar data types which is stored in contiguous memory locations. Arrays are static data structure with limited size.… Read More
Trie(pronounced as “try”): Trie(also known as the digital tree or prefix tree) is a sorted and efficient tree-based special data structure that is used to… Read More
In python, the ‘b‘ character before a string is used to specify the string as a “byte string“. For example: b_str = b’Hey I am… Read More
In this article, we are going to discuss whether String is a primitive data type or a Derived data type. Definitely, String is not a… Read More
Given two values X and K, the task is to minimize the number of jumps to reach X from 0 by jumping K positions or… Read More
Given two arrays arr1[] and arr2[] of sizes N and M and an integer K, the task is to find the maximum possible sum pair… Read More
How did I get to know about the opportunity? It was an off-campus opportunity for the position of Software Engineer for the 2021 batch. The… Read More
Given two snapshots S1 and S2 of N elements, the task is to find the elements which are changing their groups and the ones that… Read More
Given two arrays arr1[] and arr2[] of size N each, the task is to find the minimum number of interchange of the same indexed elements… Read More
Dynamic connectivity, in general, refers to the storage of the connectivity of the components of a graph, where the edges change between some or all… Read More
A 2-3-4 tree is a self-balancing tree. The number represents the number of children each node can have. Any internal node can have either two,… Read More
Given an integer N, the task is to construct an array of N distinct elements (arr[i] ≤ N+1) such that the bitwise XOR of every… Read More



.png)