unordered -> silver

10 files changed, 39 insertions, 21 deletions

diff --git a/content/1_Intro/Expected.mdx b/content/1_Intro/Expected.mdx
index 25ae612..8f9e00a 100644
--- a/content/1_Intro/Expected.mdx
+++ b/content/1_Intro/Expected.mdx
@@ -12,8 +12,9 @@ import { Problem } from "../models";
 export const problems = {
     general: [
       new Problem("Bronze", "Promotion Counting", "591", "Very Easy"),
-      new Problem("Bronze", "Word Processor", "987", "Very Easy"),
+      new Problem("Bronze", "Teleportation", "807", "Very Easy"),
       new Problem("Bronze", "Square Pasture", "663", "Very Easy"),
+      new Problem("Bronze", "Word Processor", "987", "Very Easy"),
       new Problem("Bronze", "Bucket Brigade", "939", "Very Easy"),
     ]
 };
diff --git a/content/2_Bronze/Ad_Hoc.mdx b/content/2_Bronze/Ad_Hoc.mdx
index 3582bb3..611a714 100644
--- a/content/2_Bronze/Ad_Hoc.mdx
+++ b/content/2_Bronze/Ad_Hoc.mdx
@@ -5,6 +5,15 @@ author: Michael Cao
 description: "Problems that don't fall under any well-defined category."
 frequency: 1
 ---
+import { Problem } from "../models";
+
+export const problems = {
+  general: [
+    new Problem("Bronze", "Sleepy Cow Sorting", "892", "Hard", false, [], ""),
+    new Problem("Bronze", "Hoofball", "808", "Hard", false, [], ""),
+    new Problem("Bronze", "Taming the Herd", "809", "Hard", false, [], ""),
+  ],
+};
 
 Most bronze problems fall into specific categories, such as simulation and complete search. Those which don't often require more thought, although they are not necessarily more difficult to implement. 
 
@@ -28,4 +37,6 @@ These tips are helpful in solving Ad Hoc problems. However, in the end, the best
 
 ## Problems
 
-<IncompleteSection />
\ No newline at end of file
+Dhruv Rohatgi problems!!
+
+<Problems problems={problems.general} />
\ No newline at end of file
diff --git a/content/2_Bronze/Intro_DS.mdx b/content/2_Bronze/Intro_DS.mdx
index 1e7283c..d1b6ecd 100644
--- a/content/2_Bronze/Intro_DS.mdx
+++ b/content/2_Bronze/Intro_DS.mdx
@@ -13,9 +13,8 @@ export const problems = {
       new Problem("HR", "Bubble Sort", "https://www.hackerrank.com/challenges/ctci-bubble-sort/problem", "Very Easy", false, [], ""),
       ],
     easy: [
-      new Problem("CF", "Kayaking", "contest/863/problem/B", "Easy", false, [], ""),
       new Problem("CSES", "Distinct Numbers", "1621", "Easy"),
-      new Problem("CSES", "Stick Lengths", "1074", "Normal", false, [], "Spoiler: Optimal length is median"),
+      new Problem("CF", "Kayaking", "contest/863/problem/B", "Easy", false, [], ""),
     ],
 };
 
@@ -291,7 +290,7 @@ for(auto element : v) {
 
 <!-- No bronze problem should require you to sort an array in $O(N\log N)$ time for Bronze,  -->
 
-You should know how to use built-in methods to sort a (possibly dynamic) array.
+Although you do **not** need to know how sorting is implemented for Bronze, you should know how to use built-in methods to sort a (possibly dynamic) array.
 
 <LanguageSection>
 
diff --git a/content/2_Bronze/Intro_Greedy.mdx b/content/2_Bronze/Intro_Greedy.mdx
index bbcc925..28332e6 100644
--- a/content/2_Bronze/Intro_Greedy.mdx
+++ b/content/2_Bronze/Intro_Greedy.mdx
@@ -13,10 +13,11 @@ import { Problem } from "../models";
 
 export const problems = {
     tutorial: [
-      new Problem("Bronze", "Mad Scientist", "1012", "Normal", false, [], ""),
+      new Problem("Bronze", "Mad Scientist", "1012", "Easy", false, [], ""),
     ],
     general: [
-      new Problem("Bronze", "Cow Tipping", "689", "Hard", false, [], "Cells in the last row and column can be toggled uniquely. Toggle the appropriate ones and then recurse to the rectangle in the previous row/column, and solve the same way."),
+      new Problem("Bronze", "Cow Tipping", "689", "Normal", false, [], "Cells in the last row and column can be toggled uniquely. Toggle the appropriate ones and then recurse to the rectangle in the previous row/column, and solve the same way."),
+      new Problem("Bronze", "Out of Place", "785", "Hard", false, [], ""),
       new Problem("Bronze", "Race", "989", "Very Hard", false, [], "Greedily increment/decrement Bessies speed to fit the conditions until her total distance exceeds K."),
     ],
 };
diff --git a/content/3_Silver/Greedy.mdx b/content/3_Silver/Greedy.mdx
index 4d1d13a..9fd956d 100644
--- a/content/3_Silver/Greedy.mdx
+++ b/content/3_Silver/Greedy.mdx
@@ -17,6 +17,7 @@ export const problems = {
       new Problem("CSES", "Movie Festival", "1629", "Easy", false, [], ""),
     ],
     cses: [
+      new Problem("CSES", "Stick Lengths", "1074", "Easy", false, [], "Spoiler: Optimal length is median"),
       new Problem("CSES", "Apartments", "1084", "Easy", false, [], "Sort applicants and apartments, then greedily assign applicants"),
       new Problem("CSES", "Ferris Wheel", "1090", "Easy", false, [], "Sort children, keep a left pointer and a right pointer. Each gondola either is one child from the right pointer or two children, one left and one right."),
       new Problem("CSES", "Towers", "1073", "Easy", false, ["multiset", "greedy"]),
@@ -42,6 +43,7 @@ export const problems = {
 <!-- new Problem("CF", "Permutation", "contest/864/problem/D", "?", false, [], ""), -->
 <!--   new Problem("CF", "New Year and Three Musketeers", "contest/611/problem/E", "Hard", false, [], "needs maps"), -->
 
+
 <Resources>
   <Resource source="IUSACO" title="9 - Greedy Algorithms">Module is based off this.</Resource>
   <Resource source="CPH" title="6 - Greedy Algorithms" starred></Resource>
diff --git a/content/2_Bronze/Unordered.mdx b/content/3_Silver/Unordered.mdx
index 073fd5b..073fd5b 100644
--- a/content/2_Bronze/Unordered.mdx
+++ b/content/3_Silver/Unordered.mdx
diff --git a/content/authors/authors.ts b/content/authors/authors.ts
index 6b12580..12fa101 100644
--- a/content/authors/authors.ts
+++ b/content/authors/authors.ts
@@ -42,7 +42,7 @@ export const Authors: Author[] = [
     photo: 'michael',
     name: 'Michael Cao',
     title: 'Content Author',
-    blurb: 'How do you even write anything that\'s not extremely underwhelming following Benq? Author of classics such as Snowcow and Flooded Farm!!!',
+    blurb: 'Michael Cao is a USACO Platinum competitor and author of "Bessie\'s Snow Cow."',
     facebook: "mike.lao.9400",
     codeforces: "caoash",
     email: "cao.michael14@gmail.com",
@@ -52,27 +52,27 @@ export const Authors: Author[] = [
     photo: 'darren',
     name: 'Darren Yao',
     title: 'Content Author',
-    blurb: 'Darren Yao is a USACO Platinum competitor and author of the textbook An Introduction to the USA Computing Olympiad.',
+    blurb: 'Darren Yao is a USACO Platinum competitor and author of the textbook "An Introduction to the USA Computing Olympiad."',
     website: 'http://darrenyao.com/',
     email: 'darren.yao@gmail.com',
     codeforces: "darren_yao",
     github: "darren-yao",
   },
   {
-    photo: 'cow',
-    name: 'Siyong Huang',
-    title: 'Content Author',
-    blurb: '',
-    codeforces: "frodakcin",
-    github: "frodakcin",
-  },
-  {
     photo: 'nathanc',
     name: 'Nathan Chen',
     title: 'Content Author',
-    blurb: 'Nathan Chen is a two-time USACO Finalist who competes in both Java and C++ fluently',
+    blurb: 'Nathan Chen is a two-time USACO Finalist who competes in both Java and C++ fluently.',
     codeforces: "nchn27",
     github: "nchn27",
     email: "nchn27@gmail.com",
   },
+  {
+    photo: 'cow',
+    name: 'Siyong Huang',
+    title: 'Content Author',
+    blurb: '',
+    codeforces: "frodakcin",
+    github: "frodakcin",
+  },
 ];
diff --git a/content/ordering.ts b/content/ordering.ts
index d538304..275bac8 100644
--- a/content/ordering.ts
+++ b/content/ordering.ts
@@ -71,7 +71,6 @@ const MODULE_ORDERING: {[key in SectionID]: Chapter[]} = {
       items: [
         "intro-ds",
         "pairs-tuples",
-        "unordered",
       ]
     },
     {
@@ -118,8 +117,9 @@ const MODULE_ORDERING: {[key in SectionID]: Chapter[]} = {
       ]
     },
     {
-      name: "Ordered Sets & Maps",
+      name: "Sets & Maps",
       items: [
+        "unordered",
         "intro-ordered",
         "custom-cpp-stl",
       ]
diff --git a/src/components/ModuleLayout/ModuleLayout.tsx b/src/components/ModuleLayout/ModuleLayout.tsx
index 4127fa4..c3f7447 100644
--- a/src/components/ModuleLayout/ModuleLayout.tsx
+++ b/src/components/ModuleLayout/ModuleLayout.tsx
@@ -468,7 +468,10 @@ export default function ModuleLayout({
                     <h1 className="text-2xl font-bold text-gray-900 sm:text-3xl">
                       {module.title}
                     </h1>
-                    <p className={`text-gray-500`}>Author: {module.author}</p>
+                    <p className={`text-gray-500`}>
+                      Author{module.author.indexOf(',') != -1 ? 's' : ''}:{' '}
+                      {module.author}
+                    </p>
                   </div>
                   <div className="hidden lg:flex-shrink-0 lg:flex ml-4">
                     <MarkCompleteButton
diff --git a/src/components/markdown/ResourcesList.tsx b/src/components/markdown/ResourcesList.tsx
index d82a298..48bb754 100644
--- a/src/components/markdown/ResourcesList.tsx
+++ b/src/components/markdown/ResourcesList.tsx
@@ -82,6 +82,7 @@ export const sourceTooltip = {
   'Old Bronze': 'USACO Platinum did not exist prior to 2015-16.',
   'Old Silver': 'USACO Platinum did not exist prior to 2015-16.',
   'Old Gold': 'USACO Platinum did not exist prior to 2015-16.',
+  ZLE: 'kauntaofficial.github.io',
 };
 
 export function Resource(props) {