dev_ansh

Multipotentialite

[dev_ansh @bdevanshh]

@athrix_codes @vercel Please do some perf optimizations on the site, otherwise its sick ♥️

[dev_ansh @bdevanshh]

Checkout here:

https://t.co/qZn0tjXho3

[dev_ansh @bdevanshh]

Redesigning some of my blog diagrams.

Any suggestions?

[dev_ansh @bdevanshh]

@ramxcodes Here you go

https://t.co/t6xIn94bCl

[dev_ansh @bdevanshh]

@OjasSharma276 I have also wrote about. It is my first blog tho.

https://t.co/vacx9sb1xW

[dev_ansh @bdevanshh]

I have gathered some good engineering blogs in one place.

Reply If you have some suggestions.

⬇️ Link is in the reply.

[dev_ansh @bdevanshh]

https://t.co/t6xIn94bCl

[dev_ansh @bdevanshh]

I have gathered some good engineering blogs in one place.

Reply If you have some suggestions.

⬇️ Link is in the reply.

[dev_ansh @bdevanshh]

Day 52 of #SDESheetChallenge

We are starting with DP today. Today's challenge is some basic DP problems related to subsequences.

Problems Solved:
• Max Product Subarray
• Longest Increasing Subsequence
• Longest Common Subsequence

@takeUforward_

[dev_ansh @bdevanshh]

Day 51 of #SDESheetChallenge

Today's challenge is some more algorithms to finish the graph topic. Next up is my favourite Dynamic Programming.

Problems Solved:
• Floyd Warshall Algo
• MST using Prim's & Kruskal's Algo

@takeUforward_

[dev_ansh @bdevanshh]

Day 51 of #SDESheetChallenge

Today's challenge is some more algorithms to finish the graph topic. Next up is my favourite Dynamic Programming.

Problems Solved:
• Floyd Warshall Algo
• MST using Prim's & Kruskal's Algo

@takeUforward_

[dev_ansh @bdevanshh]

Day 50 of #SDESheetChallenge

Today's challenge is some graph algos. Dijkstra & Bellman Ford are used for shortest path, and Kosaraju's Algorithm is used to find Strongly Connected Components.

Problems Solved:
• SCC (Kosaraju's Algo)
• Dijkstra
• Bellman Ford

@takeUforward_

[dev_ansh @bdevanshh]

Day 50 of #SDESheetChallenge

Today's challenge is some graph algos. Dijkstra & Bellman Ford are used for shortest path, and Kosaraju's Algorithm is used to find Strongly Connected Components.

Problems Solved:
• SCC (Kosaraju's Algo)
• Dijkstra
• Bellman Ford

@takeUforward_

[dev_ansh @bdevanshh]

Day 49 of #SDESheetChallenge

Today's challenge is quite easy one actually. Both of the problem can be solved using simple BFS & DFS. Starting Graph-II from tomorrow.

Problems Solved:
• Number of Islands
• Bipartite Graph

@takeUforward_

[dev_ansh @bdevanshh]

Day 49 of #SDESheetChallenge

Today's challenge is quite easy one actually. Both of the problem can be solved using simple BFS & DFS. Starting Graph-II from tomorrow.

Problems Solved:
• Number of Islands
• Bipartite Graph

@takeUforward_

[dev_ansh @bdevanshh]

Day 48 of #SDESheetChallenge

Today's challenge is topo sort problems. It is used to find linear ordering of a DAG, and also to determine if the DG is cyclic or not.

Problems Solved:
• Cycle Detection in Directed Graphs with BFS
• BFS & DFS Topological Sort

@takeUforward_

[dev_ansh @bdevanshh]

@leouiux Looks sick, I will try it out

[dev_ansh @bdevanshh]

Day 48 of #SDESheetChallenge

Today's challenge is topo sort problems. It is used to find linear ordering of a DAG, and also to determine if the DG is cyclic or not.

Problems Solved:
• Cycle Detection in Directed Graphs with BFS
• BFS & DFS Topological Sort

@takeUforward_

[dev_ansh @bdevanshh]

Day 46 & 47 of #SDESheetChallenge

We are starting with Graphs. Today's challenge is cycle detection in both type of graphs using DFS & BFS.

Problems Solved:
• Clone Graph
• Graph Traversals
• Cycle Detection in Directed & Undirected Graph

@takeUforward_

[dev_ansh @bdevanshh]

Day 46 & 47 of #SDESheetChallenge

We are starting with Graphs. Today's challenge is cycle detection in both type of graphs using DFS & BFS.

Problems Solved:
• Clone Graph
• Graph Traversals
• Cycle Detection in Directed & Undirected Graph

@takeUforward_

[dev_ansh @bdevanshh]

Day 45 of #SDESheetChallenge

The last challenge is some queue & heap problems. With this we complete BT and moving to Graphs (maybe). I think we should complete the rest.

Problems Solved:
• Distinct Numbers in each Subarray
• Kth Largest Element
• Flood Fill

@takeUforward_

[dev_ansh @bdevanshh]

Day 45 of #SDESheetChallenge

The last challenge is some queue & heap problems. With this we complete BT and moving to Graphs (maybe). I think we should complete the rest.

Problems Solved:
• Distinct Numbers in each Subarray
• Kth Largest Element
• Flood Fill

@takeUforward_

[dev_ansh @bdevanshh]

Day 44 of #SDESheetChallenge

Today's challenge is some more BT problems. 1st one is morris traversal and other two are simple heap problems.

Problems Solved:
• BT to DLL
• Median in a Stream
• Kth Largest Element in a Stream

@takeUforward_

[dev_ansh @bdevanshh]

Day 44 of #SDESheetChallenge

Today's challenge is some more BT problems. 1st one is morris traversal and other two are simple heap problems.

Problems Solved:
• BT to DLL
• Median in a Stream
• Kth Largest Element in a Stream

@takeUforward_

[dev_ansh @bdevanshh]

Day 43 of #SDESheetChallenge

Today's challenge was some hard BST & BT problems and we are finished with BST today. Let's keep this going.

Problems Solved:
• Two Sum in BST
• BST Iterator
• Maximum Sum BST in BT
• Serialize and Deserialize BT

@takeUforward_

[dev_ansh @bdevanshh]

Day 43 of #SDESheetChallenge

Today's challenge was some hard BST & BT problems and we are finished with BST today. Let's keep this going.

Problems Solved:
• Two Sum in BST
• BST Iterator
• Maximum Sum BST in BT
• Serialize and Deserialize BT

@takeUforward_

[dev_ansh @bdevanshh]

Day 42 of #SDESheetChallenge

Today's challenge is extremely easy. The first 2 problems are pure binary search and rest is morris traversal. See y'll tomorrow.

Problems Solved:
• Floor/Ceil in BST
• Kth Largest/Smallest element in BST

@takeUforward_

[dev_ansh @bdevanshh]

@dwhitedesign The press & release sounds doesn't work on mobile, otherwise it's awesome.

[dev_ansh @bdevanshh]

@BenjDicken It would be more productive to watch, if you trim those streams. Otherwise, thank you :)