Object Oriented Programming

GATE

Data Structures

Data Structures in Python

Power BI

Data Science

Django

Data Structure and Algorithm

Python

Recursion

Arrays

Searching

Sorting

String

Linked List

Data Structures in C

Algebra

Maths

Strings

C++ Tricks

System Design

Theory of Computation

Computer Organization and Architecture

Operating System

Engineering Mathematics

Database

Digital Logic

Computer Networks

GATE 2022

Java

GeeksforGeeks School

Hashing

Competitive Programming

Problem of the Day

School

HTML

Javascript

Bootstrap

Web Development

Android

Excel

Microsoft Office

Machine Learning

Resume Builder

Miscellaneous

Gblog

TechTips

React

Advanced JavaScript

DSA Self Paced

CS-subjects

Data Structures and Algorithms

Operating Systems

C Language

DBMS

Basics of CPP

Data Structures ( Basics )

Object Oriented Design

Dynamic Programming

Data Interpretation and Logical Reasoning

Algorithms

Core Java

RESTful APIs

Spring Basics

CPP-Tricks

Basics of Java

Aptitude

GATE YT

Flutter

Application Development

Blockchain

GFG SDE Sheet

SDE Sheet

Deep Learning

Go Programming

Placement

C++ Programs

Data Visualisation

DevOps

Docker

Queue

Matrix

Trie

Stack

Graph

Tree

Magic Numbers

Divide and Conquer

React Native

React JS

Interview-Questions

Advanced Java

cloud-computing

income tax

Artificial Intelligence

Programming Languages

Computer Graphics

Cyber Security

Project Management

DSA / Placements

DA / Data Science & AI

Development

DevOps Course

All Courses

Courses

ML & Data Science

CS Subjects

Software and Tools

School Learning

Tutorials

Interview Corner

Practice DSA

GfG 160

Interview Prep

Given a singly linked list, The task is to rotate the linked list counter-clockwise by k nodes.Examples:Input: linked list = 10-&gt;20-&gt;30-&gt;40-&gt;50-&gt;60, k = 4 Output: 50-&gt;60-&gt;10-&gt;20-&gt;30-&gt;40.&nbsp; Explanation: k is smaller than the count of nodes in a linked list so (k+1 )th node i.e. 50 becomes the head node and 60’s next points to 10Input: linked list = 30-&gt;40-&gt;50-&gt;60, k = 2 Output: 50-&gt;60-&gt;30-&gt;40.Approach: Below is the idea to solve the problem:To rotate the linked list, we need to change the next pointer of kth node to NULL, the next pointer of the last node should point to the previous head node, and finally, change the head to (k+1)th node. So we need to get hold of three nodes: kth node, (k+1)th node, and last node.&nbsp; Traverse the list from the beginning and stop at kth node. store k’s next in a tem pointer and point k’s next to NULL then start traversing from tem and keep traversing till the end and point end node’s next to start node and make tem as the new head.Related Article : <a href="https://www.geeksforgeeks.org/rotate-a-linked-list/">https://www.geeksforgeeks.org/rotate-a-linked-list/</a>

Rotate a Linked List

Welcome to the daily solving of our PROBLEM OF THE DAY with Nitin Kaplas. We will discuss the entire problem step-by-step and work towards developing an optimized solution. This will not only help you brush up on your concepts of Geometry but also build up problem-solving skills. Given three non-collinear points whose co-ordinates are p(p1, p2), q(q1, q2) and r(r1, r2) in the X-Y plane. Return the number of integral / lattice points strictly inside the&nbsp;triangle&nbsp;formed by these points. Note: - A point in the X-Y plane is said to be an integral / lattice point if both its coordinates are integral.ExamplesInput: p = (0,0), q = (0,5), r = (5,0)
 Output: 6Give the problem a try before going through the video. All the best!!! Problem Link: <a href="https://practice.geeksforgeeks.org/problems/integral-points-in-triangle5026/1">https://practice.geeksforgeeks.org/problems/integral-points-in-triangle5026/1</a>

PROBLEM OF THE DAY : 20/06/2024 | Integral Points Inside Triangle

Welcome to the daily solving of our PROBLEM OF THE DAY with Siddharth Hazra. We will discuss the entire problem step-by-step and work towards developing an optimized solution. This will not only help you brush up on your concepts of Dynamic Programming but also build up problem-solving skills. There is a standard numeric keypad on a mobile phone. You can only press the current button or buttons that are directly up, left, right, or down from it (for ex if you press 5, then pressing 2, 4, 6 &amp; 8 are allowed). Diagonal movements and pressing the bottom row corner buttons (* and #) are prohibited.Given a number n, find the number of possible unique sequences of length n that you can create by pressing buttons. You can start from any digit.ExamplesInput: n = 1
 Output: 10
 Explanation: Number of possible numbers are 10 (0, 1, 2, 3, 4, 5, 6, 7, 8, 9) &nbsp;Give the problem a try before going through the video. All the best!!! Problem Link: <a href="https://practice.geeksforgeeks.org/problems/mobile-numeric-keypad5456/1">https://practice.geeksforgeeks.org/problems/mobile-numeric-keypad5456/1</a>

PROBLEM OF THE DAY : 15/06/2024 | Mobile numeric keypad

Welcome to the daily solving of our PROBLEM OF THE DAY with Yash Dwivedi. We will discuss the entire problem step-by-step and work towards developing an optimized solution. This will not only help you brush up on your concepts of Arrays but also build up problem-solving skills. Given n integer ranges, the task is to return the maximum occurring integer in the given ranges. If more than one such integer exists, return the smallest one. The ranges are in two arrays l[] and r[].&nbsp; l[i] consists of the starting point of the range and r[i] consists of the corresponding endpoint of the range &amp; a maxx which is the maximum value of r[].For example, consider the following ranges. l[] = {2, 1, 3}, r[] = {5, 3, 9) Ranges represented by the above arrays are. [2, 5] = {2, 3, 4, 5} [1, 3] = {1, 2, 3} [3, 9] = {3, 4, 5, 6, 7, 8, 9} The maximum occurred integer in these ranges is 3.Example 1:Input: n = 4, l[] = {1,4,3,1}, r[] = {15,8,5,4}, maxx = 15
 Output: 4
 Explanation: The given ranges are [1,15] [4, 8] [3, 5] [1, 4]. The smallest number that is most common or appears most times in the ranges is 4.Give the problem a try before going through the video. All the best!!! Problem Link: <a href="https://practice.geeksforgeeks.org/problems/maximum-occured-integer4602/1">https://practice.geeksforgeeks.org/problems/maximum-occured-integer4602/1</a>

PROBLEM OF THE DAY : 07/06/2024 | Maximum occured integer

Welcome to the daily solving of our PROBLEM OF THE DAY with Jay Dalsaniya. We will discuss the entire problem step-by-step and work towards developing an optimized solution. This will not only help you brush up on your concepts of Arrays but also build up problem-solving skills. Given an integer array(0-based indexing) a of size n. Your task is to return the maximum value of the sum of i*a[i] for all 0&lt;= i &lt;=n-1,&nbsp;where a[i] is the element at index i in the array. The only operation allowed is to rotate(clockwise or counterclockwise) the array any number of times.Example 1:Input: n = 4, a[] = {8, 3, 1, 2}
 Output: 29
 Explanation: All the configurations possible by rotating the elements are:
 3 1 2 8 here sum is 3*0+1*1+2*2+8*3 = 29
 1 2 8 3 here sum is 1*0+2*1+8*2+3*3 = 27
 2 8 3 1 here sum is 2*0+8*1+3*2+1*3 = 17
 8 3 1 2 here sum is 8*0+3*1+1*2+2*3 = 11, so the maximum sum will be 29.Give the problem a try before going through the video. All the best!!! Problem Link: <a href="https://practice.geeksforgeeks.org/problems/max-sum-in-the-configuration/1">https://practice.geeksforgeeks.org/problems/max-sum-in-the-configuration/1</a>

PROBLEM OF THE DAY : 06/06/2024 | Max sum in the configuration

Welcome to the daily solving of our PROBLEM OF THE DAY with Nitin Kaplas. We will discuss the entire problem step-by-step and work towards developing an optimized solution. This will not only help you brush up on your concepts of Dynamic Programming but also build up problem-solving skills. In this problem, You have n stacks of books. Each stack of books has some nonzero height arr[i] equal to the number of books on that stack ( considering all the books are identical and each book has a height of 1 unit ). In one move, you can select any number of consecutive stacks of books such that the height of each selected stack of books arr[i] &lt;= k. Once such a sequence of stacks is chosen, You can collect any number of books from the chosen sequence of stacks. What is the maximum number of books that you can collect this way?Example 1Input 8 1 3 2 2 3 1 1 1 3 Output 3 Explanation&nbsp; We can collect maximum books from consecutive stacks numbered 5, 6, and 7 having height less than equal to K.Give the problem a try before going through the video. All the best!!! Problem Link: <a href="https://practice.geeksforgeeks.org/problems/you-and-your-books/1">https://practice.geeksforgeeks.org/problems-preview/you-and-your-books/1</a>

PROBLEM OF THE DAY : 25/05/2024 | You and your books

Welcome to the daily solving of our PROBLEM OF THE DAY with Siddhartha Hazra. We will discuss the entire problem step-by-step and work towards developing an optimized solution. This will not only help you brush up on your concepts of Dynamic Programming but also build up problem-solving skills. In this problem, we are given an array arr, partition it into two subsets(possibly empty) such that each element must belong to only one subset. Let the sum of the elements of these two subsets be S1 and S2.&nbsp; Given a difference d, count the number of partitions in which S1 is greater than or equal to S2 and the difference between S1 and S2 is equal to d. Since the answer may be large return it modulo 109&nbsp;+ 7. Example :Input: n = 4 d = 3&nbsp; arr[] = &nbsp;{ 5, 2, 6, 4}Output: 1Explanation: There is only one possible partition of this array. Partition : {6, 4}, {5, 2}. The subset difference between subset sum is: (6 + 4) - (5 + 2) = 3.Give the problem a try before going through the video. All the best!!! Problem Link:<a href="https://practice.geeksforgeeks.org/problems/partitions-with-given-difference/1"> https://practice.geeksforgeeks.org/problems/partitions-with-given-difference/1</a>

PROBLEM OF THE DAY : 24/05/2024 | Partitions with Given Difference

Welcome to the daily solving of our PROBLEM OF THE DAY with Yash Dwivedi. We will discuss the entire problem step-by-step and work towards developing an optimized solution. This will not only help you brush up on your concepts of Dynamic Programming but also build up problem-solving skills. In this problem, a string str of length n, find if the string is K-Palindrome or not. A k-palindrome string transforms into a palindrome on removing at most k characters from it. Example :Input: str = "abcdecba" n = 8, k = 1 Output: 1 Explaination: By removing 'd' or 'e'&nbsp; we can make it a palindrome.Give the problem a try before going through the video. All the best!!! Problem Link: <a href="https://www.geeksforgeeks.org/problems/find-if-string-is-k-palindrome-or-not1923/1">https://www.geeksforgeeks.org/problems/find-if-string-is-k-palindrome-or-not1923/1</a> Solution IDE Link: <a href="https://ide.geeksforgeeks.org/online-cpp14-compiler/468a9633-17e8-4dc0-b942-a09f69db9c7b">https://ide.geeksforgeeks.org/online-cpp14-compiler/468a9633-17e8-4dc0-b942-a09f69db9c7b</a>

PROBLEM OF THE DAY : 23/05/2024 | K-Palindrome

Welcome to the daily solving of our PROBLEM OF THE DAY with Yash Dwivedi. We will discuss the entire problem step-by-step and work towards developing an optimized solution. This will not only help you brush up on your concepts of Binary Search but also build up problem-solving skills. In this problem, we are given a horizontal number line. On that number line, we have gas stations at positions stations[0], stations[1], ..., stations[N-1], where n = size of the stations array. Now, we add k more gas stations so that d, the maximum distance between adjacent gas stations, is minimized. We have to find the smallest possible value of d. Find the answer exactly to 2 decimal places. Give the problem a try before going through the video. All the best!!! Problem Link: <a href="https://www.geeksforgeeks.org/problems/minimize-max-distance-to-gas-station/1">https://www.geeksforgeeks.org/problems/minimize-max-distance-to-gas-station/1</a> Solution IDE Link: <a href="https://ide.geeksforgeeks.org/online-cpp14-compiler/5071125f-6cbc-4ef0-98f9-fe9e91200ea4">https://ide.geeksforgeeks.org/online-cpp14-compiler/5071125f-6cbc-4ef0-98f9-fe9e91200ea4</a>

PROBLEM OF THE DAY : 22/05/2024 | Minimize Max Distance to Gas Station

Welcome to the daily solving of our PROBLEM OF THE DAY with Nitin Kaplas. We will discuss the entire problem step-by-step and work towards developing an optimized solution. This will not only help you brush up on your concepts of Array but also build up problem-solving skills. In this problem, we are given an array, arr[] of n integers, and a value x. Find the K closest elements to x in arr[]. Keep the following points in mind: If x is present in the array, then it need not be considered. If two elements have the same difference as x, the greater element is prioritized. If sufficient elements are not present on the right side, take elements from the left and vice versa. Example :Input: n = 13 arr[] = {12, 16, 22, 30, 35, 39, 42,&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; 45, 48, 50, 53, 55, 56} k = 4, x = 35 Output: 39 30 42 45 Explanation:&nbsp; First closest element to 35 is 39. Second closest element to 35 is 30. Third closest element to 35 is 42. And fourth closest element to 35 is 45. Give the problem a try before going through the video. All the best!!! Problem Link:<a href="https://www.geeksforgeeks.org/problems/k-closest-elements3619/1"> https://www.geeksforgeeks.org/problems/k-closest-elements3619/1</a>

PROBLEM OF THE DAY : 21/05/2024 | K closest elements

Welcome to the daily solving of our PROBLEM OF THE DAY with Nitin Kaplas. We will discuss the entire problem step-by-step and work towards developing an optimized solution. This will not only help you brush up on your concepts of Array but also build up problem-solving skills.In this problem, we are given Implement pow(x, n) % M. In other words, for a given value of x, n, and M, find &nbsp;(xn) % M. Example :Input: x = 3, n = 2, m = 4 Output: 1 Explanation: 32 = 9. 9 % 4 = 1.Give the problem a try before going through the video. All the best!!! Problem Link: <a href="https://www.geeksforgeeks.org/problems/modular-exponentiation-for-large-numbers5537/1">https://www.geeksforgeeks.org/problems/modular-exponentiation-for-large-numbers5537/1</a>

PROBLEM OF THE DAY : 20/05/2024 |  Modular Exponentiation for large numbers

Welcome to the daily solving of our PROBLEM OF THE DAY with Siddharth Hazra. We will discuss the entire problem step-by-step and work towards developing an optimized solution. This will not only help you brush up on your concepts of Searching but also build up problem-solving skills. In this problem, we are given a sorted array arr[] of positive integers. The task is to find the closest value in the array to the given number k. The array may contain duplicate values. Note: If the difference with k is the same for two values in the array return the greater value. Example :Input:&nbsp; n = 4 k = 4 arr[] = {1, 3, 6, 7} Output:&nbsp; 3 Explanation: We have array arr={1, 3, 6, 7} and target is 4. If we look at the absolute difference of target with every element of the array we will get { |1-4|, |3-4|, |6-4|, |7-4| } &nbsp;= {3, 1, 2, 3}. So, the closest number is 3. Give the problem a try before going through the video. All the best!!! Problem Link: <a href="https://www.geeksforgeeks.org/problems/find-the-closest-number5513/1">https://www.geeksforgeeks.org/problems/find-the-closest-number5513/1</a>

PROBLEM OF THE DAY : 19/05/2024 |  Find the closest number