Code Smarter, Not Harder.

Need code that works? Grab a snippet. Made something cool? Share it back. Simple as that.

function getLinkExtension(url) {
  try {
    const path = new URL(url).pathname;
    const lastSegment = path.split("/").pop();
    return lastSegment.includes(".")
      ? lastSegment.split(".").pop().toLowerCase()
      : null;
  } catch {
    return null;
  }
}
 
getLinkExtension("https://example.com/file.pdf"); // "pdf"
getLinkExtension("https://example.com/archive.tar.gz"); // "gz"(note how only the last extension is returned)
getLinkExtension("https://example.com/video.mp4?download=true"); // "mp4"
getLinkExtension("https://example.com/folder/"); // null (no file in the URL)
getLinkExtension("invalid-url"); // null (invalid URL)

Get Link Extension

Features

Explore the powerful features that make SnipNest an awesome platform.

super-cool-snippet.mdx Submit Snippet

1234567

Open-source

Easily fork, edit, and submit code snippets. Share your work with the community in just a few clicks.

chunk arr

function chunkArray(array, size) {
  return Array.from({ length: Math.ceil(array.length / size) }, (_, i) =>
    array.slice(i * size, i * size + size)
  );
}
 
const numbers = [1, 2, 3, 4, 5, 6, 7];
chunkArray(numbers, 3); // [[1, 2, 3], [4, 5, 6], [7]]

Find Snippets Fast

Quickly filter through a vast collection of code snippets. Get the perfect code for your project every time.

chunk arr

Code Editor Integration

Access and insert your saved snippets directly within your code editor. Boost your productivity without leaving your workspace.

Looks good to me!

Awesome work, we should add this.

Pull request successfully merged and closed

function chunkArray(array, size) {
  return Array.from({ length: Math.ceil(array.length / size) }, (_, i) =>
    array.slice(i * size, i * size + size)
  );
}
 
const numbers = [1, 2, 3, 4, 5, 6, 7];
chunkArray(numbers, 3); // [[1, 2, 3], [4, 5, 6], [7]]

Community Driven

Help improve the platform by contributing snippets and collaborating with other developers.