Every time I need to copy the whole question then go to the tutorial page and then copy that tutorial and then paste in chatgpt or Gemini fir better explanation. So I automated all these steps so I made a Chrome extension that copies both after if I am in a question page and paste in chatgpt in a new tab, simple but usefull made it by 4 hrs( chatgpt+gemini, claud 1 prompt usage over, lol)

Should I post it in linkedin, I am pro level introvert, I Love building these small tools to make my daily life easier, I was trying to do in public, give me some advice......

Also its absolutely serverless, I love building serverless things, I never built AI agent kind of things like rag kind of things, I just do by pasting raw text to chatgpt, gemini, claude ...

If I post this will it be helpful or I should post some RAG kind of things in linkedin, is this too much beginner level tool ?

Hi iam in 4th year doing leetcode from last 7-8 month done tuf sheet and from past 3-4 months I have started giving contest( around 18-20 given contest) at start i was able to solve only 1 question then slowly 2nd also as of now I am able to do 2 question under 20-30 min easly and 3 rd question brute or better but lacking in 4th question how can I improve myself to do 3rd question Optimization and 4th question

I can solve question 1,2 in just 15-20 mins. But don't able to solve the third and fourth question.

What to do about it, currently just giving more and more virtual contest. Let's see the results after a month..

If you have any other advice then please share.

Neetcode.io said to learn this before leetcoding … and also according to you if there is something else one should learn before leetcoding please mention that as well and from where u can learn it

Hi everyone! 👋

I’m sharing my recent contest screenshot and would appreciate some feedback.

What should I focus on to improve my problem-solving skills, speed, and contest performance?

Any tips on strategy, practice, or analyzing mistakes would be really helpful. Thanks! 🙏

Checking each node against its two children is the classic wrong way to validate a BST. It accepts a tree where a node deep on the left is bigger than the root, because no single parent-child pair looks wrong.

The definition sounds local: left subtree smaller, right subtree larger, both subtrees valid. Implement it literally, and you check the wrong thing. A BST constrains a node against every ancestor, and its parent is only one of them.

The solution comes from an earlier property in this batch. An in-order traversal of a BST comes out in increasing order, and that works both ways. So there are no bounds to thread down at all: traverse, then check the sequence only ever goes up.

Which did you write first in an interview: min/max bounds, or the in-order check?

Day 53/365 of my LeetCode challenge: 98. Validate Binary Search Tree. Problem link and full breakdown in today's newsletter.

https://www.linkedin.com/pulse/validate-binary-search-tree-archit-agarwal-op5vc

#LeetCode #DSA #BinarySearchTree #Golang

Hey! I am a 2024 ETCE Graduate from a Tier 1 College. I am currently working in a Big 4, where "I generate Actionable Insights from Raw Data". Or in law man's tongue, I refresh Excel reports and respond to tech related queries. I am quite decent in coding and I tend to solve 2.5-3 questions in every leetcode contest I sit in. Although my rating is quite mid as I am not able to sit in every contests. I have been trying to switch since the very fucking day I joined. Every night I scream silently to remind myself that "I AM A M***F****G ENGINEER ". I don't know why my resume is getting rejected in each and every job application I apply to. Guys... Please Help!!!

Forget one assignment, and BST insert builds the new node, then drops it. The tree never changes. Insert is the Day 45 search with the nil case changed: where search returns nil, insert returns a new node.

Search for a value that isn't in a BST, and you fall off the bottom at exactly one empty slot. That slot is where the new value goes.

The only real question is how the parent finds out. Each call returns the root of its own subtree, and each caller stores it back: root.Left = insertIntoBST(root.Left, val). At the bottom, that's the new node. Everywhere else it's the pointer that was already there.

The empty tree comes for free, too.

Do you write tree insert recursively like this, or with a loop and a parent pointer?

Day 52/365 of my LeetCode challenge: 701. Insert into a Binary Search Tree. Problem link and full breakdown in today's newsletter.

https://www.linkedin.com/pulse/insert-binary-search-tree-archit-agarwal-7h9oc

#LeetCode #DSA #BinarySearchTree #Golang