Feat: hide blocks not challenges (#39504)
* fix: remove isHidden flag from frontmatter * fix: add isUpcomingChange Co-authored-by: Ahmad Abdolsaheb <ahmad.abdolsaheb@gmail.com> * feat: hide blocks not challenges Co-authored-by: Ahmad Abdolsaheb <ahmad.abdolsaheb@gmail.com> Co-authored-by: Ahmad Abdolsaheb <ahmad.abdolsaheb@gmail.com>
This commit is contained in:
committed by
GitHub
parent
6b081c7e7b
commit
bd68b70f3d
@ -2,7 +2,6 @@
|
||||
id: 587d8257367417b2b2512c7b
|
||||
title: Add a New Element to a Binary Search Tree
|
||||
challengeType: 1
|
||||
isHidden: false
|
||||
forumTopicId: 301618
|
||||
---
|
||||
|
||||
|
@ -2,7 +2,6 @@
|
||||
id: 587d8252367417b2b2512c67
|
||||
title: Add Elements at a Specific Index in a Linked List
|
||||
challengeType: 1
|
||||
isHidden: false
|
||||
forumTopicId: 301619
|
||||
---
|
||||
|
||||
|
@ -2,7 +2,6 @@
|
||||
id: 587d8256367417b2b2512c77
|
||||
title: Adjacency List
|
||||
challengeType: 1
|
||||
isHidden: false
|
||||
forumTopicId: 301620
|
||||
---
|
||||
|
||||
|
@ -2,7 +2,6 @@
|
||||
id: 587d8256367417b2b2512c78
|
||||
title: Adjacency Matrix
|
||||
challengeType: 1
|
||||
isHidden: false
|
||||
forumTopicId: 301621
|
||||
---
|
||||
|
||||
|
@ -2,7 +2,6 @@
|
||||
id: 587d825c367417b2b2512c90
|
||||
title: Breadth-First Search
|
||||
challengeType: 1
|
||||
isHidden: false
|
||||
forumTopicId: 301622
|
||||
---
|
||||
|
||||
|
@ -2,7 +2,6 @@
|
||||
id: 587d8257367417b2b2512c7c
|
||||
title: Check if an Element is Present in a Binary Search Tree
|
||||
challengeType: 1
|
||||
isHidden: false
|
||||
forumTopicId: 301623
|
||||
---
|
||||
|
||||
|
@ -2,7 +2,6 @@
|
||||
id: 5cc0c1b32479e176caf3b422
|
||||
title: Check if Tree is Binary Search Tree
|
||||
challengeType: 1
|
||||
isHidden: false
|
||||
forumTopicId: 301624
|
||||
---
|
||||
|
||||
|
@ -2,7 +2,6 @@
|
||||
id: 587d8255367417b2b2512c75
|
||||
title: Create a Circular Queue
|
||||
challengeType: 1
|
||||
isHidden: false
|
||||
forumTopicId: 301625
|
||||
---
|
||||
|
||||
|
@ -2,7 +2,6 @@
|
||||
id: 587d825a367417b2b2512c87
|
||||
title: Create a Doubly Linked List
|
||||
challengeType: 1
|
||||
isHidden: false
|
||||
forumTopicId: 301626
|
||||
---
|
||||
|
||||
|
@ -2,7 +2,6 @@
|
||||
id: 587d825b367417b2b2512c8e
|
||||
title: Create a Hash Table
|
||||
challengeType: 1
|
||||
isHidden: false
|
||||
forumTopicId: 301627
|
||||
---
|
||||
|
||||
|
@ -2,7 +2,6 @@
|
||||
id: 587d8251367417b2b2512c62
|
||||
title: Create a Linked List Class
|
||||
challengeType: 1
|
||||
isHidden: false
|
||||
forumTopicId: 301628
|
||||
---
|
||||
|
||||
|
@ -2,7 +2,6 @@
|
||||
id: 8d5823c8c441eddfaeb5bdef
|
||||
title: Create a Map Data Structure
|
||||
challengeType: 1
|
||||
isHidden: false
|
||||
forumTopicId: 301629
|
||||
---
|
||||
|
||||
|
@ -2,7 +2,6 @@
|
||||
id: 587d8255367417b2b2512c74
|
||||
title: Create a Priority Queue Class
|
||||
challengeType: 1
|
||||
isHidden: false
|
||||
forumTopicId: 301630
|
||||
---
|
||||
|
||||
|
@ -2,7 +2,6 @@
|
||||
id: 587d8250367417b2b2512c60
|
||||
title: Create a Queue Class
|
||||
challengeType: 1
|
||||
isHidden: false
|
||||
forumTopicId: 301631
|
||||
---
|
||||
|
||||
|
@ -2,7 +2,6 @@
|
||||
id: 8d1323c8c441eddfaeb5bdef
|
||||
title: Create a Set Class
|
||||
challengeType: 1
|
||||
isHidden: false
|
||||
forumTopicId: 301632
|
||||
---
|
||||
|
||||
|
@ -2,7 +2,6 @@
|
||||
id: 587d8250367417b2b2512c5f
|
||||
title: Create a Stack Class
|
||||
challengeType: 1
|
||||
isHidden: false
|
||||
forumTopicId: 301633
|
||||
---
|
||||
|
||||
|
@ -2,7 +2,6 @@
|
||||
id: 587d8259367417b2b2512c84
|
||||
title: Create a Trie Search Tree
|
||||
challengeType: 1
|
||||
isHidden: false
|
||||
forumTopicId: 301634
|
||||
---
|
||||
|
||||
|
@ -2,7 +2,6 @@
|
||||
id: 587d825b367417b2b2512c8d
|
||||
title: Create an ES6 JavaScript Map
|
||||
challengeType: 1
|
||||
isHidden: false
|
||||
forumTopicId: 301635
|
||||
---
|
||||
|
||||
|
@ -2,7 +2,6 @@
|
||||
id: 587d8254367417b2b2512c70
|
||||
title: Create and Add to Sets in ES6
|
||||
challengeType: 1
|
||||
isHidden: false
|
||||
forumTopicId: 301636
|
||||
---
|
||||
|
||||
|
@ -2,7 +2,6 @@
|
||||
id: 587d8258367417b2b2512c80
|
||||
title: Delete a Leaf Node in a Binary Search Tree
|
||||
challengeType: 1
|
||||
isHidden: false
|
||||
forumTopicId: 301637
|
||||
---
|
||||
|
||||
|
@ -2,7 +2,6 @@
|
||||
id: 587d8258367417b2b2512c81
|
||||
title: Delete a Node with One Child in a Binary Search Tree
|
||||
challengeType: 1
|
||||
isHidden: false
|
||||
forumTopicId: 301638
|
||||
---
|
||||
|
||||
|
@ -2,7 +2,6 @@
|
||||
id: 587d8258367417b2b2512c82
|
||||
title: Delete a Node with Two Children in a Binary Search Tree
|
||||
challengeType: 1
|
||||
isHidden: false
|
||||
forumTopicId: 301639
|
||||
---
|
||||
|
||||
|
@ -2,7 +2,6 @@
|
||||
id: 587d825d367417b2b2512c96
|
||||
title: Depth-First Search
|
||||
challengeType: 1
|
||||
isHidden: false
|
||||
forumTopicId: 301640
|
||||
---
|
||||
|
||||
|
@ -2,7 +2,6 @@
|
||||
id: 587d8257367417b2b2512c7d
|
||||
title: Find the Minimum and Maximum Height of a Binary Search Tree
|
||||
challengeType: 1
|
||||
isHidden: false
|
||||
forumTopicId: 301641
|
||||
---
|
||||
|
||||
|
@ -2,7 +2,6 @@
|
||||
id: 587d8256367417b2b2512c7a
|
||||
title: Find the Minimum and Maximum Value in a Binary Search Tree
|
||||
challengeType: 1
|
||||
isHidden: false
|
||||
forumTopicId: 301642
|
||||
---
|
||||
|
||||
|
@ -2,7 +2,6 @@
|
||||
id: 587d825b367417b2b2512c8c
|
||||
title: Implement Heap Sort with a Min Heap
|
||||
challengeType: 1
|
||||
isHidden: false
|
||||
forumTopicId: 301643
|
||||
---
|
||||
|
||||
|
@ -2,7 +2,6 @@
|
||||
id: 587d8256367417b2b2512c79
|
||||
title: Incidence Matrix
|
||||
challengeType: 1
|
||||
isHidden: false
|
||||
forumTopicId: 301644
|
||||
---
|
||||
|
||||
|
@ -2,7 +2,6 @@
|
||||
id: 587d825a367417b2b2512c8a
|
||||
title: Insert an Element into a Max Heap
|
||||
challengeType: 1
|
||||
isHidden: false
|
||||
forumTopicId: 301703
|
||||
---
|
||||
|
||||
|
@ -2,7 +2,6 @@
|
||||
id: 587d8259367417b2b2512c83
|
||||
title: Invert a Binary Tree
|
||||
challengeType: 1
|
||||
isHidden: false
|
||||
forumTopicId: 301704
|
||||
---
|
||||
|
||||
|
@ -2,7 +2,6 @@
|
||||
id: 587d8250367417b2b2512c5e
|
||||
title: Learn how a Stack Works
|
||||
challengeType: 1
|
||||
isHidden: false
|
||||
forumTopicId: 301705
|
||||
---
|
||||
|
||||
|
@ -2,7 +2,6 @@
|
||||
id: 587d8254367417b2b2512c6e
|
||||
title: Perform a Difference on Two Sets of Data
|
||||
challengeType: 1
|
||||
isHidden: false
|
||||
forumTopicId: 301706
|
||||
---
|
||||
|
||||
|
@ -2,7 +2,6 @@
|
||||
id: 587d8254367417b2b2512c6f
|
||||
title: Perform a Subset Check on Two Sets of Data
|
||||
challengeType: 1
|
||||
isHidden: false
|
||||
forumTopicId: 301707
|
||||
---
|
||||
|
||||
|
@ -2,7 +2,6 @@
|
||||
id: 587d8253367417b2b2512c6c
|
||||
title: Perform a Union on Two Sets
|
||||
challengeType: 1
|
||||
isHidden: false
|
||||
forumTopicId: 301708
|
||||
---
|
||||
|
||||
|
@ -2,7 +2,6 @@
|
||||
id: 587d8253367417b2b2512c6d
|
||||
title: Perform an Intersection on Two Sets of Data
|
||||
challengeType: 1
|
||||
isHidden: false
|
||||
forumTopicId: 301709
|
||||
---
|
||||
|
||||
|
@ -2,7 +2,6 @@
|
||||
id: 587d825b367417b2b2512c8b
|
||||
title: Remove an Element from a Max Heap
|
||||
challengeType: 1
|
||||
isHidden: false
|
||||
forumTopicId: 301710
|
||||
---
|
||||
|
||||
|
@ -2,7 +2,6 @@
|
||||
id: 587d8251367417b2b2512c65
|
||||
title: Remove Elements from a Linked List by Index
|
||||
challengeType: 1
|
||||
isHidden: false
|
||||
forumTopicId: 301711
|
||||
---
|
||||
|
||||
|
@ -2,7 +2,6 @@
|
||||
id: 587d8251367417b2b2512c63
|
||||
title: Remove Elements from a Linked List
|
||||
challengeType: 1
|
||||
isHidden: false
|
||||
forumTopicId: 301712
|
||||
---
|
||||
|
||||
|
@ -2,7 +2,6 @@
|
||||
id: 587d8254367417b2b2512c71
|
||||
title: Remove items from a set in ES6
|
||||
challengeType: 1
|
||||
isHidden: false
|
||||
forumTopicId: 301713
|
||||
---
|
||||
|
||||
|
@ -2,7 +2,6 @@
|
||||
id: 587d825a367417b2b2512c88
|
||||
title: Reverse a Doubly Linked List
|
||||
challengeType: 1
|
||||
isHidden: false
|
||||
forumTopicId: 301714
|
||||
---
|
||||
|
||||
|
@ -2,7 +2,6 @@
|
||||
id: 587d8251367417b2b2512c64
|
||||
title: Search within a Linked List
|
||||
challengeType: 1
|
||||
isHidden: false
|
||||
forumTopicId: 301715
|
||||
---
|
||||
|
||||
|
@ -2,7 +2,6 @@
|
||||
id: 587d8253367417b2b2512c6a
|
||||
title: Typed Arrays
|
||||
challengeType: 1
|
||||
isHidden: false
|
||||
forumTopicId: 301716
|
||||
---
|
||||
|
||||
|
@ -2,7 +2,6 @@
|
||||
id: 587d8255367417b2b2512c72
|
||||
title: Use .has and .size on an ES6 Set
|
||||
challengeType: 1
|
||||
isHidden: false
|
||||
forumTopicId: 301717
|
||||
---
|
||||
|
||||
|
@ -2,7 +2,6 @@
|
||||
id: 587d8258367417b2b2512c7f
|
||||
title: Use Breadth First Search in a Binary Search Tree
|
||||
challengeType: 1
|
||||
isHidden: false
|
||||
forumTopicId: 301718
|
||||
---
|
||||
|
||||
|
@ -2,7 +2,6 @@
|
||||
id: 587d8257367417b2b2512c7e
|
||||
title: Use Depth First Search in a Binary Search Tree
|
||||
challengeType: 1
|
||||
isHidden: false
|
||||
forumTopicId: 301719
|
||||
---
|
||||
|
||||
|
@ -2,7 +2,6 @@
|
||||
id: 587d8255367417b2b2512c73
|
||||
title: Use Spread and Notes for ES5 Set() Integration
|
||||
challengeType: 1
|
||||
isHidden: false
|
||||
forumTopicId: 301720
|
||||
---
|
||||
|
||||
|
@ -2,7 +2,6 @@
|
||||
id: 587d8251367417b2b2512c61
|
||||
title: Work with Nodes in a Linked List
|
||||
challengeType: 1
|
||||
isHidden: false
|
||||
forumTopicId: 301721
|
||||
---
|
||||
|
||||
|
Reference in New Issue
Block a user