Frontend Developer Coding Questions

1. Reverse a String
function reverseString(str) {
return [Link]("").reverse().join("");
}
 Frontend Developer Coding Questions

2. Palindrome Check
function isPalindrome(str) {
return str === [Link]("").reverse().join("");
}
 Frontend Developer Coding Questions

3. FizzBuzz
for(let i=1; i<=100; i++) {
let res = "";
if(i%3===0) res += "Fizz";
if(i%5===0) res += "Buzz";
[Link](res || i);
}
 Frontend Developer Coding Questions

4. Count Vowels in a String

function countVowels(str) {
return ([Link](/[aeiou]/gi) || []).length;
}
 Frontend Developer Coding Questions

5. Find Duplicate Elements

function findDuplicates(arr) {
const seen = new Set();
const dups = new Set();
for (let i of arr) {
if ([Link](i)) [Link](i);
[Link](i);
}
return [...dups];
}
 Frontend Developer Coding Questions

6. Factorial of a Number
function factorial(n) {
return n <= 1 ? 1 : n * factorial(n - 1);
}
 Frontend Developer Coding Questions

7. Check Prime Number

function isPrime(n) {
if (n <= 1) return false;
for (let i = 2; i <= [Link](n); i++) {
if (n % i === 0) return false;
}
return true;
}
 Frontend Developer Coding Questions

8. Fibonacci Sequence
function fibonacci(n) {
const seq = [0, 1];
for(let i=2; i<n; i++) {
seq[i] = seq[i-1] + seq[i-2];
}
return seq;
}
 Frontend Developer Coding Questions

9. Anagram Check
function isAnagram(str1, str2) {
return [Link]('').sort().join('') === [Link]('').sort().join('');
}
 Frontend Developer Coding Questions

10. Capitalize First Letter

function capitalizeWords(str) {
return [Link](" ").map(word => word[0].toUpperCase() + [Link](1)).join(" ");
}
 Frontend Developer Coding Questions

11. Remove Duplicates from Array

function removeDuplicates(arr) {
return [...new Set(arr)];
}
 Frontend Developer Coding Questions

12. Find Max Element in Array

function findMax(arr) {
return [Link](...arr);
}
 Frontend Developer Coding Questions

13. Find Min Element in Array

function findMin(arr) {
return [Link](...arr);
}
 Frontend Developer Coding Questions

14. Sum of Array Elements

function arraySum(arr) {
return [Link]((a, b) => a + b, 0);
}
 Frontend Developer Coding Questions

15. Find Intersection of Two Arrays

function intersection(arr1, arr2) {
return [Link](value => [Link](value));
}
 Frontend Developer Coding Questions

16. Flatten Nested Array

function flatten(arr) {
return [Link](Infinity);
}
 Frontend Developer Coding Questions

17. Convert String to Array

function stringToArray(str) {
return [Link](" ");
}
 Frontend Developer Coding Questions

18. Count Occurrences of Character

function countChar(str, char) {
return [Link](char).length - 1;
}
 Frontend Developer Coding Questions

19. Check if Array is Sorted

function isSorted(arr) {
return [Link]((val, i, a) => i === 0 || a[i - 1] <= val);
}
 Frontend Developer Coding Questions

20. Merge Two Sorted Arrays

function mergeSorted(a, b) {
return [...a, ...b].sort((x, y) => x - y);
}
 Frontend Developer Coding Questions

21. Binary Search

function binarySearch(arr, target) {
let left = 0, right = [Link] - 1;
while (left <= right) {
let mid = [Link]((left + right) / 2);
if (arr[mid] === target) return mid;
else if (arr[mid] < target) left = mid + 1;
else right = mid - 1;
}
return -1;
}
 Frontend Developer Coding Questions

22. Check if Object is Empty

function isEmpty(obj) {
return [Link](obj).length === 0;
}
 Frontend Developer Coding Questions

23. Debounce Function

function debounce(fn, delay) {
let timeout;
return function(...args) {
clearTimeout(timeout);
timeout = setTimeout(() => [Link](this, args), delay);
};
}
 Frontend Developer Coding Questions

24. Throttle Function

function throttle(fn, limit) {
let inThrottle;
return function(...args) {
if (!inThrottle) {
[Link](this, args);
inThrottle = true;
setTimeout(() => inThrottle = false, limit);
}
};
}
 Frontend Developer Coding Questions

25. Deep Clone Object

function deepClone(obj) {
return [Link]([Link](obj));
}
 Frontend Developer Coding Questions

26. Swap Two Variables

let a = 1, b = 2;
[a, b] = [b, a];
 Frontend Developer Coding Questions

27. Generate Random Number in Range

function getRandom(min, max) {
return [Link]([Link]() * (max - min + 1)) + min;
}
 Frontend Developer Coding Questions

28. Validate Email Format

function isValidEmail(email) {
return /^[^\s@]+@[^\s@]+\.[^\s@]+$/.test(email);
}
 Frontend Developer Coding Questions

29. Generate Random Hex Color

function getRandomColor() {
return '#' + [Link]([Link]()*16777215).toString(16);
}
 Frontend Developer Coding Questions

30. Convert RGB to Hex

function rgbToHex(r, g, b) {
return "#" + [r, g, b].map(x => [Link](16).padStart(2, '0')).join("");
}
 Frontend Developer Coding Questions

31. String Compression

function compressString(str) {
return [Link](/(.)\1+/g, (m, c) => c + [Link]);
}
 Frontend Developer Coding Questions

32. Longest Word in Sentence

function longestWord(str) {
return [Link](" ").sort((a,b) => [Link] - [Link])[0];
}
 Frontend Developer Coding Questions

33. Check Power of Two

function isPowerOfTwo(n) {
return (n > 0) && ((n & (n - 1)) === 0);
}
 Frontend Developer Coding Questions

34. Convert to CamelCase

function toCamelCase(str) {
return [Link](/[-_](.)/g, (_, c) => [Link]());
}
 Frontend Developer Coding Questions

35. Count Words in Sentence

function countWords(str) {
return [Link]().split(/\s+/).length;
}
 Frontend Developer Coding Questions

36. Check Balanced Parentheses

function isBalanced(str) {
let stack = [];
for (let ch of str) {
if (ch === '(') [Link](ch);
else if (ch === ')') {
if (![Link]) return false;
[Link]();
}
}
return [Link] === 0;
}
 Frontend Developer Coding Questions

37. Replace All Occurrences in String

function replaceAll(str, find, replace) {
return [Link](find).join(replace);
}
 Frontend Developer Coding Questions

38. Sort Array by Length of Strings

function sortByLength(arr) {
return [Link]((a, b) => [Link] - [Link]);
}
 Frontend Developer Coding Questions

39. Remove Falsy Values

function removeFalsy(arr) {
return [Link](Boolean);
}
 Frontend Developer Coding Questions

40. Generate Fibonacci using Recursion

function fib(n) {
if (n <= 1) return n;
return fib(n-1) + fib(n-2);
}
 Frontend Developer Coding Questions

41. Sum Digits of a Number

function sumDigits(n) {
return [Link]().split('').reduce((a, b) => a + +b, 0);
}
 Frontend Developer Coding Questions

42. Convert Number to Binary

function toBinary(n) {
return [Link](2);
}
 Frontend Developer Coding Questions

43. Convert Binary to Decimal

function toDecimal(bin) {
return parseInt(bin, 2);
}
 Frontend Developer Coding Questions

44. GCD of Two Numbers

function gcd(a, b) {
return b === 0 ? a : gcd(b, a % b);
}
 Frontend Developer Coding Questions

45. LCM of Two Numbers

function lcm(a, b) {
return (a * b) / gcd(a, b);
}
 Frontend Developer Coding Questions

46. Find Missing Number in Array

function findMissing(arr) {
let n = [Link] + 1;
let sum = (n * (n + 1)) / 2;
return sum - [Link]((a, b) => a + b, 0);
}
 Frontend Developer Coding Questions

47. Get Unique Values from Array of Objects

function getUnique(arr, key) {
const seen = new Set();
return [Link](item => {
if ([Link](item[key])) return false;
[Link](item[key]);
return true;
});
}
 Frontend Developer Coding Questions

48. Check Palindrome Number

function isPalindromeNumber(num) {
return [Link]() === [Link]().split('').reverse().join('');
}
 Frontend Developer Coding Questions

49. Find All Pairs That Sum to Target

function findPairs(arr, target) {
const pairs = [];
const set = new Set();
for (let num of arr) {
if ([Link](target - num)) {
[Link]([num, target - num]);
}
[Link](num);
}
return pairs;
}
 Frontend Developer Coding Questions

50. Sort Array of Objects by Key

function sortByKey(arr, key) {
return [Link]((a, b) => a[key] - b[key]);
}