Equilibrium Point | Array | GFG POTD | C++ | Java | Code Kar Lo

preview_player
Показать описание
Given an array arr[] of non-negative numbers. The task is to find the first equilibrium point in the array.

The equilibrium point in an array is an index (0-based indexing) such that the sum of all elements before that index is the same as the sum of elements after it. Return -1 if no such point exists.

0:00 Introduction
0:11 Problem Statement
1:21 Explanation
4:57 C++ Code
6:44 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
Рекомендации по теме
Комментарии
Автор

yahi logic c++ me problem create kr rha hai.
last test case pass nahi ho rha (inspite of using long long)

anupamtiwary
welcome to shbcf.ru