Shilendra Singh

491 posts

Shilendra Singh banner
Shilendra Singh

Shilendra Singh

@Shilendra_dev

22/Engineer | building do'desk - https://t.co/cHfGadwhOA

Rajasthan Katılım Kasım 2023
289 Takip Edilen215 Takipçiler
Sabitlenmiş Tweet
Shilendra Singh
Shilendra Singh@Shilendra_dev·
Is it good ? what do you think
Shilendra Singh tweet media
English
0
0
6
1.3K
Shilendra Singh
Shilendra Singh@Shilendra_dev·
Happy diwali everyone ❤️❤️❤️
Shilendra Singh tweet media
Filipino
1
0
8
247
Shilendra Singh
Shilendra Singh@Shilendra_dev·
❓DSA #287 - Requirements needed to construct a unique BT ✅Solution - This was a conceptual question. Lets say if you have inorder, preorder and post order, what will give a unique BT? Only one of them can't. We need two of them. Check this out: - Pre-Order: Gives guarantees the location of root node - Inorder: Gives us left and right subtrees (if we can figure out root) - Post-Order: Gives guarantees the location of root node This means any traversal in combination with inorder can give us a unique BT. #dsa
Shilendra Singh tweet media
English
1
0
2
142
Disha
Disha@dishafaujdar·
Why am I soooo stupid ??.???
English
1
0
5
133
Shilendra Singh
Shilendra Singh@Shilendra_dev·
Cursor or VS Code - which one do you use ? Or you are just broke so you use VS Code only
Shilendra Singh tweet media
English
1
0
2
385
Shilendra Singh
Shilendra Singh@Shilendra_dev·
I have a different take, Industry is moving pretty fastly, if you don't do development now, you wont get placed. Right now leaving the top MNCs, no good companies are hiring the 'DSA Experts', they need good developers. I will say you have time, do 3-4 DSA problems daily, and dedicate all left time to development
English
0
1
1
127
Shilendra Singh
Shilendra Singh@Shilendra_dev·
❓ DSA #285 - Count total nodes in a complete BT [in < O(n) TC] ✅ Solution - Recursively checkout out the height of left subtree and right subtree, until leftheight = rightheight, than simply (2^height+1) gives count of nodes. Recursively calculated the height while backtracking #DSA
Shilendra Singh tweet media
English
0
0
3
78
Kavya Goyal
Kavya Goyal@Kavya_on_X·
Just came across this comment for second year students! Realized more or less after first year it's all same
Mehak Saluja@salujamehak5

@Aditya989746994 Filhal toh I will say, Do DSA daily Build some good projects Learn something daily Share online and be active on different social media related to your field

English
1
0
0
71
Shilendra Singh
Shilendra Singh@Shilendra_dev·
hahaha i am no 'sir' kavya, a good project is one that shows that you solved a very complex problem. It should not be what everyone is building or a tutorial follow up (like ecom site etc etc). When someone sees it, they should feel like its not 'just a project', its a 'product' ready to be used by thousands of users. There is no problem in developing what's already made, like a linear clone, google meet, etc, just it should be a very polished product.
English
1
0
1
24
Mehak Saluja
Mehak Saluja@salujamehak5·
Seeing final-year students struggle so much to get placed gives me a different kind of anxiety. Next year I’ll also be in my final year. So, to all the 4th-year students out there, please share some advice for a 3rd-year student like me. 🥲
English
136
25
1K
54.4K
Shilendra Singh
Shilendra Singh@Shilendra_dev·
❓ DSA #284 - Print all nodes at a distance of K in BT ✅ Solution - Did a BFS , Created a map to store parent and nodes, so that we can travel left, right, parent. Did BFS again maintaining a visited hashSet, did node->left, node->right, node->parent, Distance incremental. When distance = K, all the elements in the queue are our answer. #DSA
Shilendra Singh tweet media
English
0
0
1
48
Shilendra Singh
Shilendra Singh@Shilendra_dev·
❓ DSA #283 - Maximum Width of BT ✅ Solution - Did a BFS (Level Order), Created custom data structure Pair(TreeNode, Index), while traversing on BT i added actual index of every node. 0 based indexing. At every level iteration i determine if its the first element of the level, store it in 'first', if its the last element of the level, store it in 'last'. In the end 'ANS = MaxOf(ANS, last-first+1); #DSA
Shilendra Singh tweet media
English
0
0
6
71
Shilendra Singh
Shilendra Singh@Shilendra_dev·
Sick of not getting any replies from companies, have applied to more than 100 now. Anyone here can tell how can I get an internship #webdev
Shilendra Singh tweet media
English
4
1
10
1.2K
Shilendra Singh
Shilendra Singh@Shilendra_dev·
@____protagonist And well mail is just for the picture, i apply on all the platforms, get assignments, do submit it on time, no replies.. thats what i am actually sick of
English
0
0
0
19
the
the@____protagonist·
@Shilendra_dev If I ever see this email, i would not even be willing to check the resume, it's not your skills but show curiosity and try to show some interest or willingness to join, and showcase what challenges or projects you did
English
2
0
1
81
Shilendra Singh
Shilendra Singh@Shilendra_dev·
#Buildinpublic - Creating codeginie: OpenSource AI coding agent Codeginie AI agent status - Have built a working AI agent that can help you create projects. #webdev
English
2
0
11
290