- Generate the first 10 numbers in the Fibonacci sequence
- Print numbers from 1 to 100, replacing multiples of 3 with "Fizz," multiples of 5 with "Buzz," and both with "FizzBuzz" (FizzBuzz)
- Implement a function to traverse a graph by exploring as far as possible before backtracking (Depth-first search)
- Explore nodes layer by layer in a graph (Breadth-first search)
- Divide and conquer by repeatedly narrowing the search range (Binary Search)
- Check each element in a list to find a target value (Linear Search)
- Find pairs in array using two pointers technique
- Reverse the order of characters in a string
- Check if two strings are made of the same characters (Anagram Check)
- Check if a string can be split into dictionary words (Word Break)
- Expand and contract a range to find subarrays that meet criteria (Sliding Window)
- Check if a string has balanced opening and closing brackets (Valid Parentheses)
- Find all possible solutions by trying different paths and backtracking when needed (Backtracking)
- Split and merge sorted halves to sort an array (Merge Sort)
- Order graph nodes in a sequence respecting dependencies (Topological Sort)
- Repeatedly swap adjacent elements to sort an array (Bubble Sort)
- Sort by placing elements into different 'buckets' before sorting each bucket (Bucket Sort)
- Find the smallest unsorted element and move it to the front (Selection Sort)
- Insert each unsorted element into its correct position (Insertion Sort)
- Sort using a binary heap structure (Heap Sort)
- Use a pivot to partition elements into two groups for sorting (Quick Sort)
- Store strings in a prefix tree structure for fast retrieval (Trie)
- Compute cumulative sums for subarray calculations (Prefix Sum)
- Find the k-th smallest element in an unsorted array (Quickselect)
- Find the shortest path from a source node to all other nodes (Dijkstra's Algorithm)
- Group nodes by connectivity for union-find operations (Union Find)
- Find the minimum number of coins needed to make change for a given amount using available denominations (Coin Change Problem)
- Find the shortest path in a weighted graph, using heuristics (A* Algorithm)
- Find the minimum spanning tree of a graph (Prim's Algorithm)
- Detect cycles in a linked list (Floyd's Cycle Detection)
- Encode characters based on frequency for data compression (Huffman Encoding)
- Maximize value in a knapsack by allowing fractional items (Fractional Knapsack Problem)
- Count the number of vowels in a string
- Generate a pattern where characters are repeated in steps (Steps String Pattern)
- Create a centered pyramid pattern with strings (Pyramid String Pattern)
- Traverse a matrix in a spiral order (Spiral Matrix)
- Find the minimum spanning tree of a graph using edge weights (Kruskal's Algorithm)
- Find the maximum sum of any subarray (Kadane's Algorithm)
- Identify the most frequently occurring character in a string (Maximum Frequency Character)
- Transform the casing of strings to title case, where the first letter of each word is capitalized
- Use a hash map to find two numbers that add up to a target (Two Sum Problem)
- Implement a debounce function in JavaScript
- Implement a function to find all permutations of a string in JavaScript
- Implement a closure in JavaScript that maintains private state
- Check if a string is a palindrome
- Implement a function to deep clone an object
- Flatten a nested array
- Remove duplicates from an array in JavaScript
- Implement a memoize function in JavaScript
- Implement a function to get unique elements from an array
- Implement a function to deep compare two objects
- Implement a function to find the intersection of two arrays
- Implement a function to find all anagrams of a word within a list of words
- Implement prototype-based inheritance in JavaScript without using classes
- Implement a function to rotate an array to the right by `k` steps
- Implement a function to count the number of islands in a 2D grid
- Implement a function to find the longest consecutive sequence in an array
- Implement a function to find the first unique character in a string
- Implement a function to fetch data using Promises and async/await in JavaScript
- Implement a function to find the maximum depth of a binary tree
- Implement a function to serialize and deserialize a binary tree
- Implement a function to find the maximum product of three numbers in an array
- Implement a function to find the longest common prefix among an array of strings
- Implement a regular expression to validate email addresses in JavaScript
- Merge two sorted arrays in JavaScript
- Implement a function to find the longest substring with at most two distinct characters
- Find the most common integer in a list, returning the smallest in case of a tie in JavaScript
- Implement a function to flatten a deeply nested object in JavaScript
- Implement a function to check if a number is prime
- Reverse a singly linked list in JavaScript
- Calculate the factorial of a number using recursion in JavaScript
Estimated time: 40 hours