1216

Author: surajr

README.md

@@ -71,7 +71,7 @@ Feel free to submit pull requests, add issues and be a contributer.
 | Leetcode | [674. Longest Continuous Increasing Subsequence](https://leetcode.com/problems/longest-continuous-increasing-subsequence/description/) | [Java](./java/findLengthOfLCIS.java) | _O(n)_ | _O(1)_ | Easy | |
 | Leetcode | [713. Subarray Product Less Than K](https://leetcode.com/problems/subarray-product-less-than-k/description/) | [Java](./java/numSubarrayProductLessThanK.java) | _O(n)_ | _O(1)_ | Medium | |
 | Leetcode | [714. Best Time to Buy and Sell Stock with Transaction Fee](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/description/) | [Java](./java/maxProfitWithFee.java) | _O(n)_ | _O(1)_ | Medium | |
-
+| Leetcode | [724. Find Pivot Index](https://leetcode.com/problems/find-pivot-index/description/) | [Java](./java/pivotIndex.java) | _O(n)_ | _O(1)_ | Easy | |
 
 
 ## Strings

java/pivotIndex.java

@@ -0,0 +1,17 @@
+class Solution {
+ public int pivotIndex(int[] nums) {
+ int sum = 0, leftSum = 0;
+ 
+ for(int num: nums) 
+ sum += num;
+ 
+ 
+ for(int i=0; i<nums.length; i++)
+ {
+ if(leftSum == sum - leftSum - nums[i])
+ return i;
+ leftSum += nums[i];
+ }
+ return -1;
+ }
+}