added leetcode code problems url

Author: ashishexee

CHANGELOG.md

@@ -53,8 +53,11 @@ and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0
 
 ### Added
 - added a new command show leetcode problems where links of every question on leetcode is availabe you can run this command and a text file will get opened and you can use (ctrl+f) to search for the specific leetcode question
+- added test_runner.py just 
+
 
 ### Changed 
 - updated extension.ts to ensure proper execution of showleetcodeproblem command
 - updated commandTreeDataProvider.ts to add a new command to the panel
-- updated package.json file too
+- updated package.json file too
+- updated the logic for fetchTestCases.ts (basically adding logic for second selector to account for every question on leetcode)

README.md

@@ -1,6 +1,6 @@
 # LeetCode Helper Extension
 
-![LeetCode Helper](resources/leetcode_helper_banner.png)
+![LeetCode Helper]
 
 ## Overview
 
@@ -13,7 +13,7 @@ LeetCode Helper is a Visual Studio Code extension designed to streamline the pro
 - **Solution File Management**: Automatically generate and manage solution files.
 - **Error Handling**: Detailed error messages to help you debug your code.
 
-![Features](resources/features.png)
+![Features]
 
 ## Installation
 
@@ -29,7 +29,7 @@ LeetCode Helper is a Visual Studio Code extension designed to streamline the pro
 3. Write your solution in the generated file.
 4. Run your test cases using `LeetCode Helper: Run Test Cases`.
 
-![Usage](resources/usage.png)
+![Usage]
 
 ## Extension Settings
 
@@ -45,18 +45,10 @@ This extension contributes the following settings:
 
 ## Release Notes
 
-### 1.0.1
-
-- Fixed issue with capturing actual output in failed test cases.
-- Improved error handling and logging.
-
 ### 1.0.0
 
 - Initial release of LeetCode Helper.
 
-## Contributing
-
-Contributions are welcome! Please read the [contributing guidelines](CONTRIBUTING.md) first.
 
 ## License
 
@@ -69,4 +61,4 @@ This project is licensed under the MIT License - see the [LICENSE](LICENSE) file
 - **Logging**: Enhanced logging for better debugging.
 - **Solution File Management**: Automatically generate and manage solution files.
 
-![Footer](resources/footer.png)
+![Footer]

a.exe

@@ -297218,7 +297218,7 @@ var {
 var fs6 = __toESM(require("fs"));
 var path10 = __toESM(require("path"));
 var vscode = __toESM(require("vscode"));
-var RETRY_DELAY2 = 100;
+var RETRY_DELAY2 = 3e3;
 var MAX_RETRIES = 5;
 async function fetchTestCases(url) {
   const browser = await launch3({ headless: false });
@@ -297284,22 +297284,45 @@ async function fetchTestCasesWithRetry(page, url) {
     await loginToLeetCode(page);
   }
   console.log("Waiting for test cases to load...");
+  let testCases = [];
   try {
     await page.waitForSelector("pre", { timeout: 2e4 });
+    testCases = await page.$$eval("pre", (elements) => {
+      return elements.map((pre) => {
+        const inputMatch = pre.innerText.match(/Input:\s*(.+)/);
+        const outputMatch = pre.innerText.match(/Output:\s*(.+)/);
+        return {
+          input: inputMatch ? inputMatch[1].trim() : null,
+          output: outputMatch ? outputMatch[1].trim() : null
+        };
+      });
+    });
   } catch (error) {
-    console.error("Failed to find <pre> tags in time:", error);
-    return [];
+    console.error("Failed to extract test cases using <pre> selector:", error);
+  }
+  if (testCases.length === 0) {
+    try {
+      console.log("Trying to extract test cases using .example-block structure...");
+      await page.waitForSelector(".example-block", { timeout: 5e3 });
+      testCases = await page.$$eval(".example-block", (blocks) => {
+        return blocks.map((block) => {
+          const inputElement = block.querySelector('strong:contains("Input:") + span.example-io');
+          const outputElement = block.querySelector('strong:contains("Output:") + span.example-io');
+          return {
+            input: inputElement ? inputElement.innerText.trim() : null,
+            output: outputElement ? outputElement.innerText.trim() : null
+          };
+        });
+      });
+      if (testCases.length > 0) {
+        console.log("Test cases successfully extracted using .example-block structure.");
+      } else {
+        console.log("No test cases found using .example-block structure.");
+      }
+    } catch (error) {
+      console.error("Failed to extract test cases using .example-block structure:", error);
+    }
   }
-  const testCases = await page.$$eval("pre", (elements) => {
-    return elements.map((pre) => {
-      const inputMatch = pre.innerText.match(/Input:\s*(.+)/);
-      const outputMatch = pre.innerText.match(/Output:\s*(.+)/);
-      return {
-        input: inputMatch ? inputMatch[1].trim() : null,
-        output: outputMatch ? outputMatch[1].trim() : null
-      };
-    });
-  });
   return testCases;
 }
 async function loginToLeetCode(page) {
@@ -297542,14 +297565,14 @@ var CommandTreeDataProvider = class {
   constructor() {
     this._onDidChangeTreeData = new vscode2.EventEmitter();
     this.onDidChangeTreeData = this._onDidChangeTreeData.event;
-    // Mapping of command IDs to their display names
+    // Mapping of command IDs to their display names, icons, and colors
     this.extensionCommands = {
-      "leetcode-cph-helper-by-ashish.fetchLeetCodeTestCases": "\u{1F449}\u{1F3FB} Fetch Test Cases",
-      "leetcode-cph-helper-by-ashish.runTestCases": "\u{1F449}\u{1F3FB} Run Test Cases",
-      "leetcode-cph-helper-by-ashish.writeSolutionFile": "\u{1F449}\u{1F3FB} Write Solution File",
-      "leetcode-test-case-manager.getSolutionFileDirectory": "\u{1F449}\u{1F3FB} Get Solution File Directory",
-      "leetcode-cph-helper-by-ashish.getIOFileDirectory": "\u{1F449}\u{1F3FB} Get I/O File Directory",
-      "leetcode-cph-helper-by-ashish.showLeetCodeProblemLinks": "\u{1F449}\u{1F3FB}Show LeetCode Problem Links "
+      "leetcode-cph-helper-by-ashish.fetchLeetCodeTestCases": { label: "Fetch Test Cases", icon: "cloud-download", color: "charts.green" },
+      "leetcode-cph-helper-by-ashish.runTestCases": { label: "Run Test Cases", icon: "play-circle", color: "charts.blue" },
+      "leetcode-cph-helper-by-ashish.writeSolutionFile": { label: "Write Solution File", icon: "file-code", color: "charts.yellow" },
+      "leetcode-test-case-manager.getSolutionFileDirectory": { label: "Get Solution File Directory", icon: "folder", color: "charts.orange" },
+      "leetcode-cph-helper-by-ashish.getIOFileDirectory": { label: "Get I/O File Directory", icon: "folder", color: "charts.red" },
+      "leetcode-cph-helper-by-ashish.showLeetCodeProblemLinks": { label: "Show LeetCode Problem Links", icon: "link", color: "charts.purple" }
     };
   }
   // Returns a TreeItem representation of the given element
@@ -297563,7 +297586,11 @@ var CommandTreeDataProvider = class {
     } else {
       const commands3 = vscode2.commands.getCommands(true);
       return commands3.then(
-        (cmds) => cmds.filter((cmd) => Object.keys(this.extensionCommands).includes(cmd)).map((cmd) => new CommandTreeItem(cmd, this.extensionCommands[cmd]))
+        (cmds) => cmds.filter((cmd) => Object.keys(this.extensionCommands).includes(cmd)).map((cmd) => {
+          const commandInfo = this.extensionCommands[cmd];
+          const treeItem = new CommandTreeItem(cmd, commandInfo.label, commandInfo.icon, commandInfo.color);
+          return treeItem;
+        })
       );
     }
   }
@@ -297573,14 +297600,19 @@ var CommandTreeDataProvider = class {
   }
 };
 var CommandTreeItem = class extends vscode2.TreeItem {
-  constructor(commandId, label) {
+  constructor(commandId, label, icon, color) {
     super(label, vscode2.TreeItemCollapsibleState.None);
     this.commandId = commandId;
     this.label = label;
+    this.icon = icon;
+    this.color = color;
+    this.tooltip = this.label;
+    this.iconPath = new vscode2.ThemeIcon(this.icon);
     this.command = {
       command: commandId,
       title: ""
     };
+    this.resourceUri = vscode2.Uri.parse(`color:${this.color}`);
   }
 };
 
@@ -297675,68 +297707,14 @@ function activate(context2) {
             throw new Error("File creation cancelled.");
           }
         }
-        const boilerplate = language === "python" ? `import os
-
-def run_test_case(test_case_number, function):
-    # Determine the base directory dynamically
-
-    base_directory = os.path.dirname(os.path.dirname(__file__))
-
-    file_path = os.path.join(base_directory, 'test_cases', f"input_{test_case_number}.txt")
-
-
-    try:
-
-        # Read the input file
-
-        with open(file_path, "r") as file:
-
-            content = file.read().strip().splitlines()  # Read file and split lines
-
-
-        # Dynamically parse all lines as arguments
-
-        args = [eval(line.strip()) for line in content]  # Parse each line in the file
-
-
-        # Call the provided function with all parsed arguments
-
-        result = function(*args)  # Unpack the arguments dynamically
-
-        print(result)  # Output the result
-
-
-    except FileNotFoundError:
-
-        print(f"Error: File not found at {file_path}. Check the file path and try again.")
-
-    except ValueError as e:
-
-        print(f"Error: {e}")
-
-    except SyntaxError as e:
-
-        print(f"Error: Check your input file format. {e}")
-
-    except Exception as e:
-
-        print(f"Unexpected Error: {e}")
-
-
-
-# WRITE YOUR FUNCTION HERE 
-#-------------------------------------------------------------------------------
-
-
-#-------------------------------------------------------------------------------
-
-
-#run_test_case(ENTER THE TESTCASE NUMBER, ENTER THE FUNCTION NAME)
-
-# EXAMPLE:
+        const boilerplate = language === "python" ? `import os; run_test_case=lambda n,f: print((lambda p: (lambda a: f(*a))(eval(l.strip()) for l in open(p).read().strip().splitlines()) if os.path.isfile(p) else f"Error: File not found at {p}. Check the file path and try again.")((lambda d: os.path.join(d, 'test_cases', f"input_{n}.txt"))(os.path.dirname(os.path.dirname(file)))))
+#WRITE YOUR CODE LOGIC HERE
 
-run_test_case()  # Replace with the relevant test case number and function name
-` : `#include <bits/stdc++.h>
+#---------------------------------------------------------------------------------------
+# Example usage
+# Provide the test case number and function name
+#run_test_case(TEST_CASE_NUMBER, FUNCTION_NAME);
+run_test_case()` : `#include <bits/stdc++.h>
 #include <filesystem>
 #include <functional>
 #include <iostream>

dist/extension.js

@@ -0,0 +1,90 @@
+# Code Citations
+
+## License: unknown
+https://github.com/townmi/blog_node/blob/8e9ed96a49b57ade537267eabb2d9c3266efe31e/source/_posts/%E9%A1%B5%E9%9D%A2%E5%8A%A0%E8%BD%BD%E4%B8%8E%E9%98%BB%E5%A1%9E.md
+
+```
+`<!DOCTYPE html>
+```
+
+
+## License: unknown
+https://github.com/townmi/blog_node/blob/8e9ed96a49b57ade537267eabb2d9c3266efe31e/source/_posts/%E9%A1%B5%E9%9D%A2%E5%8A%A0%E8%BD%BD%E4%B8%8E%E9%98%BB%E5%A1%9E.md
+
+```
+`<!DOCTYPE html>
+    <html lang="en">
+```
+
+
+## License: unknown
+https://github.com/townmi/blog_node/blob/8e9ed96a49b57ade537267eabb2d9c3266efe31e/source/_posts/%E9%A1%B5%E9%9D%A2%E5%8A%A0%E8%BD%BD%E4%B8%8E%E9%98%BB%E5%A1%9E.md
+
+```
+`<!DOCTYPE html>
+    <html lang="en">
+    <head>
+        <meta
+```
+
+
+## License: unknown
+https://github.com/townmi/blog_node/blob/8e9ed96a49b57ade537267eabb2d9c3266efe31e/source/_posts/%E9%A1%B5%E9%9D%A2%E5%8A%A0%E8%BD%BD%E4%B8%8E%E9%98%BB%E5%A1%9E.md
+
+```
+`<!DOCTYPE html>
+    <html lang="en">
+    <head>
+        <meta charset="UTF-8">
+        
+```
+
+
+## License: unknown
+https://github.com/townmi/blog_node/blob/8e9ed96a49b57ade537267eabb2d9c3266efe31e/source/_posts/%E9%A1%B5%E9%9D%A2%E5%8A%A0%E8%BD%BD%E4%B8%8E%E9%98%BB%E5%A1%9E.md
+
+```
+`<!DOCTYPE html>
+    <html lang="en">
+    <head>
+        <meta charset="UTF-8">
+        <meta name="viewport" content="
+```
+
+
+## License: unknown
+https://github.com/townmi/blog_node/blob/8e9ed96a49b57ade537267eabb2d9c3266efe31e/source/_posts/%E9%A1%B5%E9%9D%A2%E5%8A%A0%E8%BD%BD%E4%B8%8E%E9%98%BB%E5%A1%9E.md
+
+```
+`<!DOCTYPE html>
+    <html lang="en">
+    <head>
+        <meta charset="UTF-8">
+        <meta name="viewport" content="width=device-
+```
+
+
+## License: unknown
+https://github.com/townmi/blog_node/blob/8e9ed96a49b57ade537267eabb2d9c3266efe31e/source/_posts/%E9%A1%B5%E9%9D%A2%E5%8A%A0%E8%BD%BD%E4%B8%8E%E9%98%BB%E5%A1%9E.md
+
+```
+`<!DOCTYPE html>
+    <html lang="en">
+    <head>
+        <meta charset="UTF-8">
+        <meta name="viewport" content="width=device-width, initial-scale=1.
+```
+
+
+## License: unknown
+https://github.com/townmi/blog_node/blob/8e9ed96a49b57ade537267eabb2d9c3266efe31e/source/_posts/%E9%A1%B5%E9%9D%A2%E5%8A%A0%E8%BD%BD%E4%B8%8E%E9%98%BB%E5%A1%9E.md
+
+```
+`<!DOCTYPE html>
+    <html lang="en">
+    <head>
+        <meta charset="UTF-8">
+        <meta name="viewport" content="width=device-width, initial-scale=1.0">
+        <title>
+```
+

dist/extension.js.map

@@ -96,13 +96,14 @@ void run_test_case(int test_case_number, const function<void(const T&)>& solutio
 // -------------------- SOLUTION TEMPLATE --------------------
 // MODIFY THIS SECTION FOR YOUR SPECIFIC PROBLEM
 
-void solution(const vector<string>& args) {
+void solution(const vector<int>& args) {
     // Example parsing different types of inputs
     // Modify according to your problem requirements
 
     // For array input: [1,2,3]
     if (!args.empty() && args[0][0] == '[') {
         auto arr = parseArray<int>(args[0]);
+        
     }
 
     // For string input: "hello"
@@ -113,7 +114,6 @@ void solution(const vector<string>& args) {
     // For integer input: 42
     if (args.size() >= 3) {
         int num = parseValue<int>(args[2]);
-        cout << "Input Integer: " << num << endl;
     }
 
     // YOUR SOLUTION LOGIC GOES HERE
@@ -123,8 +123,8 @@ void solution(const vector<string>& args) {
 
 int main() {
     // Run single test case
-    run_test_case<int>(1, solutionInt);                    // For integer input
-    run_test_case<string>(2, solutionString);              // For string input
-    run_test_case<vector<int>>(3, solutionVectorInt);      // For array input
+    run_test_case<vector<int>>(1, solution);
+    
+   
     return 0;
 }