@@ -144,8 +144,6 @@ a set of rules that precisely define a sequence of operations.
144144* ** Linked Lists**
145145* ` B ` [ Straight Traversal] ( src/algorithms/linked-list/traversal )
146146* ` B ` [ Reverse Traversal] ( src/algorithms/linked-list/reverse-traversal )
147- * ** Stack**
148- * ` B ` [ Valid Parentheses] ( src/algorithms/stack/valid-parentheses ) - check if a string has valid parentheses in the correct order
149147* ** Trees**
150148* ` B ` [ Depth-First Search] ( src/algorithms/tree/depth-first-search ) (DFS)
151149* ` B ` [ Breadth-First Search] ( src/algorithms/tree/breadth-first-search ) (BFS)
@@ -188,6 +186,7 @@ a set of rules that precisely define a sequence of operations.
188186* ` B ` [ Rain Terraces] ( src/algorithms/uncategorized/rain-terraces ) - trapping rain water problem (dynamic programming and brute force versions)
189187* ` B ` [ Recursive Staircase] ( src/algorithms/uncategorized/recursive-staircase ) - count the number of ways to reach to the top (4 solutions)
190188* ` B ` [ Best Time To Buy Sell Stocks] ( src/algorithms/uncategorized/best-time-to-buy-sell-stocks ) - divide and conquer and one-pass examples
189+ * ` B ` [ Valid Parentheses] ( src/algorithms/stack/valid-parentheses ) - check if a string has valid parentheses (using stack)
191190* ` A ` [ N-Queens Problem] ( src/algorithms/uncategorized/n-queens )
192191* ` A ` [ Knight's Tour] ( src/algorithms/uncategorized/knight-tour )
193192