Tweet
Day 53 of #100DaysOfCode
Started with create maximum number
then moved on to it's subproblems and kind of lost the original problem

Subproblems :
Find the most competitive subsequence
Remove K digits
Monotone Increasing digits (TLE)

#LearnInPublic #buildinpublic
Day 52 of #100DaysOfCode

Leetcode problems on monotonic stack
did two medium level problem but turned out to be same problem

Remove duplicate letters
Smallest subsequence of distinct chars

Monotonicity is good to have in skillsets

#buildinpublic #LearnInPublic
Day 51 of #100DaysOfCode

Leetcode problems on monotonic stack and queue continues
Minimum Size subarray
Sliding Window Maximum

These questions are extremely important as they cover stack, queue, deque, monotonic stacks/queue, sliding widow techniques.

#buildinpublic #leetcode
50% of #100DaysOfCode challenge done.
Thinking to increase more problems a day ratio and start on learning few other things as well
Suggest me from below given things parallelly
#SoftwareEngineer #SoftwareDeveloper #buildinpublic #learninpublic
Day 47 of #100DaysOfCode

Practicing stacks problems using everything that I could see
Hackerrank, leetcode, geekforgeeks, books etc.

Game of two stacks,
Next maximum element of array
Monotonic stacks
Largest rectangle of histogram

#learninpublic #buildinpublic
Day 46 of #100DaysOfCode
Shortest Path from Single Source (NPTEL)
Practiced problem on leetcode
Reverse A String (Two Pointer Approach)
Starting Problems Practice on Stack, Queue, Monotonics
#SoftwareEngineer #SoftwareDeveloper #buildinpublic
#learninpublic
Day 44 of #100DaysOfCode
Solved leetcode problem and revised scheduling in os
Bulb Switcher problem : turned out to be simple square root problem but took quite a while to figure it out.

#SoftwareEngineering #SoftwareDeveloper #buildinpublic #learninpublic
Day 43 of #100DaysOfCode
Low on health
Some problems on leetcode :
Time needed to buy tickets (Simulation)
Remove colored pieces of a game (Game Theory)
Game Theory is also an option to read and practice. It's fun.

#SoftwareEngineering #SoftwareDeveloper #buildinpublic
Day 42 of #100DaysOfCode
Learned about Prims Algo using heap and modification to heap approach.

Shortest Path by Single Source

Leetcode
Minimum student and Seating arrangement (simple sorting question)

#SoftwareEngineering #SoftwareDeveloper
#buildinpublic
Day 41 of #100DaysOfCode
Implemented Kruskal Algo using disjoint set.
Learned about Cut in a graph
Using this notion of cut to understand prim's algorithm.
Check out kruskal implementation
github.com/Rkverma94/DS-A…
#SoftwareEngineering #buildinpublic #SoftwareDeveloper
Day 40 of #100DaysOfCode
Practiced examples of Disjoint set along with path compression and union by size implementation.

City and Campers, Empire After Invasion questions solved.

Implementing Kruskal Algo.

#SoftwareEngineer #SoftwareDeveloper #buildinpublic
#learninpublic
Day 39 of #100DaysOfCode
Implemented Disjoint Set Data Structure
With array on continuous data nodes.

Optimized it by using union by size union by rank and by path compression.

#SoftwareEngineering #SoftwareDeveloper
#buildinpublic
Day 38 of #100DaysOfCode
Read Union Find Data Structure, directed graph from Introduction to Algorithms Cramer
#SoftwareEngineering #SoftwareDeveloper #buildinpublic
Day 33 of #100DaysOfCode
Still practicing DFS
Detect Cycle,
Connected Components - Count, Print Vertices,

Trying to figure out Complete Connected Components
Intuition : No of edges in complete graph = v*(v-1)/2

#SoftwareEngineering #SoftwareDeveloper #buildinpublic
Day 32 of #100DaysOfCode
Occupied with office tasks
Extended the previous code for finding Diameter of the Graph by DFS.
Now this diameter will help in finding the node which will generate the minimum height tree of the graph.
#SoftwareEngineering #buildinpublic
Day 30 of #100DaysOfCode
Tring to get topological sort

Finally 2-ways for maximum height trees problem
- Find diameter of graph and then find middle node.
- Start dfs on node with least degree and keep on removing nodes.

#SoftwareEngineering #SoftwareDeveloper
#buildinpublic
Day 29 of #100DaysOfCode
Practicing DFS (Nightmare at some point):
Implemented with recursion
without recursion
calculated Height/Depth of Graph

Minimum Height Trees in a graph by Consecutive DFSs
(getting TLE)

#SoftwareDeveloper #softwareengineer #buildinpublic #learnInPublic