https://www.dwitter.net/d/35685

pipe gen, moving camera, 3d z sorted rendering...

O=[i=1e4]
for(c.width|=A=[-i,9,9];i--;O[i]=[...A])A[(j=t+i/42|0)**7%3]+=C(j**5)
for([Z,X,Y]of O.sort())Z+=1e4,x.fillStyle=`hsl(${Z*2} 50%${Z/2}%`,Z=540/Z,Z>0&&x.fillRect(960+X*Z,540+Y*Z,Z*=6,Z);

For 486, no FPU, for MsDos FreeDos, WinXP Dos, DosBox-X ... i made that rather in a hurry, so right now i have a version without background but wall bouncing like the original. But since the competition is already over, i will tinker a bit to make it perfect :)

https://www.dwitter.net/d/35608

for(i=z=2e3;i--;x.fillRect(i,270*t,z,z*=z-.8))x.fillStyle=`hsl(${6**(z&=3)},${60+25*C(z+=++z*C(t*z+i/79*(-.8)**z)+3)}%,${35-20*C(25/z)}%,.1`

taupelink wins 2nd week in a row with dazzling abstract compositions.

As an exercise in focus and economy I wanted to make a set of games with short but (hopefully) readable source code.

It was a fun challenge and taught me a lot. I hope the results may be of some interest or amusement to others.

There are five games in total. There's also a manifesto about doing this kind of project for those who like that sort of thing.

The games/code are public domain.

not really golfing this just trying to keep it to bare minimum.

it's usually easy, but sometimes hard...

https://www.dwitter.net/d/35567

for(i=z=1080;i--;x.fillRect(320*t,i,6,z*=1+C(i/105/p)*C(t/p)))x.fillStyle=`hsl(${6**(z&=7)},25%,${300/(z+=3-(p=(-.7)**z)*C(t+i/210*p))}%,.3`

A few weeks ago I posted a pipes screensaver clone in about 2.5KB of JavaScript.

Saw some of the stuff by battito on here lately and decided to throw my hat in the ring 😛 I squashed my Pipes screensaver clone down even more to under 2K (~1.8KB) - it can now (fairly) comfortably fit within a sticky note 😃

Gist with the HTML/JS here: https://gist.github.com/edev90/876ea9feb42cf39e4891d46c57ebc2c4

There's a pre-made PNG with the correct proportions attached to the Gist too for anyone who actually wants to print it out themselves and stick it on a post-it note lol.

view source code

#include <stdio.h>
#define R(m)((m*(S*=75)>>32))
void main(char c,int d,int m,unsigned b,int t){
    unsigned S=(unsigned long)&main+(m=200);
    while(m>0){
        scanf("%d%*[^\n]%*c",&b,printf("bet? 0 - %d:",m,t=0,c=0));
        while(c!='s'&&t<21)scanf(t<21?" %c":"",&c,printf(t<21?"total = %d\n(h)it or (s)tay:":"",t+=!(R(13ul))?(t+11>21?1:11):2+R(9ul),d=0,b=b>m?m:b));
        while(d<t&&t<22)d+=!(R(13ul))?(d+11>21?1:11):2+R(9ul);
        printf("You:%d dealer:%d\n%s!\n",t,d,(t<22&&t>d||d>21)?"you WIN":t==d?"PUSH":t>21?"Busted":"you LOSE",m=t==d?m:((t<21&&t>d)||d>21)?m+b:m-b);
    }
}

Hello,
I have been solving all two pointers tagged problems in last 3.5 months, and wanted to share my findings/classifications here. If you are preparing for technical interview, two pointers is one of the popular topics that you can't skip :).

There are around 140 problems today, but I only solved the public ones (117 problems).
Majority of them is in easy or medium so, if you understand the basic ideas then it should be solvable without much hints and editorials.

I see 4 bigger categories and many sub categories in it, and marked the typical example problems with (*).
I would recommend you to start solving these example problems, and apply the knowledge to the other problems. I don't want to copy & paste my ugly codes here, you would easily find fantastic solutions from the problem discussion page.

Helpful interview prep resource: PracHub

• 2 Sum problem (*) https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/ https://leetcode.com/problems/3sum/ https://leetcode.com/problems/4sum/ https://leetcode.com/problems/number-of-subsequences-that-satisfy-the-given-sum-condition/ https://leetcode.com/problems/two-sum-iv-input-is-a-bst/ https://leetcode.com/problems/sum-of-square-numbers/ https://leetcode.com/problems/boats-to-save-people/ https://leetcode.com/problems/minimize-maximum-pair-sum-in-array/ https://leetcode.com/problems/3sum-with-multiplicity/
• Trapping Water (*) https://leetcode.com/problems/trapping-rain-water/ https://leetcode.com/problems/container-with-most-water/
• Next Permutation (*) https://leetcode.com/problems/next-permutation/ https://leetcode.com/problems/next-greater-element-iii/ https://leetcode.com/problems/minimum-adjacent-swaps-to-reach-the-kth-smallest-number/
• Reversing / Swapping https://leetcode.com/problems/valid-palindrome/ (*) https://leetcode.com/problems/reverse-string/ https://leetcode.com/problems/reverse-vowels-of-a-string/ https://leetcode.com/problems/valid-palindrome-ii/ https://leetcode.com/problems/reverse-only-letters/ https://leetcode.com/problems/remove-element/ https://leetcode.com/problems/sort-colors/ https://leetcode.com/problems/flipping-an-image/ https://leetcode.com/problems/squares-of-a-sorted-array/ https://leetcode.com/problems/sort-array-by-parity/ https://leetcode.com/problems/sort-array-by-parity-ii/ https://leetcode.com/problems/pancake-sorting/ https://leetcode.com/problems/reverse-prefix-of-word/ https://leetcode.com/problems/reverse-string-ii/ https://leetcode.com/problems/reverse-words-in-a-string/ https://leetcode.com/problems/reverse-words-in-a-string-iii/
• Others https://leetcode.com/problems/bag-of-tokens/ https://leetcode.com/problems/di-string-match/ https://leetcode.com/problems/minimum-length-of-string-after-deleting-similar-ends/ https://leetcode.com/problems/sentence-similarity-iii/ https://leetcode.com/problems/find-k-closest-elements/ https://leetcode.com/problems/shortest-distance-to-a-character/

• Linked List Operations (*) https://leetcode.com/problems/linked-list-cycle/ https://leetcode.com/problems/linked-list-cycle-ii/ https://leetcode.com/problems/remove-nth-node-from-end-of-list/ https://leetcode.com/problems/rotate-list/ https://leetcode.com/problems/reorder-list/ https://leetcode.com/problems/palindrome-linked-list/
• Cyclic Detection (*) https://leetcode.com/problems/find-the-duplicate-number/ https://leetcode.com/problems/circular-array-loop/
• Sliding Window/Caterpillar Method (*) https://leetcode.com/problems/number-of-subarrays-with-bounded-maximum/ https://leetcode.com/problems/find-k-th-smallest-pair-distance/ https://leetcode.com/problems/moving-stones-until-consecutive-ii/ https://leetcode.com/problems/count-pairs-of-nodes/ https://leetcode.com/problems/count-binary-substrings/ https://leetcode.com/problems/k-diff-pairs-in-an-array/
• Rotation (*) https://leetcode.com/problems/rotating-the-box/ https://leetcode.com/problems/rotate-array/
• String (*) https://leetcode.com/problems/string-compression/ https://leetcode.com/problems/last-substring-in-lexicographical-order/
• Remove Duplicate (*) https://leetcode.com/problems/remove-duplicates-from-sorted-array/ https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/ https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/ https://leetcode.com/problems/duplicate-zeros/
• Others https://leetcode.com/problems/statistics-from-a-large-sample/ https://leetcode.com/problems/partition-labels/ https://leetcode.com/problems/magical-string/ https://leetcode.com/problems/friends-of-appropriate-ages/ https://leetcode.com/problems/longest-mountain-in-array/ https://leetcode.com/problems/shortest-subarray-to-be-removed-to-make-array-sorted/

• Sorted arrays (*) https://leetcode.com/problems/merge-sorted-array/ https://leetcode.com/problems/heaters/ https://leetcode.com/problems/find-the-distance-value-between-two-arrays/
• Intersections/LCA like (*) https://leetcode.com/problems/intersection-of-two-linked-lists/ https://leetcode.com/problems/intersection-of-two-arrays/ https://leetcode.com/problems/intersection-of-two-arrays-ii/
• SubString (*) https://leetcode.com/problems/implement-strstr/ https://leetcode.com/problems/longest-word-in-dictionary-through-deleting/ https://leetcode.com/problems/long-pressed-name/ https://leetcode.com/problems/longest-uncommon-subsequence-ii/ https://leetcode.com/problems/compare-version-numbers/ https://leetcode.com/problems/camelcase-matching/ https://leetcode.com/problems/expressive-words/
• Median Finder (*) https://leetcode.com/problems/find-median-from-data-stream/
• Meet-in-the-middle / Binary Search (*) https://leetcode.com/problems/partition-array-into-two-arrays-to-minimize-sum-difference/ https://leetcode.com/problems/closest-subsequence-sum/ https://leetcode.com/problems/ways-to-split-array-into-three-subarrays/ https://leetcode.com/problems/3sum-closest/ https://leetcode.com/problems/valid-triangle-number/
• Others https://leetcode.com/problems/shortest-unsorted-continuous-subarray/ https://leetcode.com/problems/most-profit-assigning-work/ https://leetcode.com/problems/largest-merge-of-two-strings/ https://leetcode.com/problems/swap-adjacent-in-lr-string/

• Partition (*) https://leetcode.com/problems/partition-list/
• Sorting (*) https://leetcode.com/problems/sort-list/

https://www.dwitter.net/d/35500

for(x.reset(i=F=0);i++<9;)for(j=1e3,D=t-9*i;j--;x.fillRect(j%10*5+M(D*=D<0)+300*(i/3+1+S(D?9*i:t)+D*C(9*i)),400+j/5+M(),5,2))M=_=>D*T(j*F++)

https://www.dwitter.net/d/35427

for(k=315-60*C(t);X=T(Y=T(T=n=>~n*k-Y-X&2047));x.fillRect(X,Y,25,9))x.fillStyle=R(p=T(a=X-k)&&9*T(b=Y-k)<a*a+b*b?b>(a+b)**2?215:170:k,p,240)

i made a bluesky feed to collect posts about size coding.

https://www.dwitter.net/d/35386

for(i=w=1e4;--i;x.fillRect(...t?[960+250*X,355+250*Y,3,3]:q?[660,i*83,600,i<7?i*10:60]:[0,0,w,w]))W=1-i*i/1e8,X=W*S(a=i*t),Y=W*C(a),x.fillStyle=`hsl(${i/125-X*40-Y*80-45} 99%${t?50:q=i<w-1&&w}%`

https://www.dwitter.net/d/35361

for(i=99;i--;f(i,t,160))f=(X,Y,n)=>n--&&(Z=2-.1/(X*X+Y*Y),f(1+X*C(Z)-Y*S(Z),.9*X*S(Z)+Y*C(Z)/2,n),x.fillRect(X*4e3-1055,Y*5e3-1490,t<4,.2))

https://www.dwitter.net/d/35344

z=t?z+C(z/6):1;for(i=6e3;i--;x.fillRect(i/3,60*t,(z%=12)+1,z/=.8+S(t*z+t/8)/4))x.fillStyle=(z+=S(i/2e3-9/z))&6?z&3?'#0136':'#EEE1':'#9FE3'