Total Cuts | Hindi | GFG POTD | C++ | Java | Code Kar Lo
You are given an array A of N integers and an integer K, and your task is to find the total number of cuts that you can make such that for each cut these two conditions are satisfied
1. A cut divides an array into two parts equal or unequal length (non-zero).
2. Sum of the largest element in the left part and the smallest element in the right part is greater than or equal to K.
0:00 Introduction
0:15 Problem Statement
0:54 White Board Explanation
5:30 Complexity Analysis
6:10 C++ Code
8:02 Java Code
gfg potd
gfg potd today
gfg problem of the day
Telegram Link for Jobs and Internships:- https://telegram.me/+otaeJLfKb3ozNjA1
My DSA Journey:- https://youtu.be/quZBBv12mCQ
How to Earn By GFG Articles:- https://youtu.be/XjvEgkd49Gk
Problem Link:-https://practice.geeksforgeeks.org/problems/cbd515a00f6537180d2e66f1ffe11093a128e560/1
Code Link:-https://github.com/ShubhamKashyap138/Data-Structure/blob/main/Total%20Cuts
Playlist Link:-https://youtube.com/playlist?list=PLq3GlRZI14Hui2ILGsfF1Uf2RnbNu9wT3
Linkedin:- https://www.linkedin.com/in/shubham-kashyap-65a29a218/
Instagram:- https://instagram.com/im_shubham_kashyap?igshid=YmMyMTA2M2Y=
My GFG Profile:- https://auth.geeksforgeeks.org/user/shubhamrajput6156/practice
#dsa #datastructures #algorithm #gfg #potd #coding #array #strings #tree #binarysearchtree #codekarlo #dynamicprogramming