{"_id":"@abdoeid/lcs","name":"@abdoeid/lcs","dist-tags":{"latest":"1.0.0"},"versions":{"1.0.0":{"name":"@abdoeid/lcs","version":"1.0.0","description":"a package that get the longest common subsequence between two strings","main":"index.js","scripts":{"test":"echo \"Error: no test specified\" && exit 1"},"keywords":["lcs","problem solving","competitive programming"],"peerDependencies":{"express":"^4.0.0"},"author":{"name":"abdo eid"},"license":"ISC","type":"module","_id":"@abdoeid/lcs@1.0.0","_nodeVersion":"25.8.1","_npmVersion":"11.11.0","dist":{"integrity":"sha512-IQqoiqeznoWzxu1QZoHug8Py2n39D06v+k1yD8uZwfcsNzJ6BpZn9o5vEnmB3dmzkbZrr4u3dDqJ1QD9LPsclA==","shasum":"6d085e70f8e0ef838e362d98e27684af8779133e","tarball":"https://registry.npmjs.org/@abdoeid/lcs/-/lcs-1.0.0.tgz","fileCount":2,"unpackedSize":1143,"signatures":[{"keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U","sig":"MEQCIH5J+6TY83VG6w9WIe+Eqj1IdsHMGx1mOdFVj2mvHuKBAiBbaY/MLKT4+JeZrevEA/pSYfBoUQbP8wpfMg2r3LD6Tg=="}]},"_npmUser":{"name":"abdoeid","email":"abdoeid2121@gmail.com"},"directories":{},"maintainers":[{"name":"abdoeid","email":"abdoeid2121@gmail.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages-npm-production","tmp":"tmp/lcs_1.0.0_1775554713572_0.5182913725732499"},"_hasShrinkwrap":false}},"time":{"created":"2026-04-07T09:38:33.456Z","1.0.0":"2026-04-07T09:38:33.723Z","modified":"2026-04-07T09:38:33.965Z"},"maintainers":[{"name":"abdoeid","email":"abdoeid2121@gmail.com"}],"description":"a package that get the longest common subsequence between two strings","keywords":["lcs","problem solving","competitive programming"],"author":{"name":"abdo eid"},"license":"ISC","readme":"ERROR: No README data found!","readmeFilename":"","_rev":"1-8842bd46b90b1a482df3316644b17ed2"}