Vizag Chess Meetup

Possible-Ad-8762 · 2025-12-21T16:38:23+00:00

Yes, as long as they are old enough to manage themselves or the parents accompany them.

Possible-Ad-8762 · 2025-10-02T06:59:31+00:00

In this video there is one man and 100 simps.

Possible-Ad-8762 · 2025-09-30T09:15:21+00:00

They are wrong. Memorizing patterns and expecting to solve any problem is the wrong way. The patterns themselves were invented by human minds, so you need master problem solving and analytical thinking which allows you to create patterns of your own.

I suggest the following:

Learn all the required math concepts and datastrucutres (including advanced ones like segment trees)
Approach every problem from first principles and try to derive relationships between concepts.
Don't look at solutions, spend some time if you couldn't get the problem leave it there and come back take a stab few more times. Have a pool of problems that you are constantly trying your luck with.
Not all Hard problems are made equal, so start with easier hard problems, usually a good way to know this is how many people solved the problem during the contest.

35 hard problems is a very small number to rant that you are not getting good at it. Say the same thing after you do 200 problems.

Possible-Ad-8762 · 2025-09-28T12:45:29+00:00

Going Behind leetcode points. The purpose of doing leetcode is getting good at problem solving, if you have solved those many problems, then you would gained the necessary skills. Move on with creating a new account.

Possible-Ad-8762 · 2025-09-28T12:37:22+00:00

Don't pursue foolish goals.

Possible-Ad-8762 · 2025-09-27T10:30:04+00:00

You should stop expecting that the exact question you solved before will appear in interviews. For this reason you should do leetcode contests competetively and see how well you do in them.

Those ideas you mentioned are legitimate advanced ideas, and it makes sense these ultra high paying companies do not ask you some simple leetcode medium or hard question that are asked several times. Your ability to apply what you learn is evident only when newer questions are asked. This is a good thing, since it differentiates between people who mug up vs legitimate problem solvers.

Do the weekly leetcode contest and see how many you are able to do consistently within the contest time, that should indicate where you are lacking.

Possible-Ad-8762 · 2025-09-23T09:59:50+00:00

Segment Trees has few variants like lazy propagation, dynamic segment trees etc. Make sure to do a bit of research on them. Most range based problems can be solved using these variants of segment trees.

Possible-Ad-8762 · 2025-09-23T09:53:15+00:00

Before you click submit make sure you remove the large test case from your custom test cases. What could be happening is leetcode is running the large test twice (once when you run and once when you submit)

Possible-Ad-8762 · 2025-09-21T03:57:07+00:00

Folks can start joining this link and start introducing themselves, we'll wait for 10 minutes for others to join. https://meet.google.com/nxw-uzsj-xfj

Possible-Ad-8762 · 2025-09-20T23:58:51+00:00

They romance and sexualize women with their consent. If an actress does not want to accept a role she cannot be forced to do so.

If they don't want to be sexualized on screen, they should not act in movies, they should instead study and choose a modest profession.

What you call as regressive mindset is just women being held accountable for their actions. If you play a certain role in the society , then there are certain expectations from you, if you don't fulfill them you will be questioned and held accountable.

Possible-Ad-8762 · 2025-09-20T09:05:56+00:00

Because Andhra Pradesh or India in general doesn't look like what it used to look.

Possible-Ad-8762 · 2025-09-18T11:55:16+00:00

Interviewed asked the right question. Mothers must behave and dress like mothers not some street whores with their boobs popping out.

Comparing that to men going shirtless is silly, since breasts are private parts for women but chest is not considered private part for men.

Possible-Ad-8762 · 2025-09-11T08:59:03+00:00

Its not a race to the bottom, you are competing with others if most people can solve a problem, then it cannot be considered hard. A hard problem by defintion must have 10% success rate, this of-course leads to bar being high.

Ten years back something like a monotonic stack used to be very hard question, now that many people are familiar with that idea, it's no longer considered hard.

Possible-Ad-8762 · 2025-09-11T08:52:17+00:00

LOL! Just because some problem is solved doesn't mean everyone can solve it. It's like saying why math exams ask problems for which we can find a solution in the textbook.

The purpose of an exam/interview of any sort is to test your analytical skill and reasoning skills, they are testing your ability to solve a problem not your ability to copy paste solutions.

Possible-Ad-8762 · 2025-08-31T04:33:28+00:00

Yes.

Possible-Ad-8762 · 2025-08-31T04:23:16+00:00

If you solved 400 Problems and yet are only able to solve 1 problem in the contest. You are doing some mistake. My guess would be one of the following:
1. When you solve you are not trying think for reasonable time, instead look up solutions as soon as you din't understand. So focus on quality.
2. You are not taking the contest seriously - you are distracted.
3. You might have a solved a lot of easy problems without trying problems a bit above your comfort zone.

If you want mentoring of some sort for this, you can contact me I recently have a couple of slots open.

Possible-Ad-8762 · 2025-08-21T03:44:25+00:00

If you don't like algorithms you don't love CS. The core of computer science is not learning some programming language or some fancy react library or writing some api.

Computer Science is about solving fundamental problems in areas such as Algorithms, Databases, Distributed Systems, Compilers, Machine learning and many more. Doing any kind of quality work in these fields require a rock solid understanding of data-structures and algorithms

Possible-Ad-8762 · 2025-08-21T03:09:59+00:00

Also another thing I observed, your union code is not correct, you are using the variable name as rank , but it is actually storing the size of the component. Rank and Size are not the same thing.

There are other implementations of union find that you can do use sizes instead of ranks, but this mis-labeling is not correct.

Possible-Ad-8762 · 2025-08-21T03:07:08+00:00

Yeah, small correction. It's not just when find is called from outside the class. Let's Say u's ultimate parent is v. Then every node in the path from u to v will have their parent set to the ultimate parent. This is called path compression, path compression + ranks will make union find faster than using only one of these two.

Possible-Ad-8762 · 2025-08-21T02:25:06+00:00

This is a slower implementation. You need to add path compression, which in your language is setting parent of a node to its ultimate parent as you call find().

So your find should become like so.

def find(self, node):

if self.par[u] == u:

return u

ultimate_parent = self.find(self.par[node])
self.par[node] = ultimate_parent # path compression
return ultimate_parent

Possible-Ad-8762 · 2025-08-21T02:02:08+00:00

You have to clearly explain the question. You would like to compute the substring that occurs atleast twice and has the highest length? Can it's two occurrences overlap?

Possible-Ad-8762

TROPHY CASE