@Chris-Kawa

ha, the code is good, but does not pas all tests.
it doesn't pass the tests within in the time limit, handling set of numbers up to 100000.

Your code did not execute within the time limits void swap(std::map<int, int>& countsdata, int &count, int& a, int& b) { countsdata[a]++; int temp = a; a = b; b = temp; count++; } void minimumMoves(vector<int> q) { std::map<int, int> countsdata; int count = 0; for (int i = q.size() - 1; i > 0; --i) { for (int j = 0; j < i; ++j) { if (q[j] > q[j + 1]) swap(countsdata, count, q[j], q[j+1]); } } bool tooChoatic = false; for (auto& c : countsdata){ // i suspect this is the culprit. if(c.second > 2){ tooChoatic = true; break; } } if(tooChoatic){ std::cout << "Too chaotic" << std::endl; // jumped more than 2 positions. } else{ std::cout << count << std::endl; } }

@Please_Help_me_D

you're welcome.

i would like to know how you lines of data looks like.

regards

@JohanSolo

thnx, in the end i changed the program into vector and solved the riddle.

vector<int> Array; int setter = 1; for(int i = 0; i < n; i++){ Array.push_back(setter); setter++; }

@Natural_Bugger
compareFunction is passed to std::sort() without any following parentheses, i.e. not compareFunction(...). That means at this point is does not call the function, it merely passes the address of the function. std::sort() works through the vector element range you passed, taking pairs of elements and now calling compareFunction(element1, element2).

@Christian-Ehrlicher @J-Hilk @JonB

thank you all.

this is how i solved it, i just had to adapt it to pair.

if (std::find(data.begin(), data.end(), std::pair<std::string, string>(firstName, emailID)) != data.end()) std::cout << "Element found"; else{ std::cout << "Element not found"; data.push_back( make_pair(firstName,emailID) ); }

Hi,
this
do {
*(*it+1) = 'S';
} while (it != std::end(grid));
doesn't never end because the iterator is not incremented! (endless loop)

@Chris-Kawa
this is what i came up with:

int findSimularchars(vector<string> arr) { std::map<char, int> values; char alpha[] = "abcdefghijklmnopqrstuvwxyz"; for (long unsigned int i = 0; i < strlen(alpha); i++) { values.insert(std::make_pair(alpha[i], 0)); } for(auto ii : arr){ for(long unsigned int j = 0; j < strlen(alpha); j++){ std::size_t found=ii.find(alpha[j]); if (found!=std::string::npos){ std::map<char, int>::iterator it = values.find(alpha[j]); if (it != values.end()) it->second = it->second + 1; } } } int counter = 0; for(auto& x : values) { if(x.second == arr.size()){ counter++; } } return counter; }

works perfect.

@JonB

thnx for your help.
when i sorted the vector, it worked, mine aswel yours.

how hard can it be
: )

@JonB

yeah, i got it already.
i choose the smallest vector for the outer loop and and biggest for the inner.

but thnx anyway.

@JonB said in filling a vector with pairs:

thnx very much for your answer

for (int i = 1; i <= n + 1; i += 2) pagesVec.emplace_back(i - 1, (i <= n) ? i : 0);

that solved the issue

yeah, I tend to think of volatile as a modifier for variables and not classes. Often ask in interviews whether the candidate knows what its for in embedded systems. Often misused, but important to understand the implications and when they are desirable: memory mapped register manipulation, etc.

bool element_exist(const std::vector<std::array<int,2> >& input, int key) { auto it = std::find_if(input.begin(), input.end(), [&](auto& elem) { return elem[0] == key || elem[1] == key; }); return it != input.end(); }

@JonB
thnx, i got it working now, i had to do some minor improvements and pass the tests.

@SGaist
hi, thnx for your reply,

afterwards, i found this one.
https://stackoverflow.com/questions/5844657/splitting-a-c-string-into-two-parts

size_t found = str.find(" "); if(found != string::npos) { string temp1 = (str.substr(0,found)); string temp2 = (str.substr(found+1, string::npos)); }

it did the job.

i can't use the QT parts for these assignments.

@JonB

thank you for the reply.

well, i saw that some people or most did that for the same problem, but in Java and apparently, they also sorted the "array/map" like Chris Kawa mentioned it worked for them.
so i tried that as well in c++.

bit i also think the "solutions" they published do not work, because they only compare 2 (if) or else (nothing). no taking in consideration if the list of values is either even or uneven in length or the numbers of equal value is either even or uneven.

now i'm using nested "Do While" loops instead of For loop in combination with Iteration.
what to do next?

.

@jsulm

ay, i didn't notice..
thanks alot.

std::getline() knows about std::string but it doesn't know about QString. So, store your input in a std::string first and then call QString::fromStdString().

See https://doc.qt.io/qt-5/qstring.html#fromStdString

@sierdzio
Blimey, yes, that's a bit to read that I am unfamiliar with! I will do so if I want to go down that route, thank you.

As the second reply there states, the fact that Ubuntu is now at libreadline.so.8 implies that it will not be binary compatible with expectations for libreadline.so.7. The change in version number tends to indicate this. That is fair enough.

But then I am equally "surprised" that when I look Ubuntu 20.04 only offers an apt-get install ... choice of libreadline8 or libreadline5. No libreadline7.

Anyway, I have just spoken to a Linux Admin friend, and he says he's not keen on version-independent linking, as the app may indeed fail to work with a newer version. He says he would expect either

Go find the correct old version in an older Ubuntu, and get that.

Or, recompile & relink against what's available now. Which is what I will do, when I have the time.

So @sierdzio thanks for your answer, it's useful to know about the version-independent, but I am going to mark this as my correct solution.