May 8, 2019 · May 7, 2019
diff --git a/src/explorer/LeetCodeTreeDataProvider.ts b/src/explorer/LeetCodeTreeDataProvider.ts
            return explorerNodeManager.getRootNodes();
        } else {
            switch (element.id) { // First-level
                case Category.All:
                    return explorerNodeManager.getAllNodes();
                case Category.Favorite:
                    return explorerNodeManager.getFavoriteNodes();
                case Category.Difficulty:
diff --git a/src/explorer/explorerNodeManager.ts b/src/explorer/explorerNodeManager.ts

    public getRootNodes(): LeetCodeNode[] {
        return [
            new LeetCodeNode(Object.assign({}, defaultProblem, {
                id: Category.All,
                name: Category.All,
            }), false),
            new LeetCodeNode(Object.assign({}, defaultProblem, {
                id: Category.Difficulty,
                name: Category.Difficulty,
        ];
    }

    public getAllNodes(): LeetCodeNode[] {
        return Array.from(this.explorerNodeMap.values());
    }

    public getAllDifficultyNodes(): LeetCodeNode[] {
        const res: LeetCodeNode[] = [];
        res.push(
diff --git a/src/shared.ts b/src/shared.ts
 };

 export enum Category {
    All = "All",
    Difficulty = "Difficulty",
    Tag = "Tag",
    Company = "Company",
Original file line number	Diff line number	Diff line change
Expand Up		@@ -60,6 +60,8 @@ export class LeetCodeTreeDataProvider implements vscode.TreeDataProvider<LeetCod
		return explorerNodeManager.getRootNodes();
		} else {
		switch (element.id) { // First-level
		case Category.All:
		return explorerNodeManager.getAllNodes();
		case Category.Favorite:
		return explorerNodeManager.getFavoriteNodes();
		case Category.Difficulty:
Expand Down
Original file line number	Diff line number	Diff line change
Expand Up		@@ -27,6 +27,10 @@ class ExplorerNodeManager implements Disposable {

		public getRootNodes(): LeetCodeNode[] {
		return [
		new LeetCodeNode(Object.assign({}, defaultProblem, {
		id: Category.All,
		name: Category.All,
		}), false),
		new LeetCodeNode(Object.assign({}, defaultProblem, {
		id: Category.Difficulty,
		name: Category.Difficulty,
Expand All		@@ -46,6 +50,10 @@ class ExplorerNodeManager implements Disposable {
		];
		}

		public getAllNodes(): LeetCodeNode[] {
		return Array.from(this.explorerNodeMap.values());
		}

		public getAllDifficultyNodes(): LeetCodeNode[] {
		const res: LeetCodeNode[] = [];
		res.push(
Expand Down
Original file line number	Diff line number	Diff line change
Expand Up		@@ -86,6 +86,7 @@ export const defaultProblem: IProblem = {
		};

		export enum Category {
		All = "All",
		Difficulty = "Difficulty",
		Tag = "Tag",
		Company = "Company",
Expand Down