Hongjje DevLeetcode Solution — 1110. Delete Nodes And Return ForestIt’s a problem to delete and get the remaining tree. You can delete it using hash and get the remaining tree. The time complexity is…Jul 17Jul 17
Hongjje DevLeetcode Solution — 2751. Robot CollisionsIt is a problem of saving a robot that collides with the robot moving and survives. It can be solved using a stack. The time complexity is…Jul 13Jul 13
Hongjje DevLeetcode Solution — 2058. Find the Minimum and Maximum Number of Nodes Between Critical PointsIt is a problem of finding the minimum and maximum distances of high or low points. You can solve it by calculating while finding the…Jul 5Jul 5
Hongjje DevLeetcode Solution — 1101. The Earliest Moment When Everyone Become FriendsIt’s a matter of finding the minimum timestamp when every friend knows everything. It can be solved using union-find. The time complexity…Jul 4Jul 4
Hongjje DevLeetcode Solution — 1509. Minimum Difference Between Largest and Smallest Value in Three MovesIt is a problem of obtaining the difference between maximum and minimum values by changing them up to three times to minimize the…Jul 3Jul 3
Hongjje DevLeetcode Solution — 1579. Remove Max Number of Edges to Keep Graph Fully TraversableWhen alice and bob can search for all nodes, it is a problem of obtaining the maximum number of deleted edges. It can be solved using…Jun 30Jun 30
Hongjje DevLeetcode Solution — 2192. All Ancestors of a Node in a Directed Acyclic GraphIt is a matter of finding a place in DAG where each node can visit. I can draw the graph and solve it with bfs. The time complexity is…Jun 29Jun 29
Hongjje DevLeetcode Solution — 2285. Maximum Total Importance of RoadsIt is a problem of obtaining the maximum value when you number a city and add all the city numbers with roads. You can put a high number…Jun 28Jun 28
Hongjje DevLeetcode Solution — 1791. Find Center of Star GraphIt is a problem of finding the center in the star graph. You just need to find out if there is the same node. The time complexity is O(1).Jun 27Jun 27
Hongjje DevLeetcode Solution — 1382. Balance a Binary Search TreeIt is a matter of making it balanced in BST. It can be solved using DFS. The time complexity is O(n).Jun 26Jun 26