Manish
@manish_219
Followers
34
Following
6K
Media
90
Statuses
142
Day 15 of levelling up :.1 DSA problem š„²:.->Minimum time taken to BURN the Binary Tree from a Node
Day 14 of levelling up :.5 DSA Problems : .->Root to Node Path in Binary Tree.->257. Binary Tree Paths.->236. Lowest Common Ancestor of a Binary Tree.->Check for Children Sum Property.->863. All Nodes Distance K in Binary Tree.
0
0
2
Day 14 of levelling up :.5 DSA Problems : .->Root to Node Path in Binary Tree.->257. Binary Tree Paths.->236. Lowest Common Ancestor of a Binary Tree.->Check for Children Sum Property.->863. All Nodes Distance K in Binary Tree.
Day 13 of Levelling up : .5 DSA problems :.->987. Vertical Order Traversal of a Binary Tree.->Top View of Binary Tree.->Bottom View of Binary Tree.->199. Binary Tree Right Side View.->101. Symmetric Tree.
0
0
1
Day 13 of Levelling up : .5 DSA problems :.->987. Vertical Order Traversal of a Binary Tree.->Top View of Binary Tree.->Bottom View of Binary Tree.->199. Binary Tree Right Side View.->101. Symmetric Tree.
Day 12 of levelling up :.Solved 1 DSA Problem:.->1358. Number of Substrings Containing All Three Characters.
0
0
1
Day 12 of levelling up :.Solved 1 DSA Problem:.->1358. Number of Substrings Containing All Three Characters.
Day 11 of levelling up : .Solved x DSA Problems : .->Minimum Platforms(GFG).->678. Valid Parenthesis String.->135. Candy.
0
0
2
Day 11 of levelling up : .Solved x DSA Problems : .->Minimum Platforms(GFG).->678. Valid Parenthesis String.->135. Candy.
Day 10 of Levelling up :.4 DSA problems : .->Jump Game -II.->N Meetings in One Room.->Non Overlapping Intervals.->Insert Intervals.
0
0
2
Day 10 of Levelling up :.4 DSA problems : .->Jump Game -II.->N Meetings in One Room.->Non Overlapping Intervals.->Insert Intervals.
Day 9 of Levelling up :.1 DSA problem :.->Longest Substring Without Repeating Characters.
0
0
2
Day 9 of Levelling up :.1 DSA problem :.->Longest Substring Without Repeating Characters.
Day 8 of Levelling up : .5 DSA problems : .->LRU cache.->Assign Cookies.->Shortest Job First.->Jump Game I.->Lemonade Change.
0
0
2
Day 8 of Levelling up : .5 DSA problems : .->LRU cache.->Assign Cookies.->Shortest Job First.->Jump Game I.->Lemonade Change.
Day 7 of levelling up :.8 DSA problems :.->Asteroid Collision.->Sum of subarray ranges.->Remove k Digits.->Largest rectangle in a histogram.->Maximal Rectangles.->Sliding Window maximum.->Stock span problem.->The Celebrity Problem.
0
0
2
Day 7 of levelling up :.8 DSA problems :.->Asteroid Collision.->Sum of subarray ranges.->Remove k Digits.->Largest rectangle in a histogram.->Maximal Rectangles.->Sliding Window maximum.->Stock span problem.->The Celebrity Problem.
Day 6 of levelling up :.->907. Sum of Subarray Minimums.->Number of NGEs to the right.->Fruit Into Baskets.
0
0
2
Day 6 of levelling up :.->907. Sum of Subarray Minimums.->Number of NGEs to the right.->Fruit Into Baskets.
Day 5 of levelling up : .4 DSA Problems : .->Next Greater Element.->Next Greater Element II.->Next Smaller Element.->Trapping Rainwater.
0
0
2
Day 5 of levelling up : .4 DSA Problems : .->Next Greater Element.->Next Greater Element II.->Next Smaller Element.->Trapping Rainwater.
Day 4 of Levelling up : .-> All Implementations of Stack and Queue. ->Infix to Postfix Conversion .->Prefix to Infix Conversion .->Prefix to Postfix Conversion .->Postfix to Prefix Conversion .->Postfix to Infix .->Convert Infix To Prefix Notation.
0
0
2
Day 4 of Levelling up : .-> All Implementations of Stack and Queue. ->Infix to Postfix Conversion .->Prefix to Infix Conversion .->Prefix to Postfix Conversion .->Postfix to Prefix Conversion .->Postfix to Infix .->Convert Infix To Prefix Notation.
Day 3 of levelling up :.5 DSA problems : .->(GFG)Find XOR of numbers from L to R.->1929. Concatenation of Array.->2011. Final Value of Variable After Performing Operations.->1512. Number of Good Pairs.->1822. Sign of the Product of an Array.
0
0
4
Day 3 of levelling up :.5 DSA problems : .->(GFG)Find XOR of numbers from L to R.->1929. Concatenation of Array.->2011. Final Value of Variable After Performing Operations.->1512. Number of Good Pairs.->1822. Sign of the Product of an Array.
Day 2 of levelling up : .Solved 5 DSA questions (Bit Manipulation): .->2220. Minimum Bit Flips to Convert Number.->136. Single Number.->137. Single Number II.->260. Single Number III.->78. Subsets
0
0
4
Day 2 of levelling up : .Solved 5 DSA questions (Bit Manipulation): .->2220. Minimum Bit Flips to Convert Number.->136. Single Number.->137. Single Number II.->260. Single Number III.->78. Subsets
0
0
4
Day 1 of levelling up :.Learnt Bit Manipulation.Problems : .->Check If iāth bit is set or not.->Check if a number is power of 2 or not.->Count the number of set bits.->Set/Unset the rightmost unset bit.->Toggle the iāth bit.->Clear the iāth bit
0
0
4
Just bought TUF+ by @striver_79 . Excited to dive in and level up my skills! Thank you for putting together such an amazing course!
0
0
5
RT @bigdatasumit: I asked my team member to give me one decent resume. I got one resume,. I checked the ATS score, it was 38. I did a lotā¦.
0
730
0
RT @atharvatwts: Giveaway timeš„:. 100DaysOfCode challenge can change your life and skyrocket your coding journey. I built the 100DaysOfCodā¦.
0
215
0
Day 4 of levelling up : .1 Hard DSA problem : .-Minimum Window Substring. Completed the @striver_79 's Sliding window playlist.Looking forward to start Greedy playlist problems.
0
0
3
Day 3 of levelling up : .1 DSA problem : .-Subarrays with K Different Integers. Learned about how sliding window algorithm can be used in many cases to solve : . -Formulating adjacent pairs.-Target value identification.-Longest/Shortest/ Optimal Sequence.
Day 2 of levelling up.6 DSA Problems :.-Fruit Into Baskets.-Longest Substring with At Most K Distinct Char.-Number of Substrings Containing All 3 Char.-Longest Repeating Char Replacement.-Binary Subarrays With Sum.-Count Number of Nice Subarrays.
0
0
6