Akash

Trying to be better than yesterday

[Akash @chillipilot]

Let's see if I can reach 500 by EOY

[Akash @chillipilot]

Finally got somewhere...

[Akash @chillipilot]

@Divyansh91565 Yesss

[Akash @chillipilot]

@shaqxdev @takeUforward_ I'll have to spend the next 15 days clearing the backlogs of this challenge 😂

[Akash @chillipilot]

@phant5782 @striver_79 @takeUforward_ @OrionAnkit @jolly1094 Crazy consistency 👏

[Akash @chillipilot]

@kartikktwt Sounds intense

[Akash @chillipilot]

@AbhinavXJ Got the tbi perks from xlancr?

[Akash @chillipilot]

@kartikktwt With supportive ppl like u around... It'll change pretty soon 🙃

[Akash @chillipilot]

This needs to change...
And it will 😌☝️

[Karthik @kartikktwt]

reading about myself is cool

[Akash @chillipilot]

Day 42 of #SDESheetChallenge @takeUforward_
@striver_79

1) Floor & Ceil: same logic as successor and predecssor 2) Kth Smallest & Largest: applied inorder traversal on the tree storing vals in a vector and applied indexing

[Akash @chillipilot]

Day 42 of #SDESheetChallenge @takeUforward_ @striver_79

1) Floor & Ceil: same logic as successor and predecssor
2) Kth Smallest & Largest: applied inorder traversal on the tree storing vals in a vector and applied indexing

[Akash @chillipilot]

Day 41 of #SDESheetChallenge by @takeUforward_
@striver_79

1) BST frm Preorder & Validate BST: Used upper and lower bound logic recursively.
3) Inorder successor and predecessor: used pointers to track both.
4) LCA in BST: traversed by comparing root with p and q.

[Akash @chillipilot]

Day 41 of #SDESheetChallenge by @takeUforward_ @striver_79

1) BST frm Preorder & Validate BST: Used upper and lower bound logic recursively.
3) Inorder successor and predecessor: used pointers to track both.
4) LCA in BST: traversed by comparing root with p and q.

[Akash @chillipilot]

Rating is fucked 🫠

[Akash @chillipilot]

Almost created an algo trying to solve this one 😭

[Akash @chillipilot]

Day 40 of #SDESheetChallenge by @takeUforward_
@striver_79

1) Populating nxt pointers: using parent's next to connect right child is the trick
2) Search in BST: pretty ez and intuitive
3) Sorted arr to BST: got hella confused with this one until I found out the bs approach

[Akash @chillipilot]

Day 40 of #SDESheetChallenge by @takeUforward_ @striver_79
1) Populating nxt pointers: using parent's next to connect right child is the trick
2) Search in BST: pretty ez and intuitive
3) Sorted arr to BST: got hella confused with this one until I found out the bs approach

[Akash @chillipilot]

@shaqxdev Maybe the task board can have a bit more padding around the text but everything else looks nice...
The idea itself is pretty unique so kuddos for that as well

[Akash @chillipilot]

@shaqxdev Damn that's impressive

[Akash @chillipilot]

Day 36 of #SDESheetChallenge by @takeUforward_
@striver_79

1) Level Order: Used a queue to record each level and store in vector
2) Max Depth: Used the same logic as lvl order to realize no. of lvls
3) Diameter of BT: req. assistance for the recursive function logic