Nothing here yet.
Nothing here yet.
Aug 23, 2021 · 2 min read · Problem: Given a string of capitalized alphabets of size N, and a subarray size M, find the largest subarray of size M in lexicographical order. Example: Input: s = "ABKBD", and M = 3 Output: KBD Analysis: For the first alphabet in the answer, at lea...
Join discussionAug 16, 2021 · 2 min read · Problem: Given a line of int/long/char variable declarations like: int a[20][10],b,c,d[10]; char a; long a[20]; Calculate the space of the memory needed to allocate for this line. E.g., for int a[20][10],b; the space needed is 804 (each int takes 4 B...
Join discussion
May 5, 2021 · 3 min read · whether to use spfa: the problem has to meet the following requirements: single-source shortest problem no negative weighted rings allowed. basic idea: see Bellman-Ford algorithm for a previous algorithm. What if we only update the distances that c...
Join discussionMay 2, 2021 · 2 min read · When to use Bellman-Ford algorithm? If a negative weighted rings are allowed in a graph, then Dijkstra's algorithm is not applicable to solve SSSP problem, consider to use Bellman-Ford! Basic idea: Simply loop |V| times, for each time, traverse throu...
Join discussionMay 1, 2021 · 3 min read · optimized-with-heap version: algorithm description: Suppose set S is a set of all vertices whose shortest path (SP) have already been determined. initialize 0th vertex's distance to 0, others' to positive infinite(same as naïve version); insert 0t...
Join discussion