Yeah but to solve the bug user need to understand the code base which is very huge.
Usually it isn't really difficult. You only need to understand the module
Mat
Anonymous
But there are open source projects that have bugs for beginners
KDE, OpenOffice
Anonymous
But honestly i don't think "basic concepts" are enough
What do you suggest which will help??
Anonymous
Anonymous
Learn the language
I have been doing c c++ in competitive coding for a year around. So I guess I have learnt the language.
Anonymous
I have been doing c c++ in competitive coding for a year around. So I guess I have learnt the language.
You did not
Competitive programming doesn't require hard skills in c++
Anonymous
C++ is much bigger than you know
Anonymous
Can you help me by suggesting some references??
Anonymous
Can you help me by suggesting some references??
https://stackoverflow.com/questions/388242/the-definitive-c-book-guide-and-list
MᏫᎻᎯᎷᎷᎬᎠ
Anonymous
MᏫᎻᎯᎷᎷᎬᎠ
Specially with static cat
Anonymous
Do we have any algorithm to convert a regular expression into Deterministic Finite Automata?
Anonymous
Do we have any algorithm to convert a regular expression into Deterministic Finite Automata?
regexp can be both DFA NFA
MᏫᎻᎯᎷᎷᎬᎠ
/report #ot
Anonymous
Hlo
I am getting little bit confuse in a program
After checking it on internet 🙄
Sum of second highest and second lowest number in a array
Anonymous
no one can help you
Anonymous
Because you don't have a problem
Anonymous
You provided no context
No code
Over-engineering
What?
Anonymous
/report begging for solution
Over-engineering
Lol 😂
Anonymous
Hlo
I am getting little bit confuse in a program
After checking it on internet 🙄
Sum of second highest and second lowest number in a array
While traversing the array keep track of the highest, secondheighest, lowest and secondlowest element.
Dima
I am trying to come up with my answer, warn or no
Dima
Over-engineering
He is helpless
Over-engineering
😂
Till
Hlo
I am getting little bit confuse in a program
After checking it on internet 🙄
Sum of second highest and second lowest number in a array
std::sort(a.begin(), a.end());
sum = a[1] + a[a.size()-2];
Over-engineering
Not very good
Anonymous
I am trying to come up with my answer, warn or no
Dude can't find a solution for this problem (i think it's not hard) in google and begged for the solution
Over-engineering
Maybe he doesn't know STL too
Over-engineering
Give him a simple solution maybe
Anonymous
Over-engineering
We could make a binary search tree from the array then then the left leaf and it's parent would be the smallest and the second smallest elements 🙄
Anonymous
We could make a binary search tree from the array then then the left leaf and it's parent would be the smallest and the second smallest elements 🙄
It is O(nlogn) by time and O(n) by space
Over-engineering
The guy asking the question doesn't even know what space and time complexities are 😂
Over-engineering
It's Greek to him
Anonymous
The guy asking the question doesn't even know what space and time complexities are 😂
The guy doesn't know how to google
Till
We could make a binary search tree from the array then then the left leaf and it's parent would be the smallest and the second smallest elements 🙄
but why, when you can immediately update the maximum and minimum element when adding elements to the array, or to find such elements at compile time
Over-engineering
Satyam Kashyap do you know how to Google?
Anonymous
Satyam Kashyap do you know how to Google?
He doesn't
And he doesn't know how to read the rules
Over-engineering
I gtg sleep man
Over-engineering
It's 2 am here
Fonicy
How to push elements in a stack in c++?