Zaid Khan 🇮🇳 @ZK0413743669863

Analyst @Deloitte USI | @Amazon MLSS'24 Joined March 2023

Tweets

19
Followers

2
Following

64
Likes

7

Zaid Khan 🇮🇳 @ZK0413743669863

2 months ago

Officially a Girlscript Summer of Code Contributor'25

0 0 0 21 0

Download Image

Zaid Khan 🇮🇳 @ZK0413743669863

3 months ago

I just published Binary Lifting(Jump pointers) The how,why and when to use it. medium.com/p/binary-lifti… .Hope it helps🫡.

0 0 1 25 0

Zaid Khan 🇮🇳 @ZK0413743669863

3 months ago

While giving a leetcode contest. I came across segment trees so I learnt about it. Want to share what i learnt so i have published it. medium.com/@zaid03/what-a… Hope it helps✌️

0 0 2 45 0

Leetcode 452 Problem no.3568-BFS + Bitmasking + 4D Visited Array to track (x, y, mask, energy,d=no of moves) states and avoid re-visiting, ensuring optimal path to collect all litters.Python-giving overhead issues so used C++.Could'nt solve at the time of the contest so discussed

0 0 2 40 0

Zaid Khan 🇮🇳 @ZK0413743669863

4 months ago

Wanted to share this for trying for bruteforce: As a rule of thumb,if your input size is n, and your algorithm's timecomplexity is O(f(n)), then f(n) should generally be less than 10^8 for most LeetCodeproblems. So less than 10^8 is the tc then bruteforce solution ispossible.

0 0 0 27 0

Zaid Khan 🇮🇳 @ZK0413743669863

4 months ago

Speed was key in lc weekly contest 452

0 0 0 31 0

Zaid Khan 🇮🇳 @ZK0413743669863

4 months ago

Participated in lc weekly contest 452.Solved 2 questions aiming for 3.Will discuss all problems by today.

0 0 0 31 0

Zaid Khan 🇮🇳 @ZK0413743669863

4 months ago

Starting weekly contest on leetcode from this week. Will share my discussions on it.weekly.Stay tuned.

0 0 1 39 0

Zaid Khan 🇮🇳 @ZK0413743669863

4 months ago

Solved LeetCode 2360: Longest Cycle in Graph DFS approach: Use visited[node] = length at which node visited Global visited array Cycle length = Total length traversed - visited[node] Get max of cycle lengths Key: Focus on cycle length, not total path length.LLM server still down

0 0 3 36 0

Zaid Khan 🇮🇳 @ZK0413743669863

4 months ago

Today the llm wrapper service i am working on is down so i cant build on it. So read about python tuples ?Everyone knows tuples are immutable.But why did tuples come to existence. Not because of the fact that it is immutable but it is faster than lists.

0 0 0 36 0

Zaid Khan 🇮🇳 @ZK0413743669863

4 months ago

Learned about power of incremental development

0 0 0 21 0

Zaid Khan 🇮🇳 @ZK0413743669863

4 months ago

Came accross Kahn's algorithm for topological sorting. Used that algorithm for course scheduling. Other approach can be using DFS and a stack

0 0 0 28 0

Zaid Khan 🇮🇳 @ZK0413743669863

4 months ago

🚰 Today I solved the Water Jug Problem in Python! 🔹 Used BFS to simulate all possible states 🔹 Also learned the elegant one-liner using gcd(x, y) 💡 If desired is a gcd of x,y and x+y<=d then true 🔹 Explored DFS vs BFS tradeoffs

0 0 0 26 0

Zaid Khan 🇮🇳 @ZK0413743669863

4 months ago

Switching from C++ to Python

0 0 0 21 0

Zaid Khan 🇮🇳 @ZK0413743669863

4 months ago

While reading abt(Py2 vs Py3): ✅ @property = getter/setter ✅ super() = clean parent calls ✅ Descriptors = control attr access ✅ MRO = consistent method order (C3) ❗Only work in new-style classes: class A(object): In Py3, all classes are new-style 😎 by default #Python #OOP

1 0 0 35 0

Zaid Khan 🇮🇳 @ZK0413743669863

5 months ago

Learned about OAuth 1.0 vs. OAuth 2.0 at work. OAuth 1.0 uses crypto signatures and has no expiry date, while OAuth 2.0 uses bearer tokens with an expiry date, renewed via refresh tokens. OAuth 1.0 is more secure in non-HTTPS conditions, whereas OAuth 2.0 is more secure in HTTPS.