-
I know I can in principle do this with OptaPlanner, but ruby is my language of preference, so if it can be done in ruby that would be really nice.
-
I'm Alejandro Serrano, a PhD student in the area of functional programming, currently working in [Utrecht University](http://www.cs.uu.nl/staff/mena.html). I use Haskell for my daily job, but I also l…
-
### Problem: Determining what topics are best for students once they graduate.
### Possible Solutions:
1. Diving deeper into existing technologies. For example, going into advanced JavaScript.
…
-
Write in Python a recursive function `def breadth_first_visit(root_node)` that takes the root node of a tree and returns a list containing all the nodes of the tree according to a breadth first order,…
-
Forking the conversation from https://github.com/dotnet/runtime/issues/14032, creating this issue is to discuss a potential design for a specialized heap implementation that supports _O(log n)_ priori…
-
### LeetCode Username
hardik-narayan
### Problem Number, Title, and Link
https://leetcode.com/problems/fibonacci-number/
### Bug Category
Problem constraints
### Bug Description
In this problem…
-
On my laptop it takes about 3 seconds to compile the reverse single variable example. Any ideas how to speed this up?
-
### Description
JAX is unexpectedly slow to compile this simple recursive Fibonacci function.
My understanding is that it should cache each JIT-compilation of `fib` with a fresh (static) `t`, so…
kach updated
3 months ago
-
- [ ] Change Month and Week Number
- [ ] focWeekExport "2023-01-19" "2023-01-26"
- [ ] Update Search Index
- [ ] Download New Attachments
- [ ] Update links
- [ ] Check that comment links work (p…
-
Add a README to each directory containing proper documentation for algorithms or data structures in that directory.