-
## Hello!
- Vote on this issue by adding a đź‘Ť reaction
- If you want to implement this feature, comment to let us know (we'll work with you on design, scheduling, etc.)
## Issue details
Cur…
-
Exercises for chapter 4 this Friday? I'm guessing.
Also, a Coursera course on algorithms is starting up 4/28. Might be a good supplement/source of exercises. https://www.coursera.org/course/algo
-
### Objective
Develop a robust AI Judging System to evaluate code submissions quickly and objectively in the AI Hacking League.
### Tasks
1. **API Integration:**
- Integrate OpenAI's GPT-4 model t…
-
# Jump Search
Jump search is an efficient algorithm designed for searching an element in a sorted array. It works by dividing the array into blocks of a fixed size (jump size), and then checks the el…
-
-
**Is your feature request related to a problem? Please describe.**
Add options for color code systems like RAL (standard in Europe), Federal Standard 595C colour range (standard in the US)
**Desc…
-
\*REMEMBER, BE **SMART**!
S: Specific
M: Measurable
A: Achievable
R: Relevant
T: Time-Bound\*
## Goal-State/What/Result
Build a set of core search tools into Datafusion that provide enhanced search…
-
The initial SkipScan implementation only works for uncompressed chunks but for compressed chunks a similar optimization could be implemented.
- Coordinate with Partially mutable compressed chunks #…
-
# Introduction
In RFC https://github.com/opensearch-project/OpenSearch/issues/12918, we discussed potential approaches for splitting of a shard in-place and requested feedback on the same as well a…
-
In `nmdc-schema` v9.4.0 and later, the `Migrator`s have the potential to create, delete, and rename collections.
Currently, the migration notebooks (effectively, ETL scripts) in `nmdc-runtime` do n…