Skip to content

Update Equal.cpp #73

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Update Equal.cpp #73

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
131 changes: 83 additions & 48 deletions Hashing/Equal.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,55 +1,90 @@
// https://www.interviewbit.com/problems/equal/
// // https://www.interviewbit.com/problems/equal/

vector<int> Solution::equal(vector<int> &A) {
// Do not write main() function.
// Do not read input, instead use the arguments to the function.
// Do not print the output, instead return values as specified
// Still have a doubt. Checkout www.interviewbit.com/pages/sample_codes/ for more details
// vector<int> Solution::equal(vector<int> &A) {
// // Do not write main() function.
// // Do not read input, instead use the arguments to the function.
// // Do not print the output, instead return values as specified
// // Still have a doubt. Checkout www.interviewbit.com/pages/sample_codes/ for more details

unordered_map <int, vector<int> > myMap;
vector<int> sol;
vector<int> temp;
// unordered_map <int, vector<int> > myMap;
// vector<int> sol;
// vector<int> temp;

int count = 0;
// int count = 0;

for(int i = 0; i < A.size()-1; i++){
for(int j = i+1; j < A.size(); j++){
int sum = A[i] + A[j];
if(myMap.find(sum) == myMap.end()){
myMap[sum].push_back(i);
myMap[sum].push_back(j);
}
else{
temp.push_back(myMap[sum][0]);
temp.push_back(myMap[sum][1]);
temp.push_back(i);
temp.push_back(j);
for(int a = 0; a < temp.size()-1; a++){
for(int b = a+1; b < temp.size(); b++){
if(temp[a] == temp[b]){
goto COND;
}
}
}
count++;
if(count == 1){
sol = temp;
}
else{
for(int z = 0; z < sol.size(); z++){
if(sol[z] > temp[z]){
sol = temp;
break;
}
else if(sol[z] < temp[z]){
break;
}
}
// for(int i = 0; i < A.size()-1; i++){
// for(int j = i+1; j < A.size(); j++){
// int sum = A[i] + A[j];
// if(myMap.find(sum) == myMap.end()){
// myMap[sum].push_back(i);
// myMap[sum].push_back(j);
// }
// else{
// temp.push_back(myMap[sum][0]);
// temp.push_back(myMap[sum][1]);
// temp.push_back(i);
// temp.push_back(j);
// for(int a = 0; a < temp.size()-1; a++){
// for(int b = a+1; b < temp.size(); b++){
// if(temp[a] == temp[b]){
// goto COND;
// }
// }
// }
// count++;
// if(count == 1){
// sol = temp;
// }
// else{
// for(int z = 0; z < sol.size(); z++){
// if(sol[z] > temp[z]){
// sol = temp;
// break;
// }
// else if(sol[z] < temp[z]){
// break;
// }
// }
// }
// COND:temp.erase(temp.begin(), temp.end());
// }
// }
// }

// return sol;
// }


vector<int> Solution::equal(vector<int> &A) {
map<int,vector<int>>mp;
int n=A.size();
vector<vector<int>>vr;

for(int i=0;i<n-1;i++)
{
for(int j=i+1;j<n;j++)
{
int k=A[i]+A[j];
if(mp.find(k)!=mp.end())
{

if(mp[k][0]!=i && mp[k][1]!=j && mp[k][0]!=j && mp[k][1]!=i){
mp[k].push_back(i);
mp[k].push_back(j);
}
COND:temp.erase(temp.begin(), temp.end());
}
}
if(mp[k].size()==4)
vr.push_back(mp[k]);
}
else
{
mp[k].push_back(i);
mp[k].push_back(j);
}
}
}

return sol;
sort(vr.begin(),vr.end());
return vr[0];
vector<int> v;
return v;
}