Scraping solutions from various (mostly private) forums, I’ve written up AoC Day 7 on Study Q. The aim of these articles is to help less experienced q coders learn from solutions written by q veterans. In today’s challenge I take you through my own r...
In the latest episode of the Array Cast we talk to John Earnest, creator of the ok.js k6 interpreter and an expert on k programming, about many aspects of array programming, including the relationship between k and Forth.
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 ...
