Prime Factorization in JavaScript

🚀 Coding Interview Question: Prime Factorization (Must Know!) If you're preparing for DSA / Frontend / Fullstack interviews, this is a classic question you should not miss 👇 👉 Problem Statement: Given a positive integer "n", return its prime factorization: - Include all prime factors - Repeat factors based on multiplicity - Output in non-decreasing order - Format: list-like string 📌 Example: Input: 12 Output: [2, 2, 3] 💡 Approach: - Start dividing "n" from 2 - Keep dividing until it is no longer divisible - Move to next number - Continue till "n > 1" 💻 JavaScript Solution: function primeFactors(n) { let result = []; for (let i = 2; i * i <= n; i++) { while (n % i === 0) { result.push(i); n = n / i; } } if (n > 1) { result.push(n); } return `[${result.join(', ')}]`; } // Example console.log(primeFactors(12)); // [2, 2, 3] 🔥 Why this question is important? - Tests loops + logic building - Checks number theory basics - Evaluates edge case handling - Common in coding rounds ⚡ Pro Tip: Iterate till √n instead of n → better performance 💬 Have you faced this in interviews? Comment “YES” and I’ll share more tricky questions 👇 #javascript #reactjs #frontend #codinginterview #dsa #webdevelopment #softwareengineer #100DaysOfCode

This is a great reminder about a fundamental coding challenge that really highlights a candidate's problem-solving skills and attention to detail. It's also interesting how optimizing the loop to iterate only up to the square root of 'n' can significantly improve performance, a subtle but important point for efficiency. 👍

To view or add a comment, sign in

Explore content categories