July 2017

— Pushdown automation might be an easy way to implement that algorithm

For hello we can construct a DFA such that the full input string will construct a running list of encountered, matching input strings:

hello

-->(s1)-h->(s2)-e->(s3)-l->(s4)-l->(s5)-o->((s6))

^___________________ε___________________/

— Then it becomes a graph theory problem, one of the best fun ways to solve any problem :)

— A nodejs questionI have X module in node_modules folderHow could I know which package pulled this X module?

node_modules

Message permanent page

— npm ls

npm ls

— In your main project folder

— No thanks tbh

— Hahaha

— Fun ways to solve easy problems in complicated ways - An interactive guide - By Dani

— Hmm, it's print dependencies treeA bit confusing if the tree is largeBTW, thanx

— npm ls --depth=1

npm ls --depth=1

— Or 0