u can't access member function of class ...need object to access them or else make it static

Can anyone help me interview preparation?

How do I interpret the arrow operator (->) in C/C++ when three or more operands are involved? For example, if a, b and c are the operands, how do you interpret a->b->c?

Guys why do I get a negative result

May be overflow. Check by reducing the number.

When n = 13, the result starts to become negative

You are overflowing the limit of data type used. So either used a data type with more size or use number upto 13.

finclude <type.h> /• loads file with predicate isdigit */ int lookahead; main() lookahead = getchar (); exprl): putchar ('\n'); /* adds trailing newline character */ expr () term(); while (1) if (lookahead == '+') { match('+'); term(); putchar ('+'); else if (lookahead == '-*) ( match ('-'); term(); putchar ('-'); ) else break: term ( ) if (isdigit (lookahead)) 1 putchar (lookahead); natch (lookahead); else error(); match(t) int t; if (lookahead *= t) lookahead = getchar (); else error (); ) error () printf ("syntax error\n"); /* print error nessage exit (1); then halt

I wrote almost the same program and this time it worked.But what's the difference?

How do I interpret the arrow operator (->) in C/C++ when three or more operands are involved? For example, if a, b and c are the operands, how do you interpret a->b->c?

Hi hope you are doing well Please i need help , anyone have a free course about complexity and big notation ? , or any sources that help me ✨? Thank you so much …

In the second one variable is initialized to 1 just before the second loop starts, while in the first one it is initialized after the damage is done. I could be wrong but try it out.

I changed "n<20" to "n<=20" and it works😂

This is really weird. You are actually increasing 1 iteration.

https://hastebin.com/okotoyujez.cpp

https://hastebin.com/okotoyujez.cpp

First, choice var is unitialized but you access the value. It's UB And, you already have NULL handler but It's useless

First, choice var is unitialized but you access the value. It's UB And, you already have NULL handler but It's useless

Give empty return ; to break void function

I guys! If I have a struct like this: struct node_t{ struct node_t *next; char *string; } Which represents a node in a list. And a node struct node_t *new; when I need to delete new, I'll have to save the current location this way: struct node_t *to_free= new; struct node_t *to_free; // Stuff free(to_free); ok, but is it right? In fact, we do have two more pointers inside the node: the pointer "next" to the next node in the list, and the char *. Do I need to free them too?

First, choice var is unitialized but you access the value. It's UB And, you already have NULL handler but It's useless

i want to find all the indexes of a element present in a array.. eg {1,2,3,2} if want to find index of 2 .. i should get {1,3} using find only gives me index 1

You can run find in a while loop store iterator outside of the loop, first, initialize it with begig pass that iterator to search (so it searches from that iterator) save the result to that iterator, exit the loop when it points to end() You can also do search manually in a for loop, comparing each element

thx

It's only free the memory allocated for struct, not allocated memory for the member

https://www.godbolt.org/z/4zPxzWz8W how to make this work?

Well think about it. The compiler says it is a non deducible context because given information about B, it is not possible for the compiler to deduce which A instantiation it is a part of. For ex I could have a specialization of A like this: class MyUDF{...}; template<> class A<int>{ public: using B = MyUDF; }; So suppose hash were called for MyUDF, how is the compiler supposed to deduce that Type is int based on that?

thx. is there any workaround? Or I just pass custom hasher everywhere?

What is it that you are trying to do?

For any specialization of A, B can be hash using this hasher

That is not possible at all based on what I just said. template<> class A<Alpha>{ public: using B = MyUDF; }; template<> class A<Beta>{ public: using B = MyUDF; }; What would the compiler do? Again, am asking why you want to do this? Why should the parent class's template parameter control the hash template instantiation for a nested class? That just doesn't make sense at all forgetting that the compiler won't allow you to do it.

Because B uses Type and I want to create a std:unordered_set<B> inside A.

Just define a custom hash function object instead of specialising hash template and pass it in as the third template parameter argument for unordered_map

https://hastebin.com/okotoyujez.cpp

Hi, How to Append a Char to a Char Pointer? char self = 'k'; char *word; word = (char*) malloc(12*sizeof(char));

Not the best of ideas if you haven't allocated memory for char *word... It might end up overwriting something else.

I changed post

The simplest way to do that is #include <stdio.h> int main() { char word[10]; word[0] = 'k'; word[1] = 'o'; word[2] = '\0'; printf("%s\r\n",word); return 0; }

I know that, I just want for Pointer

Can i set p=a[3][1] ? (p is a pointer)

Can i set p=a[3][1] ? (p is a pointer)

Use double pointer

I am new to c++, tried making a Class Array.. with sort, search and display methods. When i call method with reference to object it prints garbage values of array. I don't know much about how classes work in c++. https://pastebin.com/Hbdi5BHC

Someone help pls

int A[size]; line is wrong. Correct: int* A = new int[size];

int A[size]; line is wrong. Correct: int* A = new int[size];

Why is it wrong? Can i only declare array like this with actual parameter?

Can i set p=a[3][1] ? (p is a pointer)

int

int

int

But you need to use int**