fix

Author: xquisite0

apps/portal/src/pages/resumes/about.tsx

@@ -87,7 +87,7 @@ export default function AboutUsPage() {
                 Submit your feedback
                 <a
                   className="text-primary-600 hover:text-primary-500 ml-1"
-                  href="https://forms.gle/KgA6KWDD4XNa53uJA"
+                  href="https://docs.google.com/forms/d/e/1FAIpQLSf-eCK4ybgewGDCoyStGdpi7e0EativtWU1Iq0HW3evdLEfwQ/viewform?usp=send_form"
                   rel="noreferrer"
                   target="_blank">
                   here

apps/website/contents/algorithms/graph.md

@@ -155,7 +155,7 @@ While DFS is implemented using recursion in this sample, it could also be implem
 
 :::
 
-For additional tips on BFS and DFS, you can refer to this [LeetCode post](https://leetcode.com/problems/pacific-atlantic-water-flow/discuss/90774/Python-solution-with-detailed-explanation/)
+For additional tips on BFS and DFS, you can refer to this [LeetCode post](https://leetcode.com/problems/pacific-atlantic-water-flow/solutions/90774/Python-solution-with-detailed-explanation/)
 
 ### Topological sorting
 

apps/website/contents/algorithms/hash-table.md

@@ -43,7 +43,7 @@ In the case of hash collisions, there are a number of collision resolution techn
 
 | Language | API |
 | --- | --- |
-| C++ | [`std::unordered_map`](https://learn.microsoft.com/en-us/cpp/standard-library/unordered-map) |
+| C++ | [`std::unordered_map`](https://learn.microsoft.com/en-us/cpp/standard-library/unordered-map?view=msvc-170) |
 | Java | [`java.util.Map`](https://docs.oracle.com/javase/10/docs/api/java/util/Map.html). Use [`java.util.HashMap`](https://docs.oracle.com/javase/10/docs/api/java/util/HashMap.html) |
 | Python | [`dict`](https://docs.python.org/3/tutorial/datastructures.html#dictionaries) |
 | JavaScript | [`Object`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Object) or [`Map`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Map) |

apps/website/contents/algorithms/heap.md

@@ -38,7 +38,7 @@ In the context of algorithm interviews, heaps and priority queues can be treated
 
 | Language | API |
 | --- | --- |
-| C++ | [`std::priority_queue`](https://learn.microsoft.com/en-us/cpp/standard-library/priority-queue-class) |
+| C++ | [`std::priority_queue`](https://learn.microsoft.com/en-us/cpp/standard-library/priority-queue-class?view=msvc-170) |
 | Java | [`java.util.PriorityQueue`](https://docs.oracle.com/javase/10/docs/api/java/util/PriorityQueue.html) |
 | Python | [`heapq`](https://docs.python.org/3/library/heapq.html) |
 | JavaScript | N/A |

apps/website/contents/algorithms/oop.md

@@ -16,4 +16,4 @@ toc_max_heading_level: 2
 
 ## Recommended courses
 
-- [Grokking the Object Oriented Design Interview](https://designgurus.org/link/kJSIoU?url=https%3A%2F%2Fdesigngurus.org%2Fcourse%3Fcourseid%3Dgrokking-the-object-oriented-design-interview)
+- [Grokking the Object Oriented Design Interview](https://www.designgurus.io/course/grokking-the-object-oriented-design-interview?aff=kJSIoU)

apps/website/contents/algorithms/queue.md

@@ -38,7 +38,7 @@ Breadth-first search is commonly implemented using queues.
 
 | Language | API |
 | --- | --- |
-| C++ | [`std::queue`](https://learn.microsoft.com/en-us/cpp/standard-library/queue-class) |
+| C++ | [`std::queue`](https://learn.microsoft.com/en-us/cpp/standard-library/queue-class?view=msvc-170) |
 | Java | [`java.util.Queue`](https://docs.oracle.com/javase/10/docs/api/java/util/Queue.html).Use [`java.util.ArrayDeque`](https://docs.oracle.com/javase/10/docs/api/java/util/ArrayDeque.html) |
 | Python | [`queue`](https://docs.python.org/3/library/queue.html) |
 | JavaScript | N/A |

apps/website/contents/algorithms/stack.md

@@ -38,7 +38,7 @@ Stacks are an important way of supporting nested or recursive function calls and
 
 | Language | API |
 | --- | --- |
-| C++ | [`std::stack`](https://learn.microsoft.com/en-us/cpp/standard-library/stack-class) |
+| C++ | [`std::stack`](https://learn.microsoft.com/en-us/cpp/standard-library/stack-class?view=msvc-170) |
 | Java | [`java.util.Stack`](https://docs.oracle.com/javase/10/docs/api/java/util/Stack.html) |
 | Python | Simulated using [List](https://docs.python.org/3/tutorial/datastructures.html) |
 | JavaScript | Simulated using [Array](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array) |

apps/website/contents/algorithms/trie.md

@@ -29,7 +29,7 @@ Be familiar with implementing from scratch, a `Trie` class and its `add`, `remov
 
 - Readings
   - [Trying to Understand Tries](https://medium.com/basecs/trying-to-understand-tries-3ec6bede0014), basecs
-  - [Implement Trie (Prefix Tree)](https://leetcode.com/problems/implement-trie-prefix-tree/solution/), LeetCode
+  - [Implement Trie (Prefix Tree)](https://leetcode.com/problems/implement-trie-prefix-tree/editorial/), LeetCode
 - Additional (only if you have time)
   - [Compressing Radix Trees Without (Too Many) Tears](https://medium.com/basecs/compressing-radix-trees-without-too-many-tears-a2e658adb9a0), basecs
 

apps/website/contents/best-practice-questions.md

@@ -27,7 +27,7 @@ Hey there, the author of Blind 75 here 👋!
 
 Practicing is the best way to prepare for coding interviews. LeetCode has over a thousand questions. Which should you practice? Hence years ago, I curated a list of the most important 75 questions on [LeetCode](https://leetcode.com). Many other LeetCode questions are a mash of the techniques from these individual questions. I used this list in my last job hunt to only do the important questions.
 
-I [shared this list on Blind](https://www.teamblind.com/post/New-Year-Gift---Curated-List-of-Top-100-LeetCode-Questions-to-Save-Your-Time-OaM1orEU) by extracting the questions from [my freeCodeCamp article](https://www.freecodecamp.org/news/coding-interviews-for-dummies-5e048933b82b/) to save peoples' time when revising and someone reposted this list on [the LeetCode forum](https://leetcode.com/discuss/general-discussion/460599/blind-75-leetcode-questions/). It somehow blew up and became super famous in the coding interview scene, people even gave it a name - **Blind 75**. The Blind 75 questions as a LeetCode list can be found [here](https://leetcode.com/list/xi4ci4ig/).
+I [shared this list on Blind](https://www.teamblind.com/post/New-Year-Gift---Curated-List-of-Top-100-LeetCode-Questions-to-Save-Your-Time-OaM1orEU) by extracting the questions from [my freeCodeCamp article](https://www.freecodecamp.org/news/coding-interviews-for-dummies-5e048933b82b/) to save peoples' time when revising and someone reposted this list on [the LeetCode forum](https://leetcode.com/discuss/post/460599/blind-75-leetcode-questions-by-krishnade-9xev/). It somehow blew up and became super famous in the coding interview scene, people even gave it a name - **Blind 75**. The Blind 75 questions as a LeetCode list can be found [here](https://leetcode.com/list/xi4ci4ig/).
 
 Years later, I further distilled the list down into only 50 questions and spread them across a 5-week schedule. Here is the suggested schedule for revising and practicing algorithm questions on LeetCode. Sign up for an account if you don't already have one, it's critical to your success in interviewing!