https://leetcode.com/problems/maximum-subarray/ Given an integer array
nums, find the subarray which has the largest sum and return its sum.
The performance of q solutions to the Maximum Subarray problem appeared
on StackOverflow recently. In q/kdb+,<!-- -->...
The dōjō awaits youAnother intimate Vector Dōjō this coming Sunday 20
November: room for three. Once again we’ll pick small problems from e.g.
Project Euler, Rosetta Code, or LeetCode to explore the transition from
looping to vector solutions. Mornin...
Every qSQL query has an equivalent functional form – in fact, is parsed
into it, so there is no difference in their execution. The qSQL queries
look like SQL and we use them wherever possible, but the functional
forms are more general, and some more ...
In the forthcoming episode of the ArrayCast podcast our guest Michal
Wallace of 1010data referred to an ad he had once placed on LinkedIn to
recruit someone who would learn k3, an ancestor language of q. In the
job ad he showed the k3 code to print a...
https://projecteuler.net/problem=7 By listing the first six prime
numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13.
What is the 10,001st prime number? Solution 1 Use Eratosthenes’ Sieve to
generate enough primes. Then pick the 10,<!-- --><!-- -->...
Nice! Would you consider adding your constant-time solution to the
problem article at Study Q? Your video production skills are growing! I
can follow this comfortably on my 49" 5K monitor – but there is a lot of
blank space. I wonder if the code is r...