We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
- Prepare
- Data Structures
- Stacks
- Equal Stacks
- Discussions
Equal Stacks
Equal Stacks
Sort by
recency
|
1112 Discussions
|
Please Login in order to post a comment
C++ (more at https://github.com/IhorVodko/Hackerrank_solutions , feel free to give a star :) )
Using hashmap; int equalStacks(vector h1, vector h2, vector h3) { unordered_mapmp; int sum=0; for(int i=h1.size()-1;i>=0;i--){ sum+=h1[i]; mp[sum]++; } sum=0; for(int i=h2.size()-1;i>=0;i--){ sum+=h2[i]; mp[sum]++; } sum=0; for(int i=h3.size()-1;i>=0;i--){ sum+=h3[i]; mp[sum]++; } int maxi=0; for(auto itr : mp){ int a=itr.second; if(a==3 && itr.first>maxi){ maxi=itr.first; } } return maxi; }
SHRIYAANSH KE PAPA KA CODE
if(len(h1)==0 or len(h2)==0 or len(h3)==0): return 0 elif(len(h1)==1 or len(h2)==1 or len(h3)==1): if(h1[0]==h2[0] and h3[0]==h2[0]): return h1[0] else: return 0 for i in range(-2,-len(h1)-1,-1): h1[i]=h1[i]+h1[i+1] for i in range(-2,-len(h2)-1,-1): h2[i]=h2[i]+h2[i+1] for i in range(-2,-len(h3)-1,-1): h3[i]=h3[i]+h3[i+1]