Hey guys can anyone help me with this? I am working on it for 2 days and can’t get the logic! So question is like this: Given a string “2Aaaa443333o#”, “2” is a run of length 1; “Aaaa” is a run of length 4. The above string has 6 runs, the length of its longest run is 4, and the number of longest runs is 2. Here, the lower and upper cases of an alphabet letter are treated as the same symbol.

I think i made a mistake in the memory mangement or 🤔

So basically I have to find, these so called runs in a string. But how to separate them?

What is the reason for this code not to compile? Why does it try to resolve std::to_string call before the concrete type is known? Is there a way to prevent that (like we do with .template function calls)? https://ideone.com/224VeQ

I am getting this error when I declare my array as int arr[size]; and apply built-in sort function on this array. error: request for member ‘begin’ in ‘arr’, which is of non-class type ‘int [size]’

This is the code: int**i, i= malloc(sizeof(int*)), if (i==NULL) **i=5, free(i)

Hey guys can anyone help me with this? I am working on it for 2 days and can’t get the logic! So question is like this: Given a string “2Aaaa443333o#”, “2” is a run of length 1; “Aaaa” is a run of length 4. The above string has 6 runs, the length of its longest run is 4, and the number of longest runs is 2. Here, the lower and upper cases of an alphabet letter are treated as the same symbol.

Here you are allocating memory for an int* pointer. But this int* pointer is uninitialized. You must allocate memory for an int and make this int* pointer point to it. Without doing it, you are accessing memory which you are not supposed to which results in Undefined Behavior.

But in his code, he isn't accessing the pointer right!? And that if sentence would've made more sense if it was i != NULL...

Extending std namespace like you have done is Undefined Behavior. There are limited cases where extensions to std namespace is allowed. to_string is not one of those cases. You must do something like this instead. https://ideone.com/FdtzVz It doesn't try to resolve std::to_string call before the concrete type is known btw.

Thanks, do you know why the case without std works differently? I've tried with a custom namespace it also uses only overloads that were declared before the template, but if I put everything in the outer namespace then it start considering later overloads as well.

Thanks, do you know why the case without std works differently? I've tried with a custom namespace it also uses only overloads that were declared before the template, but if I put everything in the outer namespace then it start considering later overloads as well.

It is a bit weird, but that is why it works

The namespace resolution will try to find a function first in current context, then in the namespace where your class is declared

It is a combination of ADL and namespace lookup. If your template function and the arguments are defined in specific namespaces, then all overloads in those namespaces will be considered irrespective of where they are defined as long as your template function is accessed through that namespace. If not then only the namespaces of the arguments will be considered. If the arguments are not of a class type then only those overloads which are in scope before the template function will be considered.

Oh, so it also depends on the namespace from where I call it? Interesting, need to try some of the things, and will read about ADL, I see it's a big topic

Here you are allocating memory for an int* pointer. But this int* pointer is uninitialized. You must allocate memory for an int and make this int* pointer point to it. Without doing it, you are accessing memory which you are not supposed to which results in Undefined Behavior.

It is not dependent on the namespace from which you call it. What I meant is that a qualified name for a template function automatically adds the namespace qualification to the list of namespaces searched. The namespace you are calling it from doesn't matter. If you use an unqualified name, then the compiler uses the namespaces of the arguments alone to determine which namespaces to look up.

If a matching overload is found in both places and they are both equally viable, then it is ambiguous btw

then i did cout << digit << endl; print 8 instead of 9

Why do you expect 9 ?

that's my questions means i have just tried it and it shows this

anyone with mathematical programmer can explain it ?

[C memory leaks] Anybody know how to check for memory leaks without valgrind?

Compile with -fsanitize=address and link with -lasan.

Hey..can anyone suggest me any gud YT channel to learn C language for beginners?? 🥺

Use freecodecamp.org

Hey..can anyone suggest me any gud YT channel to learn C language for beginners?? 🥺

how to find duplicate in an array?...what is accumulate keyword?

In c++ how do I search for a particular pair in vector- pairs ?? Is there any function I can use to accept the key value from the user and then search for that pair ?

Is find() not helpful?

how to find duplicate in an array?...what is accumulate keyword?

In c++ how do I search for a particular pair in vector- pairs ?? Is there any function I can use to accept the key value from the user and then search for that pair ?

Otherwise you can use a multiset to store values and then use count() function

isn't multiset a bit overkill?

In c++ how do I search for a particular pair in vector- pairs ?? Is there any function I can use to accept the key value from the user and then search for that pair ?

Multiset will take O(nlogn) time. A for loop based approach will take O(n2) time

Nlogn time to insert n elements. And logn time to count for a particular element. So overall complexity will be O(nlogn+logn) i.e. o(nlogn)

Hey, guys a quick question: auto map = std::unordered_map<std::string, int>("string", 5); why I can't construct a temporary unordered_map with a key of std::string type

What's the error msg

Hey, guys a quick question: auto map = std::unordered_map<std::string, int>("string", 5); why I can't construct a temporary unordered_map with a key of std::string type

I think she/he wants to know how many times a particular pair occur in the vector

Hey, guys a quick question: auto map = std::unordered_map<std::string, int>("string", 5); why I can't construct a temporary unordered_map with a key of std::string type

so count(v.begin(), v.end(), key) * count(v.begin(), v.end(), val) ?

so count(v.begin(), v.end(), key) * count(v.begin(), v.end(), val) ?

What are you trying to do? If you want a dynamically created map then it's not the way to do it

I think Using count function of algorithm header file is not the efficient way to do it. (Correct me if I'm wrong)

I think she/he wants to know how many times a particular pair occur in the vector

inline vector<unordered_map<string, double>> Expreiments::generateStringKeyDoubleValueArray(int arraySize) { vector<unordered_map<string, double>> ret; for (int i = 0; i < arraySize; ++i) { unordered_map<string, double> keyValues; // 1 string randomKey = generate10CharRandomString(); auto randomValue = generateRandomDouble(); keyValues[randomKey] = randomValue; // 2 ret.push_back(keyValues); // 3 ret.push_back(unordered_map<string, double>(randomKey, randomValue)); // 4 } return ret; }; I want just delete 1, 2, and replace 3 with 4, which seems more simple to me, but why I can't do that

I think she/he wants to know how many times a particular pair occur in the vector

oh, well~~~, I may use the original way, and thanks for your help!!!

in a vector of pair, right?