Data Structures and Algorithms are one of the most important skills that every computer science student must-have. It is often seen that people with good… Read More »
As the placement season is back so are we to help you ace the interview. We have selected some most commonly asked and must do… Read More »
As the placement season is back so are we to help you ace the interview. We have selected some most commonly asked and must do… Read More »
Given an array arr[] of N positive integers and a string patt which consist of characters from the set {0, 1}, the task is to… Read More »
Given an array a of size N. The task is to find the number of pairs such that gcd(a[i], a[j]) where 1 ≤ i <… Read More »
You might have written your first code in programming languages such as C/C++ or Java and might have faced difficulty learning these languages. Well, these… Read More »
The Kotlin standard library helps in grouping collection elements with the help of extension functions. Grouping means collecting items by category. Here, we have a… Read More »
Given a string. The task is to find out the numbers of substrings consisting of the same characters. Examples: Input: abba Output: 5 The desired… Read More »
Given a string S consisting of lowercase characters, you have to delete the minimum number of characters from S so that every letter in S… Read More »
Given N strings containing of characters ‘a’ and ‘b’. These string can be concatenated in any order to make a single final string S. The… Read More »
Given a sequence of non-negative integers arr[], the task is to check if there exists a simple graph corresponding to this degree sequence. Note that… Read More »
Given an integer N which represents the number of cards in a deck. The deck is ordered from 1 to N where 1 is the… Read More »
Geek on the top is all about success stories of Geeks who are working hard to chase their goals and are the inspiration for other… Read More »
Given two arrays arr[] and cost[] where cost[i] is the cost associated with arr[i], the task is to find the minimum cost of choosing three… Read More »
Given an array arr[] of N integers. The task is to replace all the elements of the array by the absolute difference of the smallest… Read More »
Round 1 (Online coding round): This was a 2 hours long round, which consisted of 4 sections- Coding, Quant, Subjective, and Advanced. The Coding section… Read More »
Capgemini conducted a campus drive for two days in our campus, I got to appear both days as the strength of students were more. Initially… Read More »
Given a graph of N nodes, E edges, a node X and a distance K. The task is to print all the nodes within the… Read More »
