Split an array into two equal Sum subarrays

Given an array of integers greater than zero, find if it is possible to split it in two subarrays (without reordering the elements)

Examples :

Two Sum

Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.

You may assume that each input would have exactly one solution, and you may not use the same element twice.

Example 1:

GOLang Slices Guide

Slices are one of the powerful and flexible concept than arrays in go-language.

It is a light weight data structure.

Slice is an abstraction over an array and overcomes limitations of arrays. …

Find maximum sum path by involving elements from two arrays

The idea is to do something similar to merge process of merge sort. This involves calculating the sum of elements between all common points of both arrays. Whenever there is a common point, compare the two sums and add the maximum of two to the result.

Input:

X = {…

Balanced Parentheses

This the frequently asked question in FANG & Top Rated Leet Code Problem.. solution in Java.

Approach-1 : Time Complexity : O(n) & Space: O(n).

This problem is to check how much good you are at data structures. Best Data Structure to solve this problem is Stack or ArrayDeque(In Java)…

Check whether two strings are anagram of each other or not

This the frequently asked question in FANG & All Top campiness.. solution in Java.

Approach-1: (By Using Sorting Method) : Time Complexity : O(nlog(n)) Sivareddy Uppathi

Full Stack Software Developer| Programming enthusiast | Loves DS-Algo and System Design