Omkar Gaikwad

156 posts

Omkar Gaikwad banner
Omkar Gaikwad

Omkar Gaikwad

@omkargdotcom

Crafting digital dreams into reality 🌐 | Web Developer & Software Engineer

Pune Katılım Ocak 2024
71 Takip Edilen22 Takipçiler
Omkar Gaikwad
Omkar Gaikwad@omkargdotcom·
A helper function (inorder) recursively traverses the tree and updates pointers. The first node encountered becomes the head of the DLL, and the final result is printed in both forward and reverse order.
English
1
0
2
14
Omkar Gaikwad
Omkar Gaikwad@omkargdotcom·
#geekstreak2024 #DeutscheBank Day 3 of 21 Days POTD Challenge Powered By Deutsche Bank Problem: Alternate positive and negative numbers Approach: Separate positive and negative values, then push it into the new array in alternate manner. Copy new array to original array.
Omkar Gaikwad tweet mediaOmkar Gaikwad tweet media
English
1
0
2
37
Omkar Gaikwad
Omkar Gaikwad@omkargdotcom·
#geekstreak2024 #DeutscheBank Day 2 of 21 Days POTD Challenge Powered By Deutsche Bank Problem - Given a Binary Tree, convert it into its mirror. Approach - Use Recursion. Best way for solving Tree Problems.
Omkar Gaikwad tweet mediaOmkar Gaikwad tweet media
English
1
1
3
60
Omkar Gaikwad
Omkar Gaikwad@omkargdotcom·
My Approach - This approach is two-pointer technique. One pointer (fast) moves two steps at a time while the other (slow) moves one step. When the fast pointer reaches the end, the slow pointer is at the middle, returning its data. This method ensures a time complexity of O(n).
English
1
0
2
88
Omkar Gaikwad
Omkar Gaikwad@omkargdotcom·
#geekstreak2024 #DeutscheBank Day 1 of 21 Days POTD Challenge Powered By Deutsche Bank Problem - Given the head of a linked list, the task is to find the middle. Eg - The middle of 1-> 2->3->4->5 is 3. If there are two middle nodes (even count), return the second middle.
Omkar Gaikwad tweet media
English
1
0
10
1.1K

Keşfet

@DeutscheBank @geeksforgeeks @elonmusk @BarackObama @taylorswift13 @cristiano @BillGates @NASA