🚀 Executing

Just run npm start and the last challenge for the day will get executed. Follow the template on day 1.

Challenges

Starter Challenges

• 1. Find Index of nums which sum is the target
• 2. Give the max sum of consecutive nums in array
• 3. Move the 0's keeping the order of the rest of numbers
• 4. Return True if a value is repeated, if not False.
• 5. Rotate the Array k number of steps.
• 6. Return the longest word in the string.
• 7. Reverses a string.
• 8. Fizzbuzz.
• 9. Find the only number that doesn't repeat in the arr.
• 10. Given the root of a binary tree, return its maximum depth.
• 12. Given the head of a singly linked list, reverse the list, and return the reversed list.
• 13. Given the Excel Column Letter give the number.
• 14. Given an array nums of size n, return the majority element.
• 15. Given an roman number, transform it to decimal.
• 16. Calculate Max profit in stock market buying and Selling.
• 17. Check if 2 words are anagrams.
• 18. Return the idx of the first non repeated char in a string.
• 19. Transform an ordered array in a height-balanced binary search tree.
• 20. Return the missing number of an arr of consecutive nums.
• 21. Return the intersection of 2 Numerical Arrays.
• 22. Calculate the Max profit of revenue in stock market buying one single time.
• 24. Happy number.
• 25. Given an integer numRows, return the first numRows of Pascal's triangle.
• 27. Given the root of a binary tree, check whether it is a mirror of itself.
• 28. Given an integer array nums, find the subarray with the largest sum, and return its sum Like challenge 2.
• 29. Given an integer n, return true if it is a power of three. Otherwise, return false.
• 31. Max amount a robber can steal in not consecutive hauses.
• 32. Increment the large integer of an array by one and return the resulting array of digits.
• 33. Count-and-say sequence.
• 34. Given an integer array nums sorted in non-decreasing order, remove the duplicates in-place.
• 36. Determine if a string closes properly the brackets: '(', ')', '{', '}', '[' and ']'.
• 39. Merge nums1 and nums2 into a single numsay sorted in non-decreasing order.
• 40. Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.
• 41. Write a function to find the longest common prefix string amongst an array of strings.
• 42. Return the node at which two singly linked-lists intersect.
• 43. Return the index of the first occurrence of needle in haystack.
• 44. Return the square root of x rounded down to the nearest integer.
• 46. Return true if it is a palindrome.
• 47. Given an integer array nums, rotate the array to the right by k steps.
• 48. Return the number of prime numbers that are strictly less than n.
• 49. Given a signed 32-bit integer x, return x with its digits reversed.
• 50. Given the root of a binary tree, return the inorder traversal of its nodes' values.
• 52. Given a string s, find the length of the longest substring without repeating characters.
• 56. There's a staircase with N steps, and you can climb 1 or 2 steps at a time. Give the nuber of firrerent ways to climb.
• 57. Given intervals[i] = [starti, endi], merge all overlapping intervals.
• 58. Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.
• 60. Calcule if s can be segmented into a space-separated sequence of dictionary words.
• 62. Implement a stack data structure.
• 67. Implement a queue data structure.
• 72. Implement a function that merge 2 sorted arrays returning a sorted array.

Medium Challenges

• 23. Merge two sorted linked lists.
• 26. Different ways to clib the stairs.
• 30. Return the number of 1 bits of a ibinary number.
• 35. Given an integer n, return the number of trailing zeroes in n!.
• 37. Determine if a Linked list has a cycle in it.
• 38. Given the head of a singly linked list, return true if it is a palindrome.
• 45. Reverse bits of a given 32 bits unsigned integer.
• 51. Add the twho linked list numbers and return the sum as a linked list.
• 53. In an m x n 2D binary grid which represents a map of '1's (land) and '0's (water), return the number of islands.
• 54. Given a string s, return the longest palindromic substring in s.
• 55. Construct a deep copy of a linked list.
• 59. compute how much water it can trap after raining.

Hard Challenges

• 11. Given two integers a and b, return the sum of the two integers without using the operators + and -.
• 61. Write a function that implements the breadth-first search (BFS) algorithm on a directed graph.
• 63. Implement a function that performs an insertion sort.
• 64. Implement a function that performs binary search on an array of numbers.
• 65. Write a function that implements the depth-first search algorithm on a directed graph.
• 66. Implement a function that performs a heap sort.
• 68. Implement an EventEmitter class similar to the one in Node.js that follows such an observer pattern.
• 69. Implement a function that performs a recursive merge sort.
• 70. Implement a function that performs a recursive quick sort.
• 71. Implement a function that performs a topological sort on a directed graph.