Yeah?

i don't know

first i downloaded the site it then it came with avast free antivirus

first i downloaded the site it then it came with avast free antivirus

I think you downloaded from the wrong website

kindly send if you can.....i think that will help

Alright

http://www.codeblocks.org/

Tee

yes

thanks

which file is the best to download???i am asking this because i can see different options

which file is the best to download???i am asking this because i can see different options

What are the alternatives?

thank you klimi

/I_am_a_dork

/I_am_a_dork

👍

/I_am_a_dork

/blue_text_must_click

/blue_text_must_click

/blue_text_must_click

/blue_text_must_click

/blue_text_must_click

/I_am_a_dork

silly

silly

You're adorable

That code doesn't use DP i think

Normally you'd solve that in O(n²) complexity

However you can you manachers algo too which solves in O(n) and that uses dp

However you can you manachers algo too which solves in O(n) and that uses dp

This is quite complex though

I meant the way you meant DP. To think the dp solution of that question is quite hard

No. O(n²) is non-dp. O(n) is DP

Nope. Search longest palindromic substring on leetcode

lol leetcode pupils

Hello. Can anybody suggest me some good courses on low level programming like assembly (x86-64) and C?

Just search longest palindromic substring on Google or anywhere

lol leetcode pupils

It's still better than lot of the other coding sites🤷‍♂

perhaps

Check approach 4

That was what I was talking about

And i think it's still even easier than the O(n²) DP

Yep. Simple yet mind blowing lol

I see

Yep. It has one of the best discuss sections too

okay

get a book

lol bruh

have you read the rules?

https://lmgtfy.com/?q=c%2B%2B+beginner+book

Bruh just search on YouTube or Google. You'll find 100s of suggestions

Bruh just search on YouTube or Google. You'll find 100s of suggestions

There is no problem if you guide him and give him your suggestions

There is no problem if you guide him and give him your suggestions

there is no definitive way of learning something

There is no problem if you guide him and give him your suggestions

This is not guiding or suggesting. This is spoon feeding

nobody here will give someone private lessons without getting something out of it, unless theyre an absolute masochist

Is calling a lambda faster as calling a function?

Same

Hello, also if lambda contains captures?

References captures?

I know that lambda is like a class... And is not clean if in a for loop call a lambda could be convenient...

Hello

Mmm OK, there is always or only in specific cases?

Which overhead?

Hello, also if lambda contains captures?

Yes, same

But also with captures?

Yes

Captures affect construction cost

??

I answered about call cost, compared both non-inlined

Captures affect construction cost

If the captures are extern constant? Like const double d = 12.0;

Not variables

If the captures are extern constant? Like const double d = 12.0;

It doesn't matter

What IDE would you reccomend me for c/c++?

Try Vim

Try Vim

neovim

It doesn't matter

I was reading about someone that suggest to use static const to not use captures, is it possible?

What IDE would you reccomend me for c/c++?

for little-medium projects i use neovim or emacs for cli editing, or vscodium.com as my primary gui ide for big important projects give qtcreator a look

I was reading about someone that suggest to use static const to not use captures, is it possible?

It is possible and may be cheaper, but code will be worse if a variable gains large scope when it should have small scope

It is possible and may be cheaper, but code will be worse if a variable gains large scope when it should have small scope

Or also to define the lambda as static to make the object one time

Worse from architecture/style perspective

Can someone send me an app for programming c++ kindly

vscodium.com

Or also to define the lambda as static to make the object one time

Static with initialization has access overhead

Most of the time creating a lambda is very cheap, even in loop