{"id":15105852,"url":"https://github.com/jaimescose/grinding","last_synced_at":"2026-01-19T12:33:04.450Z","repository":{"id":243771258,"uuid":"812392652","full_name":"jaimescose/grinding","owner":"jaimescose","description":null,"archived":false,"fork":false,"pushed_at":"2024-06-23T21:13:58.000Z","size":2400,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-04-05T13:22:52.125Z","etag":null,"topics":["algorithms","algorithms-and-data-structures","data-structures","interview-preparation","leetcode","leetcode-python","leetcode-solutions","obsidian","obsidian-md"],"latest_commit_sha":null,"homepage":"","language":"Python","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/jaimescose.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2024-06-08T18:57:37.000Z","updated_at":"2024-06-23T21:14:01.000Z","dependencies_parsed_at":"2024-06-11T04:08:43.286Z","dependency_job_id":"196cab2c-a514-4494-97fa-03e61d9fff64","html_url":"https://github.com/jaimescose/grinding","commit_stats":{"total_commits":86,"total_committers":1,"mean_commits":86.0,"dds":0.0,"last_synced_commit":"e72bdc8a20523132d54e3828e77530a36f9805b7"},"previous_names":["jaimescose/grinding"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/jaimescose/grinding","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jaimescose%2Fgrinding","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jaimescose%2Fgrinding/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jaimescose%2Fgrinding/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jaimescose%2Fgrinding/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/jaimescose","download_url":"https://codeload.github.com/jaimescose/grinding/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jaimescose%2Fgrinding/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":28567896,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-01-19T08:53:44.001Z","status":"ssl_error","status_checked_at":"2026-01-19T08:52:40.245Z","response_time":67,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.6:443 state=error: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithms","algorithms-and-data-structures","data-structures","interview-preparation","leetcode","leetcode-python","leetcode-solutions","obsidian","obsidian-md"],"created_at":"2024-09-25T20:43:45.208Z","updated_at":"2026-01-19T12:33:04.434Z","avatar_url":"https://github.com/jaimescose.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# grinding (WIP)\n\nObsidian vault to help you keep track of the [Leetcode](https://leetcode.com/) problems you've solved, and are willing to solve.\n\nI've organized this vault in such a way that the friction for you to just grab a new problem, analyze it, solve it, and document it, it's the smoothest one possible (given that you've used [Obsidian]() before. Otherwise, would take you some time to get it through the learning curve)\n\n## What you could find\n\n```shell\n├── All.md\n├── Blind 75.md\n├── NeetCode 150.md\n├── Pipfile\n├── Pipfile.lock\n├── Templates\n│   ├── Coding template.md\n│   └── View.md\n├── _assets\n└── coding\n\t├── __init__.py\n ├── Problem.md\n ├── problem.py\n └── test_script.py\n```\n\n### Root\n\nHere you could find some predefined table views, built with [Dataview](https://blacksmithgu.github.io/obsidian-dataview/api/intro/) (an Obsidian community plugin), where you could visualize all the problems (Markdown files) within your `/coding` folder\n\nYou could show there any property defined in your problem Markdown file. Here is the list of currently supported properties + [Dataviews' Implicit fields](https://blacksmithgu.github.io/obsidian-dataview/annotation/metadata-pages/#implicit-fields):\n\n| property | meaning | type | Values |\n| ---------- | -------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- | -------------------- | --------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- |\n| solved | whether you've solved the problem | Checkbox | true, false |\n| difficulty | difficulty assigned by Leetcode | Text | `easy`, `medium`, `hard` |\n| category | it's basically based on the category assigned by [Neetcode](https://neetcode.io/practice) | Text | Arrays \u0026 Hashing, Two Pointers, Sliding Window, Stack, Binary Search, Linked List, Trees, Heap / Priority Queue, Backtracking, Tries, Graphs, Advanced Graphs, 1-D Dynamic Programming, 2-D Dynamic Programming, Greedy, Intervals, Math \u0026 Geometry, Bit Manipulation |\n| topics | could be seen as a free list where you type the topics you used to solved it (Hash Maps, Arrays, Linked Lists, etc.). Although, I'm filling the property with the topics assigned by Leetcode:\u003cbr\u003e\u003cbr\u003e![Pasted image 20240621225158](_assets/Pasted%20image%2020240621225158.png) | List | Free text |\n| tags | tags that would help you classify these problems. Could be: `blind75` `neetcode150`, or whatever tag you want to put on. However, take into account that the views [Blind 75](Blind%2075.md) and [NeetCode 150](NeetCode%20150.md), are based on these tags.\u003cbr\u003e\u003cbr\u003eAll the problems would have the `problem` tag to facilitate finding them within Obsidian (given by the **Coding template** within `/Templates` folder) | Obsidian native tags | `problem`, `blind75`, `neetcode150` |\n| companies | list of companies that have used the problem during their interviews. Would be helpful if you desire to create a view for a specific company | List | Free text |\n| link | Leetcode link | Text | Valid URL |\n| premium | whether you need a Leetcode subscription to access the problem | Checkbox | true, false |\n\n## Resources\n\n- Time and space complexity calculator: [Big O Calc](https://www.bigocalc.com/)","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjaimescose%2Fgrinding","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fjaimescose%2Fgrinding","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjaimescose%2Fgrinding/lists"}