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

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

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

GATE Prep

Data Analytics / Data Science

Development

Cloud / DevOps

All Courses

Courses

ML & Data Science

Interview Corner

CS Subjects

School Learning

Software and Tools

Tutorials

Google Build with AI

Practice Coding Problems

Connect 1:1 with Experts

Practice

Apply Now!

Post Jobs

Jobs Updates

Jobs

Given an unsorted array arr of nonnegative integers and an integer sum, find a continuous subarray which adds to a given sum. There may be more than one subarrays with sum as the given sum, print first such subarray.&nbsp; Examples :Input: arr[] = {1, 4, 20, 3, 10, 5}, sum = 33 Output: Sum found between indexes 2 and 4 Sum of elements between indices 2 and 4 is 20 + 3 + 10 = 33Find subarray with given sum :<a href=" https://www.geeksforgeeks.org/find-subarray-with-given-sum/"> https://www.geeksforgeeks.org/find-subarray-with-given-sum/</a>

Find subarray with given sum

Hey, coding wizards! 🧙‍♂️ Ready to tackle a fascinating problem in arrays? Join us in this video as we unravel the mystery behind counting subarrays with total distinct elements.We'll break down the problem step-by-step, offering clear explanations and practical examples to guide you through the process. Whether you're a seasoned programmer or just dipping your toes into the world of coding, this video is sure to spark your curiosity and boost your problem-solving skills.Are you ready to embark on this coding adventure? Hit play now and let's delve into the world of subarrays and distinct elements! 💻🔍🔗 Dive into the details: <a href="https://www.geeksforgeeks.org/count-subarrays-total-distinct-elements-original-array/">https://www.geeksforgeeks.org/count-subarrays-total-distinct-elements-original-array/</a>

Equivalent Sub-Arrays | DSA Problem

Unlock the power of the sliding window technique as we delve into the realm of finding the maximum of all subarrays of size k. In this comprehensive tutorial, we explore the intricacies of sliding windows and unveil efficient algorithms to solve this common problem.Join us on a journey of discovery as we dissect the problem, unravel its complexities, and devise elegant solutions using the sliding window technique. We'll explore different approaches, including brute force methods and optimized algorithms, to efficiently compute the maximum of each subarray within the given window size.Through detailed explanations and illustrative examples, you'll gain a deep understanding of the sliding window technique and its application in solving array-related problems. From basic concepts to advanced strategies, this tutorial covers everything you need to master the art of finding maximum values in subarrays.Whether you're a beginner seeking to improve your algorithmic skills or an experienced programmer looking to enhance your problem-solving toolkit, this tutorial is for you. With clear explanations, step-by-step guidance, and insightful tips, you'll learn how to tackle array problems with confidence and efficiency.Don't miss out on this opportunity to level up your coding skills and become proficient in the sliding window technique. Dive into our tutorial now and embark on a journey to mastering the art of finding maximum values in subarrays. For additional insights and in-depth explanations, be sure to visit the accompanying article on GeeksforGeeks: <a href="https://www.geeksforgeeks.org/sliding-window-maximum-maximum-of-all-subarrays-of-size-k/">https://www.geeksforgeeks.org/sliding-window-maximum-maximum-of-all-subarrays-of-size-k/</a>Get ready to conquer array-related challenges and optimize your coding efficiency with the power of the sliding window technique. Happy coding!

Maximum of all subarrays of size k | DSA Problem

Dive into the world of subarray manipulation and learn how to find the largest subarray with an equal number of 0s and 1s efficiently with our comprehensive tutorial! Whether you're new to subarray algorithms or seeking to optimize your problem-solving skills, understanding how to handle such scenarios is crucial for various applications, including data analysis and optimization problems.In this tutorial, we'll explore the concept of finding the largest subarray with an equal number of 0s and 1s, where the goal is to identify the longest contiguous subarray with a balanced count of zeros and ones. You'll learn how to transform the problem into a simpler form, apply efficient algorithms like hashing or prefix sum techniques, and handle edge cases to find the optimal solution.Join us as we unravel the complexities of subarray manipulation, providing practical examples, code snippets, and algorithmic insights along the way. From understanding the problem statement to implementing efficient algorithms step by step, you'll gain the skills to tackle similar challenges with confidence.Ready to master subarray manipulation and balance zeros and ones? Dive into our tutorial now and discover how to find the largest subarray with an equal number of 0s and 1s like a pro! For further exploration and detailed insights, don't forget to peruse the accompanying article on GeeksforGeeks: <a href="https://www.geeksforgeeks.org/largest-subarray-with-equal-number-of-0s-and-1s/">https://www.geeksforgeeks.org/largest-subarray-with-equal-number-of-0s-and-1s/</a>Don't miss out on the opportunity to elevate your algorithmic skills and conquer subarray challenges. Like, share, and subscribe for more tutorials and insights into algorithmic concepts. Let's find balanced subarrays together. Happy coding!

Largest subarray of 0's and 1's | DSA Practice Problem

Dive into the world of circular arrays and discover how to find the maximum contiguous sum in a circular array with our comprehensive tutorial! Whether you're new to circular array algorithms or seeking to optimize your problem-solving skills, understanding how to handle circular arrays is essential for various applications, including data analysis and optimization problems.In this tutorial, we'll explore the concept of maximum contiguous circular sum, where the goal is to find the contiguous subarray with the largest sum in a circular array. You'll learn how to transform the problem into a standard maximum subarray sum problem, apply Kadane's algorithm, and handle circular array edge cases to find the optimal solution.Join us as we unravel the complexities of circular array algorithms, providing practical examples, code snippets, and algorithmic insights along the way. From understanding the circular array properties to implementing the solution step by step, you'll gain the skills to tackle maximum contiguous circular sum problems with confidence.Ready to navigate circular arrays and maximize contiguous sums? Dive into our tutorial now and discover how to find the maximum contiguous circular sum like a pro! For further exploration and detailed insights, don't forget to peruse the accompanying article on GeeksforGeeks: <a href="https://www.geeksforgeeks.org/maximum-contiguous-circular-sum/">https://www.geeksforgeeks.org/maximum-contiguous-circular-sum/</a>Don't miss out on the opportunity to elevate your algorithmic skills and conquer circular array challenges. Like, share, and subscribe for more tutorials and insights into algorithmic concepts. Let's maximize circular sums together. Happy coding!

Max Circular Subarray Sum | DSA Practice Problem

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 Array but also build up problem-solving skills. In this problem, we are given an array arr containing N integers and a positive integer K, find the length of the longest sub array with sum of the elements divisible by the given value K. Example : Input: N = 6, K = 3 arr[] = {2, 7, 6, 1, 4, 5} Output:&nbsp; 4 Explanation: The subarray is {7, 6, 1, 4} with sum 18, which is divisible by 3. Give the problem a try before going through the video. All the best!!! Problem Link: <a href="https://www.geeksforgeeks.org/problems/longest-subarray-with-sum-divisible-by-k1259/1">https://www.geeksforgeeks.org/problems/longest-subarray-with-sum-divisible-by-k1259/1</a>

PROBLEM OF THE DAY : 10/01/2024 | Longest subarray with sum divisible by K

Welcome to the daily solving of our PROBLEM OF THE DAY with Devashish Khare. 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 of integers Arr of size N and a number K. Return the maximum sum of a subarray of size K. NOTE: A subarray is a contiguous part of any given array.Example : Input: N = 4, K = 2 Arr = [100, 200, 300, 400] Output: 700 Explanation: Arr3 &nbsp;+ Arr4 =700, which is maximum. Give the problem a try before going through the video. All the best!!! Problem Link: https://practice.geeksforgeeks.org/problems/subarray-with-0-sum-1587115621/1

PROBLEM OF THE DAY : 11/12/2023 | Max Sum Subarray of size K

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 Array but also build up problem-solving skills. In this problem, we are given, an array of integers. Find if there is a subarray (of size at least one) with 0 sum. You just need to return true/false depending upon whether there is a subarray present with 0-sum or not. Printing will be taken care by the driver code. Example : Input: n = 5 arr = {4,2,-3,1,6} Output:&nbsp; Yes Explanation:&nbsp; 2, -3, 1 is the subarray with sum 0.Give the problem a try before going through the video. All the best!!! Problem Link: <a href="https://practice.geeksforgeeks.org/problems/subarray-with-0-sum-1587115621/1">https://practice.geeksforgeeks.org/problems/subarray-with-0-sum-1587115621/1</a>

PROBLEM OF THE DAY : 10/12/2023 | Subarray with 0 sum

Welcome to the daily solving of our PROBLEM OF THE DAY with Karan Mashru. 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 Maths but also build up problem-solving skills. In this problem, we are given, an array of N elements and L and R, and print the number of sub-arrays such that the value of the maximum array element in that subarray is at least L and at most R.Example :Input :&nbsp; Arr = {2, 0, 11, 3, 0} L = 1 and R = 10 Output :&nbsp; 4 Explanation: The sub-arrays {2}, {2, 0}, {3} and {3, 0} have maximum in range 1-10. Give the problem a try before going through the video. All the best!!! Problem Link: <a href="https://practice.geeksforgeeks.org/problems/number-of-subarrays-with-maximum-values-in-given-range5949/1">https://practice.geeksforgeeks.org/problems/number-of-subarrays-with-maximum-values-in-given-range5949/1</a> Solution IDE Link: <a href="https://ide.geeksforgeeks.org/online-cpp-compiler/0b07c910-2a04-4d89-af1d-de5b860e3546">https://ide.geeksforgeeks.org/online-cpp-compiler/0b07c910-2a04-4d89-af1d-de5b860e3546</a>

PROBLEM OF THE DAY : 07/12/2023 | Number of subarrays with maximum values in given range

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 Array but will also help you build up problem-solving skills. In this video, we are given an unsorted array A of size N that contains only positive integers, Our task is to find a continuous sub-array that adds to a given number S and return the left and right index(1-based indexing) of that subarray. In case of multiple subarrays, return the subarray indexes which come first on moving from left to right. Example :Input: N = 5, S = 12 A[] = {1,2,3,7,5} Output: 2 4 Explanation: The sum of elements from 2nd position to 4th position is 12. Give the problem a try before going through the video. All the best!!!Problem Link: <a href="https://practice.geeksforgeeks.org/problems/subarray-with-given-sum-1587115621/1">https://practice.geeksforgeeks.org/problems/subarray-with-given-sum-1587115621/1</a>Solution IDE Link: <a href="https://ide.geeksforgeeks.org/online-cpp-compiler/b846f4bc-358e-4d60-a046-9a5c06eb7807">https://ide.geeksforgeeks.org/online-cpp-compiler/b846f4bc-358e-4d60-a046-9a5c06eb7807</a>

PROBLEM OF THE DAY: 19/08/2023 | Subarray with given sum

Given an array and an integer K, find the maximum for each and every contiguous subarray of size k.Examples :Input: arr[] = {1, 2, 3, 1, 4, 5, 2, 3, 6}, K = 3&nbsp; Output: 3 3 4 5 5 5 6 Explanation:&nbsp; Maximum of 1, 2, 3 is 3 Maximum of 2, 3, 1 is 3 Maximum of 3, 1, 4 is 4 Maximum of 1, 4, 5 is 5 Maximum of 4, 5, 2 is 5&nbsp; Maximum of 5, 2, 3 is 5 Maximum of 2, 3, 6 is 6Maximum of all subarrays of size 'k' using Sliding Window Technique:<a href="https://www.geeksforgeeks.org/sliding-window-maximum-maximum-of-all-subarrays-of-size-k/">https://www.geeksforgeeks.org/sliding-window-maximum-maximum-of-all-subarrays-of-size-k/</a>

Maximum of all subarrays of size 'k' using Sliding Window Technique

Practice Problems

JavaScript

Linux