Not a Subset Sum | Array | GFG POTD | C++ | Java | Code Kar Lo

preview_player
Показать описание
Given a sorted array arr[] of positive integers, find the smallest positive integer such that it cannot be represented as the sum of elements of any subset of the given array set.

0:00 Introduction
0:12 Problem Statement
1:31 Explanation
12:15 C++ Code
13:03 Java Code

gfg potd
gfg potd today
gfg problem of the day
potd gfg
potd
potd today
gfg

#dsa #datastructures #algorithm #gfg #potd #coding #array #strings #tree #binarysearchtree #codekarlo #dynamicprogramming
Рекомендации по теме
Комментарии
Автор

Very simple, thank you so much bhaiyya

salmaniproductions
Автор

The solution was hard to explain, but you did a great job. Kudos to you 💯

leepakshiyadav
Автор

@code_kar_lo bhai please java code pe thoda aur detail me explain Kara kro .. by the way thanks a lot in my prepration journey Hats off to you 🎉🎉🎉🎉

arjunpandit