├── Phase - 1(60 questions) ├── Day-1 │ ├── 1. Two Sum.cpp │ ├── 2. Container With Most Water.cpp │ ├── 3. Permutations.cpp │ ├── 4. Binary Tree Inorder Traversal.cpp │ └── 5. Generate Parentheses.cpp ├── Day-10 │ ├── 37. Subarray with given sum.cpp │ └── 38. Maximum Index.cpp ├── Day-11 │ ├── 39. B. GCD Length.cpp │ ├── 40. C. Yet Another Card Deck.cpp │ ├── 41. D. Min Cost String.cpp │ ├── 42. A. Red and Blue Beans.cpp │ └── 43. B. The Cake Is a Lie.cpp ├── Day-12 │ ├── 44. C. The Sports Festival.cpp │ ├── 45. Mussadi lal and stairs.cpp │ ├── 46. Intersection of Two Linked Lists.cpp │ └── 47. Average of Levels in Binary Tree.cpp ├── Day-13 │ ├── 48. Maximum Intervals Overlap.cpp │ └── 49. Shortest Prime Path.cpp ├── Day-14 │ ├── 50. BFS of graph.cpp │ └── 51. DFS of Graph.cpp ├── Day-15 │ ├── 52. Optimal Strategy For A Game.cpp │ └── 53. Increasing Path in Matrix.cpp ├── Day-16 │ ├── 54. Longest Increasing Path in a Matrix.cpp │ ├── 55. Delete Operation for Two Strings.cpp │ ├── 56. Jump Game II.cpp │ ├── 57. Non-decreasing Array.cpp │ └── 58. Running Sum of 1d Array.cpp ├── Day-17 │ ├── 59. Minimum Difference Between Largest and Smallest Value in Three Moves.cpp │ └── 60. Super Palindromes.cpp ├── Day-2 │ ├── 10. Kth Largest Element in an Array.cpp │ ├── 11. Palindrome Linked List.cpp │ ├── 6. Subsets.cpp │ ├── 7. Kth Smallest Element in a BST.cpp │ ├── 8. Top K Frequent Elements.cpp │ └── 9. Product of Array Except Self.cpp ├── Day-3 │ ├── 12. Remove loop in Linked List.cpp │ ├── 13. Non-decreasing Array.cpp │ └── 14. Count Primes.cpp ├── Day-4 │ ├── 15. Partition Equal Subset Sum.cpp │ ├── 16. Minimum Falling Path Sum.cpp │ ├── 17. Minimum Path Sum.cpp │ ├── 18. Longest Palindromic Substring.cpp │ ├── 19. Unique Paths.cpp │ └── 20. k-th Lexicographical String of All Happy Strings of Length n.cpp ├── Day-5 │ ├── 21. Partitioning Into Minimum Number Of Deci-Binary Numbers.cpp │ ├── 22. Find Center of Star Graph.cpp │ └── 23. 01 Matrix.cpp ├── Day-6 │ ├── 24. First Bad Version.cpp │ ├── 25. Jewels and Stones.cpp │ ├── 25. Ransom Note.cpp │ ├── 26. First Unique Character in a String.cpp │ └── 27. Number Complement.py ├── Day-7 │ ├── 29. Longest Increasing Subsequence.cpp │ └── 30. Maximum Sum Increasing Subsequence.cpp ├── Day-8 │ ├── 31. Longest Bitonic Subsequence.cpp │ ├── 32. Maximum Non-overlapping Bridges.cpp │ └── 33. Russian Doll Envelopes.cpp ├── Day-9 │ ├── 34. Round B 2021 - Kick Start-Increasing Substring.cpp │ ├── 35. Round B 2021 - Kick Start-Longest Progression.cpp │ └── 36. A. Review Site.cpp └── README.md ├── Phase - 2(60 questions) ├── Day-1 │ ├── 1. Permutations of a String.cpp │ ├── 2. Xor Equality.cpp │ └── 3. Remove K Digits.cpp ├── Day-10 │ ├── 24. Find All Duplicates in an Array.cpp │ ├── 25. Remove Duplicates from Sorted Array II.cpp │ ├── 26. Best Time to Buy and Sell Stock IV.cpp │ ├── 27. Longest Palindromic Substring.cpp │ └── 28. Longest Palindromic Subsequence.cpp ├── Day-11 │ ├── 29. Turn on the bulbs.cpp │ ├── 30. Edit Distance.cpp │ └── 31. Minimum Operations to Make Array Equal.cpp ├── Day-12 │ ├── 32. K-diff Pairs in an Array.cpp │ ├── 33. Majority Element.cpp │ ├── 34. Subarray Product Less Than K.cpp │ └── 35. Jump Game.cpp ├── Day-13 │ ├── 36. Jump Game III.cpp │ ├── 37. 0-1 Knapsack.cpp │ └── 38. Flip Array.cpp ├── Day-14 │ ├── 39. 3Sum.cpp │ ├── 40. Squares of a Sorted Array.cpp │ └── 41. Maximum Subarray.cpp ├── Day-15 │ ├── 42. Repeating Sub-Sequence.cpp │ ├── 43. Distinct Subsequences.cpp │ ├── 44. Scramble String.cpp │ └── 45. Tushar's Birthday Party.cpp ├── Day-16 │ ├── 46. Highest Product.cpp │ ├── 47. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts.cpp │ ├── 48. Rotate Image.cpp │ └── 49. Remove Covered Intervals.cpp ├── Day-17 │ ├── 50. Length of Longest Subsequence.cpp │ └── 51. Merge Intervals.cpp ├── Day-18 │ ├── 52. Search a 2D Matrix.cpp │ └── 53. Spiral Matrix.cpp ├── Day-19 │ ├── 54. Lowest Common Ancestor of a Binary Search Tree.cpp │ └── 55. Lowest Common Ancestor of a Binary Tree.cpp ├── Day-2 │ ├── 4. Kadane's Algorithm.cpp │ └── 5. Trie | (Insert and Search) .cpp ├── Day-20 │ ├── 56. Implement Trie (Prefix Tree).cpp │ ├── 57. Design Add and Search Words Data Structure.cpp │ └── 58. Min Cost Climbing Stairs.cpp ├── Day-21 │ ├── 59. Longest Word in Dictionary.cpp │ └── 60. Count Substrings That Differ by One Character.cpp ├── Day-3 │ ├── 6. Word Break.cpp │ ├── 7. Sort an array according to the other.cpp │ └── 8. Maximum XOR of Two Numbers in an Array.cpp ├── Day-4 │ ├── 10. Pow(x, n).cpp │ └── 9. Factorial Trailing Zeroes.cpp ├── Day-5 │ ├── 11. Reverse Words in a String.cpp │ └── 12. Longest Substring Without Repeating Characters.cpp ├── Day-6 │ ├── 13. Parenthesis Checker.cpp │ └── 14. Longest Valid Parentheses.cpp ├── Day-7 │ ├── 15. Countdown.cpp │ ├── 16. Decode String.cpp │ └── 17. Valid Anagram.cpp ├── Day-8 │ ├── 18. Repeated DNA Sequences.cpp │ ├── 19. Encoding Message .cpp │ └── 20. Asteroid Collision.cpp ├── Day-9 │ ├── 21. Best Time to Buy and Sell Stock II.cpp │ ├── 22. Jump Game II.cpp │ └── 23. Find All Numbers Disappeared in an Array.cpp └── README.md ├── Phase - 3(60 questions) ├── Day-1 │ ├── 1. Remove Islands.cpp │ ├── 2. N-Queens.cpp │ └── 3. Summation over all triplets.cpp ├── Day-10 │ ├── 30. Swap Nodes in Pairs.cpp │ ├── 31. Middle of the Linked List.cpp │ ├── 32. Linked List Cycle.cpp │ ├── 33. Palindrome Linked List.cpp │ └── 34. Maximum Score of a Good Subarray.cpp ├── Day-11 │ ├── 35. Redundant Connection.cpp │ ├── 36. Employee Importance.cpp │ └── 37. Find the Town Judge.cpp ├── Day-12 │ ├── 38. Split a String Into the Max Number of Unique Substrings.cpp │ ├── 39. C. Modified GDC.cpp │ ├── 40. Remove One Element to Make the Array Strictly Increasing.cpp │ ├── 41. Remove All Occurrences of a Substring.cpp │ └── 42. Maximum Alternating Subsequence Sum.cpp ├── Day-13 │ ├── 43. Minimum Remove to Make Valid Parentheses.cpp │ ├── 44. Cyclically Rotating a Grid.cpp │ ├── 45. Maximum Product Difference Between Two Pairs.cpp │ ├── 46. OOPS-classes.cpp │ └── 47. Trees: Is This a Binary Search Tree?.cpp ├── Day-14 │ ├── 48. Distinct Numbers in Window.cpp │ ├── 49. LRU Cache.cpp │ └── 50. N max pair combinations.cpp ├── Day-15 │ ├── 51. Collecting Coins Sequel.cpp │ ├── 52. Majority Vote.cpp │ ├── 53. Trailing Zeros.cpp │ ├── 54. Search for a Range.cpp │ ├── 55. First to Count to Target.cpp │ └── 56. Special Product List.cpp ├── Day-16 │ ├── 57. Largest Rectangle in Histogram.cpp │ ├── 58. Max Rectangle in Binary Matrix.cpp │ ├── 59. Largest square formed in a matrix.cpp │ └── 60. Maximal Rectangle.cpp ├── Day-2 │ ├── 4. Deletion Distance.cpp │ ├── 5. Time Planner.cpp │ └── 6. Flatten Binary Tree to Linked List.cpp ├── Day-3 │ ├── 10. D - Kth Excluded.cpp │ ├── 7. Shifted Array Search.cpp │ ├── 8. Add Two Numbers II.cpp │ └── 9. C - POW.cpp ├── Day-4 │ ├── 11. Grid Unique Paths.cpp │ ├── 12. Remove Duplicates from Sorted Array.cpp │ └── 13. Merge Two Sorted Lists II.cpp ├── Day-5 │ ├── 14. Odd Even Linked List.cpp │ ├── 15. Wildcard Matching.cpp │ └── 16. Rotate List.cpp ├── Day-6 │ ├── 17. All permutations.cpp │ ├── 18. All valid balanced parenthesis.cpp │ ├── 19. Average of Max Five Scores.cpp │ └── 20. Binary Sum.cpp ├── Day-7 │ ├── 21. Kth Smallest Element In Tree.cpp │ ├── 22. Two Sum II - Input array is sorted.cpp │ └── 23. 2-Sum Binary Tree.cpp ├── Day-8 │ ├── 24. Height of Binary Tree.cpp │ ├── 25. Count Leaves in Binary Tree.cpp │ └── 26. Mirror Tree.cpp ├── Day-9 │ ├── 27. Largest Odd Number in String.cpp │ ├── 28. The Number of Full Rounds You Have Played.cpp │ └── 29. Count Sub Islands.cpp └── README.md ├── Phase - 4(60 questions) ├── Day-01 │ ├── 1. D. Deleting Divisors.cpp │ ├── 2. Minimize elements to be added for Subsequence.cpp │ ├── 3. Count triplets smaller sum.cpp │ └── 4. Maximum sum increasing triplets.cpp ├── Day-02 │ ├── 5. Stone Game.cpp │ ├── 6. Subsets.cpp │ └── 7. Subsets II.cpp ├── Day-03 │ ├── 10. Count Good Numbers.cpp │ ├── 11. Sparse Arrays.cpp │ ├── 12. Maximum Subarray.cpp │ ├── 13. Climbing Stairs.cpp │ ├── 14. Divisor Game.cpp │ ├── 15. Stone Game II.cpp │ ├── 16. Counting Bits.cpp │ ├── 17. Decode Ways.cpp │ ├── 8. Build Array from Permutation.cpp │ └── 9. Eliminate Maximum Number of Monsters.cpp ├── Day-04 │ ├── 18. Divisible by 10.cpp │ ├── 19. Connected Components in a Graph.cpp │ └── 20. Is it a tree.cpp ├── Day-05 │ ├── 21. Clone Graph.cpp │ ├── 22. Job Scheduling - max number of jobs.cpp │ ├── 23. Peak Index in a Mountain Array.cpp │ ├── 24. Course Schedule.cpp │ ├── 25. Evaluate Division.cpp │ └── 26. Sqrt(x).cpp ├── Day-06 │ ├── 27. Symmetric Tree.cpp │ └── 28. Count Square Sum Triples.cpp ├── Day-07 │ ├── 29. Arithmetic Square.cpp │ ├── 30. Sliding Window Maximum.cpp │ ├── 31. Gas Station.cpp │ └── 32. Least Common Ancestor.cpp ├── Day-08 │ ├── 33. Median of Array.cpp │ ├── 34. House Robber III.cpp │ ├── 35. House Robber II.cpp │ ├── 36. Balanced Binary Tree.cpp │ └── 37. Container With Most Water.cpp ├── Day-09 │ ├── 38. Majority Element.cpp │ ├── 39. Rotated Sorted Array Search.cpp │ ├── 40. Repetitions.cpp │ ├── 41. Increasing Array.cpp │ ├── 42. Permutations.cpp │ ├── 43. Binary Tree Preorder Traversal.cpp │ ├── 44. Binary Tree Postorder Traversal.cpp │ ├── 45. Binary Tree Inorder Traversal.cpp │ ├── 46. Number Spiral.cpp │ └── 47. Two Knights.cpp ├── Day-10 │ ├── 48. Two Sets.cpp │ ├── 49. Bit Strings.cpp │ └── 50. Trailing Zeros.cpp ├── Day-11 │ ├── 51. Coin Piles.cpp │ └── 52. Palindrome Reorder.cpp ├── Day-12 │ ├── 53. Creating Strings.cpp │ └── 54. Apple Division.cpp ├── Day-13 │ ├── 55. Distinct Numbers.cpp │ ├── 56. Apartments.cpp │ ├── 57. Ferris Wheel.cpp │ ├── 58. Dice Combinations.cpp │ ├── 59. Book Shop.cpp │ └── 60. Course Schedule.cpp └── README.md ├── Phase - 5(60 questions) ├── Day-01 │ ├── 1. Sum of Digits of String After Convert.cpp │ ├── 2. Largest Number After Mutating Substring.cpp │ └── 3. Maximum Compatibility Score Sum.cpp ├── Day-02 │ ├── 10. A. Digits Sum.cpp │ ├── 4. RMQSQ - Range Minimum Query.cpp │ ├── 5. Help Ashu.cpp │ ├── 6. Multiples of 3.cpp │ ├── 7. A. Subsequence Permutation.cpp │ ├── 8. B. I Hate 1111.cpp │ └── 9. D. Buying Shovels.cpp ├── Day-03 │ ├── 11. C. Friends and Gifts.cpp │ ├── 12. B. Running for Gold.cpp │ ├── 13. A. Polycarp and Coins.cpp │ └── 14. Letter Combinations of a Phone Number.cpp ├── Day-04 │ ├── 15. Course Schedule II.cpp │ ├── 16. Number of Provinces.cpp │ ├── 17. Shortest Bridge.cpp │ ├── 18. All Paths From Source to Target.cpp │ ├── 19. Surrounded Regions.cpp │ ├── 20. Rotting Oranges.cpp │ └── 21. Word Ladder.cpp ├── Day-05 │ ├── 22. C. Boboniu and Bit Operations.cpp │ └── 23. Count primes using digits.cpp ├── Day-06 │ ├── 24. Next Greater Element I.cpp │ ├── 25. Next Greater Element II.cpp │ ├── 26. Nearest Smaller Element.cpp │ ├── 27. Stock span problem.cpp │ └── 28. Largest Rectangle in Histogram.cpp ├── Day-07 │ ├── 29. Maximal Rectangle.cpp │ ├── 30. Rain Water Trapped.cpp │ └── 31. Min Stack.cpp ├── Day-08 │ ├── 32. First non-repeating characters.cpp │ ├── 33. MAXSPPROD.cpp │ ├── 34. Simplify Path.cpp │ └── 35. Redundant Braces.cpp ├── Day-09 │ ├── 36. Reunion of 1's.cpp │ ├── 37. Minimum Cost of ropes.cpp │ ├── 38. D. Caesar's Legions.cpp │ ├── 39. Power of Two.cpp │ ├── 40. D. Flowers.cpp │ └── 41. C. Longest Regular Bracket Sequence.cpp ├── Day-10 │ ├── 42. E. Let's Go Rolling!.cpp │ ├── 43. Sum of Digits.cpp │ ├── 44. Digit Sum k.cpp │ └── 45. Digit Frequency k.cpp ├── Day-11 │ ├── 46. Olympics Ranking.cpp │ └── 47. Problem Difficulties.cpp ├── Day-12 │ ├── 48. Check If String Is a Prefix of Array.cpp │ └── 49. Remove Stones to Minimize the Total.cpp ├── Day-13 │ ├── 50. Set Matrix Zeroes.cpp │ ├── 51. Add Two Numbers.cpp │ ├── 52. Reverse Integer.cpp │ └── 53. String to Integer (atoi).cpp ├── Day-14 │ ├── 54. Deepest Leaves Sum.cpp │ ├── 55. Sum of Nodes with Even-Valued Grandparent.cpp │ ├── 56. Binary Search Tree to Greater Sum Tre.cpp │ ├── 57. Maximum Binary Tree.cpp │ ├── 58. Construct Binary Search Tree from Preorder Traversal.cpp │ ├── 59. All Elements in Two Binary Search Trees.cpp │ └── 60. Recover a Tree From Preorder Traversal.cpp └── README.md ├── Phase - 6(60 questions) ├── Day-01 │ ├── 1. Find Pivot Index.cpp │ ├── 2. Largest Number At Least Twice of Others.cpp │ └── 3. Plus One.cpp ├── Day-02 │ ├── 4. Longest Substring Without Repeat.cpp │ ├── 5. Square Root of Integer.cpp │ └── 6. First Index.cpp ├── Day-03 │ ├── 7. International Day of Yoga.cpp │ ├── 8. BUSYMAN - I AM VERY BUSY.cpp │ └── 9. Largest square formed in a matrix.cpp ├── Day-04 │ ├── 10. Maximum Nesting Depth of the Parentheses.cpp │ ├── 11. Remove Outermost Parentheses.cpp │ ├── 12. N-ary Tree Preorder Traversal.cpp │ ├── 13. N-ary Tree Postorder Traversal.cpp │ ├── 14. Increasing Order Search Tree.cpp │ ├── 15. Final Prices With a Special Discount in a Shop.cpp │ ├── 16. Remove All Adjacent Duplicates In String.cpp │ └── 17. Build an Array With Stack Operations.cpp ├── Day-05 │ ├── 18. Baseball Game.cpp │ ├── 19. The K Weakest Rows in a Matrix.cpp │ └── 20. Last Stone Weight.cpp ├── Day-06 │ ├── 21. Count Negative Numbers in a Sorted Matrix.cpp │ ├── 22. The K Weakest Rows in a Matrix.cpp │ ├── 23. Peak Index in a Mountain Array.cpp │ ├── 24. Intersection of Two Arrays.cpp │ ├── 25. Special Array With X Elements Greater Than or Equal X.cpp │ ├── 26. Fair Candy Swap.cpp │ ├── 27. Two Sum II - Input array is sorted.cpp │ ├── 28. Kth Missing Positive Number.cpp │ ├── 29. . Intersection of Two Arrays II.cpp │ └── 30. Guess Number Higher or Lower.cpp ├── Day-07 │ ├── 31. Range Sum of BST.cpp │ ├── 32. Merge Two Binary Trees.cpp │ ├── 33. Sum of Root To Leaf Binary Numbers.cpp │ ├── 34. Maximum Depth of N-ary Tree.cpp │ ├── 35. Maximum Depth of Binary Tree.cpp │ ├── 36. Invert Binary Tree.cpp │ ├── 37. Univalued Binary Tree.cpp │ ├── 38. Binary Tree Inorder Traversal.cpp │ └── 39. Average of Levels in Binary Tree.cpp ├── Day-08 │ ├── 40. Counting Bits.cpp │ ├── 41. Divisor Game.cpp │ ├── 42. Pascal's Triangle.cpp │ ├── 43. N-th Tribonacci Number.cpp │ ├── 44. Min Cost Climbing Stairs.cpp │ ├── 45. Pascal's Triangle II.cpp │ └── 46. Get Maximum in Generated Array.cpp ├── Day-09 │ ├── 47. Best Time to Buy and Sell Stock.cpp │ ├── 48. Best Time to Buy and Sell Stock II.cpp │ ├── 49. Flipping an Image.cpp │ └── 50. Sort Array By Parity.cpp ├── Day-10 │ ├── 51. Get Maximum in Generated Array.cpp │ ├── 52. Convert Binary Number in a Linked List to Integer.cpp │ ├── 53. Middle of the Linked List.cpp │ ├── 54. Delete Node in a Linked List.cpp │ ├── 55. Reverse Linked List.cpp │ ├── 56. Design HashSet.cpp │ ├── 57. Design HashMap.cpp │ ├── 58. Merge Two Sorted Lists.cpp │ ├── 59. Remove Duplicates from Sorted List.cpp │ └── 60. Intersection of Two Linked Lists.cpp └── README.md ├── Phase - 7(60 questions) ├── Day-01 │ ├── 1. Palindrome Linked List.cpp │ ├── 2. Remove Linked List Elements.cpp │ ├── 3. Merge In Between Linked Lists.cpp │ ├── 4. Design Browser History.cpp │ └── 5. Swapping Nodes in a Linked List.cpp ├── Day-02 │ ├── 10. Add Two Numbers II.cpp │ ├── 6. Next Greater Node In Linked List.cpp │ ├── 7. Odd Even Linked List.cpp │ ├── 8. Linked List Components.cpp │ └── 9. Flatten a Multilevel Doubly Linked List.cpp ├── Day-03 │ ├── 11. Leaf-Similar Trees.cpp │ ├── 12. Convert Sorted Array to Binary Search Tree.cpp │ ├── 13. Binary Tree Postorder Traversal.cpp │ ├── 14. Binary Tree Preorder Traversal.cpp │ ├── 15. Two Sum IV - Input is a BST.cpp │ ├── 16. Construct String from Binary Tree.cpp │ ├── 17. Binary Tree Paths.cpp │ └── 18. Minimum Absolute Difference in BST.cpp ├── Day-04 │ ├── 19. Global and Local Inversions.cpp │ ├── 20. How Many Numbers Are Smaller Than the Current Number.cpp │ ├── 21. Sorting the Sentence.cpp │ ├── 22. Maximum Product Difference Between Two Pairs.cpp │ ├── 23. Sort Array By Parity.cpp │ ├── 24. Height Checker.cpp │ ├── 25. Maximum Units on a Truck.cpp │ └── 26. The K Weakest Rows in a Matrix.cpp ├── Day-05 │ ├── 27. Carvans.cpp │ ├── 28. Count Substrings.cpp │ └── 29. Operations on Tree.cpp ├── Day-06 │ ├── 30. Lowest Common Ancestor of a Binary Search Tree.cpp │ ├── 31. Sum of Left Leaves.cpp │ ├── 32. Cousins in Binary Tree.cpp │ ├── 33. Kth Largest Element in a Stream.cpp │ ├── 34. Diameter of Binary Tree.cpp │ ├── 35. Symmetric Tree.cpp │ ├── 36. Balanced Binary Tree.cpp │ ├── 37. Subtree of Another Tree.cpp │ └── 38. Path Sum.cpp ├── Day-07 │ ├── 39. Swap Nodes in Pairs.cpp │ ├── 40. Flatten Binary Tree to Linked List.cpp │ └── 41. Partition List.cpp ├── Day-08 │ ├── 42. The k-th Lexicographical String of All Happy Strings of Length n.cpp │ ├── 43. Minimum Falling Path Sum.cpp │ ├── 44. Is Subsequence.cpp │ ├── 45. Climbing Stairs.cpp │ ├── 46. Maximum Subarray.cpp │ ├── 47. All Possible Full Binary Trees.cpp │ ├── 48. Count Sorted Vowel Strings.cpp │ ├── 49. Count Square Submatrices with All Ones.cpp │ └── 50. Count Substrings That Differ by One Character.cpp ├── Day-09 │ ├── 51. Count Number of Teams.cpp │ ├── 52. Sort Integers by The Power Value.cpp │ ├── 53. Number of Good Ways to Split a String.cpp │ ├── 54. Collecting Coins Sequel.cpp │ ├── 55. Special Product List.cpp │ ├── 56. Trailing Zeros.cpp │ ├── 57. Count Nodes in Complete Binary Tree.cpp │ ├── 58. Shortest Common Supersequence.cpp │ ├── 59. Count Substrings With All 1s.cpp │ └── 60. Partition String.cpp └── README.md └── README.md /Phase - 1(60 questions)/Day-1/1. Two Sum.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 1(60 questions)/Day-1/1. Two Sum.cpp -------------------------------------------------------------------------------- /Phase - 1(60 questions)/Day-1/2. Container With Most Water.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 1(60 questions)/Day-1/2. Container With Most Water.cpp -------------------------------------------------------------------------------- /Phase - 1(60 questions)/Day-1/3. Permutations.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 1(60 questions)/Day-1/3. Permutations.cpp -------------------------------------------------------------------------------- /Phase - 1(60 questions)/Day-1/4. Binary Tree Inorder Traversal.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 1(60 questions)/Day-1/4. Binary Tree Inorder Traversal.cpp -------------------------------------------------------------------------------- /Phase - 1(60 questions)/Day-1/5. Generate Parentheses.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 1(60 questions)/Day-1/5. Generate Parentheses.cpp -------------------------------------------------------------------------------- /Phase - 1(60 questions)/Day-10/37. Subarray with given sum.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 1(60 questions)/Day-10/37. Subarray with given sum.cpp -------------------------------------------------------------------------------- /Phase - 1(60 questions)/Day-10/38. Maximum Index.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 1(60 questions)/Day-10/38. Maximum Index.cpp -------------------------------------------------------------------------------- /Phase - 1(60 questions)/Day-11/39. B. GCD Length.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 1(60 questions)/Day-11/39. B. GCD Length.cpp -------------------------------------------------------------------------------- /Phase - 1(60 questions)/Day-11/40. C. Yet Another Card Deck.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 1(60 questions)/Day-11/40. C. Yet Another Card Deck.cpp -------------------------------------------------------------------------------- /Phase - 1(60 questions)/Day-11/41. D. Min Cost String.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 1(60 questions)/Day-11/41. D. Min Cost String.cpp -------------------------------------------------------------------------------- /Phase - 1(60 questions)/Day-11/42. A. Red and Blue Beans.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 1(60 questions)/Day-11/42. A. Red and Blue Beans.cpp -------------------------------------------------------------------------------- /Phase - 1(60 questions)/Day-11/43. B. The Cake Is a Lie.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 1(60 questions)/Day-11/43. B. The Cake Is a Lie.cpp -------------------------------------------------------------------------------- /Phase - 1(60 questions)/Day-12/44. C. The Sports Festival.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 1(60 questions)/Day-12/44. C. The Sports Festival.cpp -------------------------------------------------------------------------------- /Phase - 1(60 questions)/Day-12/45. Mussadi lal and stairs.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 1(60 questions)/Day-12/45. Mussadi lal and stairs.cpp -------------------------------------------------------------------------------- /Phase - 1(60 questions)/Day-12/46. Intersection of Two Linked Lists.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 1(60 questions)/Day-12/46. Intersection of Two Linked Lists.cpp -------------------------------------------------------------------------------- /Phase - 1(60 questions)/Day-12/47. Average of Levels in Binary Tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 1(60 questions)/Day-12/47. Average of Levels in Binary Tree.cpp -------------------------------------------------------------------------------- /Phase - 1(60 questions)/Day-13/48. Maximum Intervals Overlap.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 1(60 questions)/Day-13/48. Maximum Intervals Overlap.cpp -------------------------------------------------------------------------------- /Phase - 1(60 questions)/Day-13/49. Shortest Prime Path.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 1(60 questions)/Day-13/49. Shortest Prime Path.cpp -------------------------------------------------------------------------------- /Phase - 1(60 questions)/Day-14/50. BFS of graph.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 1(60 questions)/Day-14/50. BFS of graph.cpp -------------------------------------------------------------------------------- /Phase - 1(60 questions)/Day-14/51. DFS of Graph.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 1(60 questions)/Day-14/51. DFS of Graph.cpp -------------------------------------------------------------------------------- /Phase - 1(60 questions)/Day-15/52. Optimal Strategy For A Game.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 1(60 questions)/Day-15/52. Optimal Strategy For A Game.cpp -------------------------------------------------------------------------------- /Phase - 1(60 questions)/Day-15/53. Increasing Path in Matrix.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 1(60 questions)/Day-15/53. Increasing Path in Matrix.cpp -------------------------------------------------------------------------------- /Phase - 1(60 questions)/Day-16/54. Longest Increasing Path in a Matrix.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 1(60 questions)/Day-16/54. Longest Increasing Path in a Matrix.cpp -------------------------------------------------------------------------------- /Phase - 1(60 questions)/Day-16/55. Delete Operation for Two Strings.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 1(60 questions)/Day-16/55. Delete Operation for Two Strings.cpp -------------------------------------------------------------------------------- /Phase - 1(60 questions)/Day-16/56. Jump Game II.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 1(60 questions)/Day-16/56. Jump Game II.cpp -------------------------------------------------------------------------------- /Phase - 1(60 questions)/Day-16/57. Non-decreasing Array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 1(60 questions)/Day-16/57. Non-decreasing Array.cpp -------------------------------------------------------------------------------- /Phase - 1(60 questions)/Day-16/58. Running Sum of 1d Array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 1(60 questions)/Day-16/58. Running Sum of 1d Array.cpp -------------------------------------------------------------------------------- /Phase - 1(60 questions)/Day-17/59. Minimum Difference Between Largest and Smallest Value in Three Moves.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 1(60 questions)/Day-17/59. Minimum Difference Between Largest and Smallest Value in Three Moves.cpp -------------------------------------------------------------------------------- /Phase - 1(60 questions)/Day-17/60. Super Palindromes.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 1(60 questions)/Day-17/60. Super Palindromes.cpp -------------------------------------------------------------------------------- /Phase - 1(60 questions)/Day-2/10. Kth Largest Element in an Array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 1(60 questions)/Day-2/10. Kth Largest Element in an Array.cpp -------------------------------------------------------------------------------- /Phase - 1(60 questions)/Day-2/11. Palindrome Linked List.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 1(60 questions)/Day-2/11. Palindrome Linked List.cpp -------------------------------------------------------------------------------- /Phase - 1(60 questions)/Day-2/6. Subsets.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 1(60 questions)/Day-2/6. Subsets.cpp -------------------------------------------------------------------------------- /Phase - 1(60 questions)/Day-2/7. Kth Smallest Element in a BST.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 1(60 questions)/Day-2/7. Kth Smallest Element in a BST.cpp -------------------------------------------------------------------------------- /Phase - 1(60 questions)/Day-2/8. Top K Frequent Elements.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 1(60 questions)/Day-2/8. Top K Frequent Elements.cpp -------------------------------------------------------------------------------- /Phase - 1(60 questions)/Day-2/9. Product of Array Except Self.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 1(60 questions)/Day-2/9. Product of Array Except Self.cpp -------------------------------------------------------------------------------- /Phase - 1(60 questions)/Day-3/12. Remove loop in Linked List.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 1(60 questions)/Day-3/12. Remove loop in Linked List.cpp -------------------------------------------------------------------------------- /Phase - 1(60 questions)/Day-3/13. Non-decreasing Array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 1(60 questions)/Day-3/13. Non-decreasing Array.cpp -------------------------------------------------------------------------------- /Phase - 1(60 questions)/Day-3/14. Count Primes.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 1(60 questions)/Day-3/14. Count Primes.cpp -------------------------------------------------------------------------------- /Phase - 1(60 questions)/Day-4/15. Partition Equal Subset Sum.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 1(60 questions)/Day-4/15. Partition Equal Subset Sum.cpp -------------------------------------------------------------------------------- /Phase - 1(60 questions)/Day-4/16. Minimum Falling Path Sum.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 1(60 questions)/Day-4/16. Minimum Falling Path Sum.cpp -------------------------------------------------------------------------------- /Phase - 1(60 questions)/Day-4/17. Minimum Path Sum.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 1(60 questions)/Day-4/17. Minimum Path Sum.cpp -------------------------------------------------------------------------------- /Phase - 1(60 questions)/Day-4/18. Longest Palindromic Substring.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 1(60 questions)/Day-4/18. Longest Palindromic Substring.cpp -------------------------------------------------------------------------------- /Phase - 1(60 questions)/Day-4/19. Unique Paths.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 1(60 questions)/Day-4/19. Unique Paths.cpp -------------------------------------------------------------------------------- /Phase - 1(60 questions)/Day-4/20. k-th Lexicographical String of All Happy Strings of Length n.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 1(60 questions)/Day-4/20. k-th Lexicographical String of All Happy Strings of Length n.cpp -------------------------------------------------------------------------------- /Phase - 1(60 questions)/Day-5/21. Partitioning Into Minimum Number Of Deci-Binary Numbers.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 1(60 questions)/Day-5/21. Partitioning Into Minimum Number Of Deci-Binary Numbers.cpp -------------------------------------------------------------------------------- /Phase - 1(60 questions)/Day-5/22. Find Center of Star Graph.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 1(60 questions)/Day-5/22. Find Center of Star Graph.cpp -------------------------------------------------------------------------------- /Phase - 1(60 questions)/Day-5/23. 01 Matrix.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 1(60 questions)/Day-5/23. 01 Matrix.cpp -------------------------------------------------------------------------------- /Phase - 1(60 questions)/Day-6/24. First Bad Version.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 1(60 questions)/Day-6/24. First Bad Version.cpp -------------------------------------------------------------------------------- /Phase - 1(60 questions)/Day-6/25. Jewels and Stones.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 1(60 questions)/Day-6/25. Jewels and Stones.cpp -------------------------------------------------------------------------------- /Phase - 1(60 questions)/Day-6/25. Ransom Note.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 1(60 questions)/Day-6/25. Ransom Note.cpp -------------------------------------------------------------------------------- /Phase - 1(60 questions)/Day-6/26. First Unique Character in a String.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 1(60 questions)/Day-6/26. First Unique Character in a String.cpp -------------------------------------------------------------------------------- /Phase - 1(60 questions)/Day-6/27. Number Complement.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 1(60 questions)/Day-6/27. Number Complement.py -------------------------------------------------------------------------------- /Phase - 1(60 questions)/Day-7/29. Longest Increasing Subsequence.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 1(60 questions)/Day-7/29. Longest Increasing Subsequence.cpp -------------------------------------------------------------------------------- /Phase - 1(60 questions)/Day-7/30. Maximum Sum Increasing Subsequence.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 1(60 questions)/Day-7/30. Maximum Sum Increasing Subsequence.cpp -------------------------------------------------------------------------------- /Phase - 1(60 questions)/Day-8/31. Longest Bitonic Subsequence.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 1(60 questions)/Day-8/31. Longest Bitonic Subsequence.cpp -------------------------------------------------------------------------------- /Phase - 1(60 questions)/Day-8/32. Maximum Non-overlapping Bridges.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 1(60 questions)/Day-8/32. Maximum Non-overlapping Bridges.cpp -------------------------------------------------------------------------------- /Phase - 1(60 questions)/Day-8/33. Russian Doll Envelopes.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 1(60 questions)/Day-8/33. Russian Doll Envelopes.cpp -------------------------------------------------------------------------------- /Phase - 1(60 questions)/Day-9/34. Round B 2021 - Kick Start-Increasing Substring.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 1(60 questions)/Day-9/34. Round B 2021 - Kick Start-Increasing Substring.cpp -------------------------------------------------------------------------------- /Phase - 1(60 questions)/Day-9/35. Round B 2021 - Kick Start-Longest Progression.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 1(60 questions)/Day-9/35. Round B 2021 - Kick Start-Longest Progression.cpp -------------------------------------------------------------------------------- /Phase - 1(60 questions)/Day-9/36. A. Review Site.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 1(60 questions)/Day-9/36. A. Review Site.cpp -------------------------------------------------------------------------------- /Phase - 1(60 questions)/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 1(60 questions)/README.md -------------------------------------------------------------------------------- /Phase - 2(60 questions)/Day-1/1. Permutations of a String.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 2(60 questions)/Day-1/1. Permutations of a String.cpp -------------------------------------------------------------------------------- /Phase - 2(60 questions)/Day-1/2. Xor Equality.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 2(60 questions)/Day-1/2. Xor Equality.cpp -------------------------------------------------------------------------------- /Phase - 2(60 questions)/Day-1/3. Remove K Digits.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 2(60 questions)/Day-1/3. Remove K Digits.cpp -------------------------------------------------------------------------------- /Phase - 2(60 questions)/Day-10/24. Find All Duplicates in an Array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 2(60 questions)/Day-10/24. Find All Duplicates in an Array.cpp -------------------------------------------------------------------------------- /Phase - 2(60 questions)/Day-10/25. Remove Duplicates from Sorted Array II.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 2(60 questions)/Day-10/25. Remove Duplicates from Sorted Array II.cpp -------------------------------------------------------------------------------- /Phase - 2(60 questions)/Day-10/26. Best Time to Buy and Sell Stock IV.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 2(60 questions)/Day-10/26. Best Time to Buy and Sell Stock IV.cpp -------------------------------------------------------------------------------- /Phase - 2(60 questions)/Day-10/27. Longest Palindromic Substring.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 2(60 questions)/Day-10/27. Longest Palindromic Substring.cpp -------------------------------------------------------------------------------- /Phase - 2(60 questions)/Day-10/28. Longest Palindromic Subsequence.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 2(60 questions)/Day-10/28. Longest Palindromic Subsequence.cpp -------------------------------------------------------------------------------- /Phase - 2(60 questions)/Day-11/29. Turn on the bulbs.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 2(60 questions)/Day-11/29. Turn on the bulbs.cpp -------------------------------------------------------------------------------- /Phase - 2(60 questions)/Day-11/30. Edit Distance.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 2(60 questions)/Day-11/30. Edit Distance.cpp -------------------------------------------------------------------------------- /Phase - 2(60 questions)/Day-11/31. Minimum Operations to Make Array Equal.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 2(60 questions)/Day-11/31. Minimum Operations to Make Array Equal.cpp -------------------------------------------------------------------------------- /Phase - 2(60 questions)/Day-12/32. K-diff Pairs in an Array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 2(60 questions)/Day-12/32. K-diff Pairs in an Array.cpp -------------------------------------------------------------------------------- /Phase - 2(60 questions)/Day-12/33. Majority Element.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 2(60 questions)/Day-12/33. Majority Element.cpp -------------------------------------------------------------------------------- /Phase - 2(60 questions)/Day-12/34. Subarray Product Less Than K.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 2(60 questions)/Day-12/34. Subarray Product Less Than K.cpp -------------------------------------------------------------------------------- /Phase - 2(60 questions)/Day-12/35. Jump Game.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 2(60 questions)/Day-12/35. Jump Game.cpp -------------------------------------------------------------------------------- /Phase - 2(60 questions)/Day-13/36. Jump Game III.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 2(60 questions)/Day-13/36. Jump Game III.cpp -------------------------------------------------------------------------------- /Phase - 2(60 questions)/Day-13/37. 0-1 Knapsack.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 2(60 questions)/Day-13/37. 0-1 Knapsack.cpp -------------------------------------------------------------------------------- /Phase - 2(60 questions)/Day-13/38. Flip Array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 2(60 questions)/Day-13/38. Flip Array.cpp -------------------------------------------------------------------------------- /Phase - 2(60 questions)/Day-14/39. 3Sum.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 2(60 questions)/Day-14/39. 3Sum.cpp -------------------------------------------------------------------------------- /Phase - 2(60 questions)/Day-14/40. Squares of a Sorted Array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 2(60 questions)/Day-14/40. Squares of a Sorted Array.cpp -------------------------------------------------------------------------------- /Phase - 2(60 questions)/Day-14/41. Maximum Subarray.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 2(60 questions)/Day-14/41. Maximum Subarray.cpp -------------------------------------------------------------------------------- /Phase - 2(60 questions)/Day-15/42. Repeating Sub-Sequence.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 2(60 questions)/Day-15/42. Repeating Sub-Sequence.cpp -------------------------------------------------------------------------------- /Phase - 2(60 questions)/Day-15/43. Distinct Subsequences.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 2(60 questions)/Day-15/43. Distinct Subsequences.cpp -------------------------------------------------------------------------------- /Phase - 2(60 questions)/Day-15/44. Scramble String.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 2(60 questions)/Day-15/44. Scramble String.cpp -------------------------------------------------------------------------------- /Phase - 2(60 questions)/Day-15/45. Tushar's Birthday Party.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 2(60 questions)/Day-15/45. Tushar's Birthday Party.cpp -------------------------------------------------------------------------------- /Phase - 2(60 questions)/Day-16/46. Highest Product.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 2(60 questions)/Day-16/46. Highest Product.cpp -------------------------------------------------------------------------------- /Phase - 2(60 questions)/Day-16/47. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 2(60 questions)/Day-16/47. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts.cpp -------------------------------------------------------------------------------- /Phase - 2(60 questions)/Day-16/48. Rotate Image.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 2(60 questions)/Day-16/48. Rotate Image.cpp -------------------------------------------------------------------------------- /Phase - 2(60 questions)/Day-16/49. Remove Covered Intervals.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 2(60 questions)/Day-16/49. Remove Covered Intervals.cpp -------------------------------------------------------------------------------- /Phase - 2(60 questions)/Day-17/50. Length of Longest Subsequence.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 2(60 questions)/Day-17/50. Length of Longest Subsequence.cpp -------------------------------------------------------------------------------- /Phase - 2(60 questions)/Day-17/51. Merge Intervals.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 2(60 questions)/Day-17/51. Merge Intervals.cpp -------------------------------------------------------------------------------- /Phase - 2(60 questions)/Day-18/52. Search a 2D Matrix.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 2(60 questions)/Day-18/52. Search a 2D Matrix.cpp -------------------------------------------------------------------------------- /Phase - 2(60 questions)/Day-18/53. Spiral Matrix.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 2(60 questions)/Day-18/53. Spiral Matrix.cpp -------------------------------------------------------------------------------- /Phase - 2(60 questions)/Day-19/54. Lowest Common Ancestor of a Binary Search Tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 2(60 questions)/Day-19/54. Lowest Common Ancestor of a Binary Search Tree.cpp -------------------------------------------------------------------------------- /Phase - 2(60 questions)/Day-19/55. Lowest Common Ancestor of a Binary Tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 2(60 questions)/Day-19/55. Lowest Common Ancestor of a Binary Tree.cpp -------------------------------------------------------------------------------- /Phase - 2(60 questions)/Day-2/4. Kadane's Algorithm.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 2(60 questions)/Day-2/4. Kadane's Algorithm.cpp -------------------------------------------------------------------------------- /Phase - 2(60 questions)/Day-2/5. Trie | (Insert and Search) .cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 2(60 questions)/Day-2/5. Trie | (Insert and Search) .cpp -------------------------------------------------------------------------------- /Phase - 2(60 questions)/Day-20/56. Implement Trie (Prefix Tree).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 2(60 questions)/Day-20/56. Implement Trie (Prefix Tree).cpp -------------------------------------------------------------------------------- /Phase - 2(60 questions)/Day-20/57. Design Add and Search Words Data Structure.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 2(60 questions)/Day-20/57. Design Add and Search Words Data Structure.cpp -------------------------------------------------------------------------------- /Phase - 2(60 questions)/Day-20/58. Min Cost Climbing Stairs.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 2(60 questions)/Day-20/58. Min Cost Climbing Stairs.cpp -------------------------------------------------------------------------------- /Phase - 2(60 questions)/Day-21/59. Longest Word in Dictionary.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 2(60 questions)/Day-21/59. Longest Word in Dictionary.cpp -------------------------------------------------------------------------------- /Phase - 2(60 questions)/Day-21/60. Count Substrings That Differ by One Character.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 2(60 questions)/Day-21/60. Count Substrings That Differ by One Character.cpp -------------------------------------------------------------------------------- /Phase - 2(60 questions)/Day-3/6. Word Break.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 2(60 questions)/Day-3/6. Word Break.cpp -------------------------------------------------------------------------------- /Phase - 2(60 questions)/Day-3/7. Sort an array according to the other.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 2(60 questions)/Day-3/7. Sort an array according to the other.cpp -------------------------------------------------------------------------------- /Phase - 2(60 questions)/Day-3/8. Maximum XOR of Two Numbers in an Array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 2(60 questions)/Day-3/8. Maximum XOR of Two Numbers in an Array.cpp -------------------------------------------------------------------------------- /Phase - 2(60 questions)/Day-4/10. Pow(x, n).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 2(60 questions)/Day-4/10. Pow(x, n).cpp -------------------------------------------------------------------------------- /Phase - 2(60 questions)/Day-4/9. Factorial Trailing Zeroes.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 2(60 questions)/Day-4/9. Factorial Trailing Zeroes.cpp -------------------------------------------------------------------------------- /Phase - 2(60 questions)/Day-5/11. Reverse Words in a String.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 2(60 questions)/Day-5/11. Reverse Words in a String.cpp -------------------------------------------------------------------------------- /Phase - 2(60 questions)/Day-5/12. Longest Substring Without Repeating Characters.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 2(60 questions)/Day-5/12. Longest Substring Without Repeating Characters.cpp -------------------------------------------------------------------------------- /Phase - 2(60 questions)/Day-6/13. Parenthesis Checker.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 2(60 questions)/Day-6/13. Parenthesis Checker.cpp -------------------------------------------------------------------------------- /Phase - 2(60 questions)/Day-6/14. Longest Valid Parentheses.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 2(60 questions)/Day-6/14. Longest Valid Parentheses.cpp -------------------------------------------------------------------------------- /Phase - 2(60 questions)/Day-7/15. Countdown.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 2(60 questions)/Day-7/15. Countdown.cpp -------------------------------------------------------------------------------- /Phase - 2(60 questions)/Day-7/16. Decode String.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 2(60 questions)/Day-7/16. Decode String.cpp -------------------------------------------------------------------------------- /Phase - 2(60 questions)/Day-7/17. Valid Anagram.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 2(60 questions)/Day-7/17. Valid Anagram.cpp -------------------------------------------------------------------------------- /Phase - 2(60 questions)/Day-8/18. Repeated DNA Sequences.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 2(60 questions)/Day-8/18. Repeated DNA Sequences.cpp -------------------------------------------------------------------------------- /Phase - 2(60 questions)/Day-8/19. Encoding Message .cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 2(60 questions)/Day-8/19. Encoding Message .cpp -------------------------------------------------------------------------------- /Phase - 2(60 questions)/Day-8/20. Asteroid Collision.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 2(60 questions)/Day-8/20. Asteroid Collision.cpp -------------------------------------------------------------------------------- /Phase - 2(60 questions)/Day-9/21. Best Time to Buy and Sell Stock II.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 2(60 questions)/Day-9/21. Best Time to Buy and Sell Stock II.cpp -------------------------------------------------------------------------------- /Phase - 2(60 questions)/Day-9/22. Jump Game II.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 2(60 questions)/Day-9/22. Jump Game II.cpp -------------------------------------------------------------------------------- /Phase - 2(60 questions)/Day-9/23. Find All Numbers Disappeared in an Array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 2(60 questions)/Day-9/23. Find All Numbers Disappeared in an Array.cpp -------------------------------------------------------------------------------- /Phase - 2(60 questions)/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 2(60 questions)/README.md -------------------------------------------------------------------------------- /Phase - 3(60 questions)/Day-1/1. Remove Islands.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 3(60 questions)/Day-1/1. Remove Islands.cpp -------------------------------------------------------------------------------- /Phase - 3(60 questions)/Day-1/2. N-Queens.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 3(60 questions)/Day-1/2. N-Queens.cpp -------------------------------------------------------------------------------- /Phase - 3(60 questions)/Day-1/3. Summation over all triplets.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 3(60 questions)/Day-1/3. Summation over all triplets.cpp -------------------------------------------------------------------------------- /Phase - 3(60 questions)/Day-10/30. Swap Nodes in Pairs.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 3(60 questions)/Day-10/30. Swap Nodes in Pairs.cpp -------------------------------------------------------------------------------- /Phase - 3(60 questions)/Day-10/31. Middle of the Linked List.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 3(60 questions)/Day-10/31. Middle of the Linked List.cpp -------------------------------------------------------------------------------- /Phase - 3(60 questions)/Day-10/32. Linked List Cycle.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 3(60 questions)/Day-10/32. Linked List Cycle.cpp -------------------------------------------------------------------------------- /Phase - 3(60 questions)/Day-10/33. Palindrome Linked List.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 3(60 questions)/Day-10/33. Palindrome Linked List.cpp -------------------------------------------------------------------------------- /Phase - 3(60 questions)/Day-10/34. Maximum Score of a Good Subarray.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 3(60 questions)/Day-10/34. Maximum Score of a Good Subarray.cpp -------------------------------------------------------------------------------- /Phase - 3(60 questions)/Day-11/35. Redundant Connection.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 3(60 questions)/Day-11/35. Redundant Connection.cpp -------------------------------------------------------------------------------- /Phase - 3(60 questions)/Day-11/36. Employee Importance.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 3(60 questions)/Day-11/36. Employee Importance.cpp -------------------------------------------------------------------------------- /Phase - 3(60 questions)/Day-11/37. Find the Town Judge.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 3(60 questions)/Day-11/37. Find the Town Judge.cpp -------------------------------------------------------------------------------- /Phase - 3(60 questions)/Day-12/38. Split a String Into the Max Number of Unique Substrings.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 3(60 questions)/Day-12/38. Split a String Into the Max Number of Unique Substrings.cpp -------------------------------------------------------------------------------- /Phase - 3(60 questions)/Day-12/39. C. Modified GDC.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 3(60 questions)/Day-12/39. C. Modified GDC.cpp -------------------------------------------------------------------------------- /Phase - 3(60 questions)/Day-12/40. Remove One Element to Make the Array Strictly Increasing.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 3(60 questions)/Day-12/40. Remove One Element to Make the Array Strictly Increasing.cpp -------------------------------------------------------------------------------- /Phase - 3(60 questions)/Day-12/41. Remove All Occurrences of a Substring.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 3(60 questions)/Day-12/41. Remove All Occurrences of a Substring.cpp -------------------------------------------------------------------------------- /Phase - 3(60 questions)/Day-12/42. Maximum Alternating Subsequence Sum.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 3(60 questions)/Day-12/42. Maximum Alternating Subsequence Sum.cpp -------------------------------------------------------------------------------- /Phase - 3(60 questions)/Day-13/43. Minimum Remove to Make Valid Parentheses.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 3(60 questions)/Day-13/43. Minimum Remove to Make Valid Parentheses.cpp -------------------------------------------------------------------------------- /Phase - 3(60 questions)/Day-13/44. Cyclically Rotating a Grid.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 3(60 questions)/Day-13/44. Cyclically Rotating a Grid.cpp -------------------------------------------------------------------------------- /Phase - 3(60 questions)/Day-13/45. Maximum Product Difference Between Two Pairs.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 3(60 questions)/Day-13/45. Maximum Product Difference Between Two Pairs.cpp -------------------------------------------------------------------------------- /Phase - 3(60 questions)/Day-13/46. OOPS-classes.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 3(60 questions)/Day-13/46. OOPS-classes.cpp -------------------------------------------------------------------------------- /Phase - 3(60 questions)/Day-13/47. Trees: Is This a Binary Search Tree?.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 3(60 questions)/Day-13/47. Trees: Is This a Binary Search Tree?.cpp -------------------------------------------------------------------------------- /Phase - 3(60 questions)/Day-14/48. Distinct Numbers in Window.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 3(60 questions)/Day-14/48. Distinct Numbers in Window.cpp -------------------------------------------------------------------------------- /Phase - 3(60 questions)/Day-14/49. LRU Cache.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 3(60 questions)/Day-14/49. LRU Cache.cpp -------------------------------------------------------------------------------- /Phase - 3(60 questions)/Day-14/50. N max pair combinations.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 3(60 questions)/Day-14/50. N max pair combinations.cpp -------------------------------------------------------------------------------- /Phase - 3(60 questions)/Day-15/51. Collecting Coins Sequel.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 3(60 questions)/Day-15/51. Collecting Coins Sequel.cpp -------------------------------------------------------------------------------- /Phase - 3(60 questions)/Day-15/52. Majority Vote.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 3(60 questions)/Day-15/52. Majority Vote.cpp -------------------------------------------------------------------------------- /Phase - 3(60 questions)/Day-15/53. Trailing Zeros.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 3(60 questions)/Day-15/53. Trailing Zeros.cpp -------------------------------------------------------------------------------- /Phase - 3(60 questions)/Day-15/54. Search for a Range.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 3(60 questions)/Day-15/54. Search for a Range.cpp -------------------------------------------------------------------------------- /Phase - 3(60 questions)/Day-15/55. First to Count to Target.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 3(60 questions)/Day-15/55. First to Count to Target.cpp -------------------------------------------------------------------------------- /Phase - 3(60 questions)/Day-15/56. Special Product List.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 3(60 questions)/Day-15/56. Special Product List.cpp -------------------------------------------------------------------------------- /Phase - 3(60 questions)/Day-16/57. Largest Rectangle in Histogram.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 3(60 questions)/Day-16/57. Largest Rectangle in Histogram.cpp -------------------------------------------------------------------------------- /Phase - 3(60 questions)/Day-16/58. Max Rectangle in Binary Matrix.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 3(60 questions)/Day-16/58. Max Rectangle in Binary Matrix.cpp -------------------------------------------------------------------------------- /Phase - 3(60 questions)/Day-16/59. Largest square formed in a matrix.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 3(60 questions)/Day-16/59. Largest square formed in a matrix.cpp -------------------------------------------------------------------------------- /Phase - 3(60 questions)/Day-16/60. Maximal Rectangle.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 3(60 questions)/Day-16/60. Maximal Rectangle.cpp -------------------------------------------------------------------------------- /Phase - 3(60 questions)/Day-2/4. Deletion Distance.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 3(60 questions)/Day-2/4. Deletion Distance.cpp -------------------------------------------------------------------------------- /Phase - 3(60 questions)/Day-2/5. Time Planner.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 3(60 questions)/Day-2/5. Time Planner.cpp -------------------------------------------------------------------------------- /Phase - 3(60 questions)/Day-2/6. Flatten Binary Tree to Linked List.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 3(60 questions)/Day-2/6. Flatten Binary Tree to Linked List.cpp -------------------------------------------------------------------------------- /Phase - 3(60 questions)/Day-3/10. D - Kth Excluded.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 3(60 questions)/Day-3/10. D - Kth Excluded.cpp -------------------------------------------------------------------------------- /Phase - 3(60 questions)/Day-3/7. Shifted Array Search.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 3(60 questions)/Day-3/7. Shifted Array Search.cpp -------------------------------------------------------------------------------- /Phase - 3(60 questions)/Day-3/8. Add Two Numbers II.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 3(60 questions)/Day-3/8. Add Two Numbers II.cpp -------------------------------------------------------------------------------- /Phase - 3(60 questions)/Day-3/9. C - POW.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 3(60 questions)/Day-3/9. C - POW.cpp -------------------------------------------------------------------------------- /Phase - 3(60 questions)/Day-4/11. Grid Unique Paths.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 3(60 questions)/Day-4/11. Grid Unique Paths.cpp -------------------------------------------------------------------------------- /Phase - 3(60 questions)/Day-4/12. Remove Duplicates from Sorted Array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 3(60 questions)/Day-4/12. Remove Duplicates from Sorted Array.cpp -------------------------------------------------------------------------------- /Phase - 3(60 questions)/Day-4/13. Merge Two Sorted Lists II.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 3(60 questions)/Day-4/13. Merge Two Sorted Lists II.cpp -------------------------------------------------------------------------------- /Phase - 3(60 questions)/Day-5/14. Odd Even Linked List.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 3(60 questions)/Day-5/14. Odd Even Linked List.cpp -------------------------------------------------------------------------------- /Phase - 3(60 questions)/Day-5/15. Wildcard Matching.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 3(60 questions)/Day-5/15. Wildcard Matching.cpp -------------------------------------------------------------------------------- /Phase - 3(60 questions)/Day-5/16. Rotate List.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 3(60 questions)/Day-5/16. Rotate List.cpp -------------------------------------------------------------------------------- /Phase - 3(60 questions)/Day-6/17. All permutations.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 3(60 questions)/Day-6/17. All permutations.cpp -------------------------------------------------------------------------------- /Phase - 3(60 questions)/Day-6/18. All valid balanced parenthesis.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 3(60 questions)/Day-6/18. All valid balanced parenthesis.cpp -------------------------------------------------------------------------------- /Phase - 3(60 questions)/Day-6/19. Average of Max Five Scores.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 3(60 questions)/Day-6/19. Average of Max Five Scores.cpp -------------------------------------------------------------------------------- /Phase - 3(60 questions)/Day-6/20. Binary Sum.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 3(60 questions)/Day-6/20. Binary Sum.cpp -------------------------------------------------------------------------------- /Phase - 3(60 questions)/Day-7/21. Kth Smallest Element In Tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 3(60 questions)/Day-7/21. Kth Smallest Element In Tree.cpp -------------------------------------------------------------------------------- /Phase - 3(60 questions)/Day-7/22. Two Sum II - Input array is sorted.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 3(60 questions)/Day-7/22. Two Sum II - Input array is sorted.cpp -------------------------------------------------------------------------------- /Phase - 3(60 questions)/Day-7/23. 2-Sum Binary Tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 3(60 questions)/Day-7/23. 2-Sum Binary Tree.cpp -------------------------------------------------------------------------------- /Phase - 3(60 questions)/Day-8/24. Height of Binary Tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 3(60 questions)/Day-8/24. Height of Binary Tree.cpp -------------------------------------------------------------------------------- /Phase - 3(60 questions)/Day-8/25. Count Leaves in Binary Tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 3(60 questions)/Day-8/25. Count Leaves in Binary Tree.cpp -------------------------------------------------------------------------------- /Phase - 3(60 questions)/Day-8/26. Mirror Tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 3(60 questions)/Day-8/26. Mirror Tree.cpp -------------------------------------------------------------------------------- /Phase - 3(60 questions)/Day-9/27. Largest Odd Number in String.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 3(60 questions)/Day-9/27. Largest Odd Number in String.cpp -------------------------------------------------------------------------------- /Phase - 3(60 questions)/Day-9/28. The Number of Full Rounds You Have Played.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 3(60 questions)/Day-9/28. The Number of Full Rounds You Have Played.cpp -------------------------------------------------------------------------------- /Phase - 3(60 questions)/Day-9/29. Count Sub Islands.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 3(60 questions)/Day-9/29. Count Sub Islands.cpp -------------------------------------------------------------------------------- /Phase - 3(60 questions)/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 3(60 questions)/README.md -------------------------------------------------------------------------------- /Phase - 4(60 questions)/Day-01/1. D. Deleting Divisors.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 4(60 questions)/Day-01/1. D. Deleting Divisors.cpp -------------------------------------------------------------------------------- /Phase - 4(60 questions)/Day-01/2. Minimize elements to be added for Subsequence.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 4(60 questions)/Day-01/2. Minimize elements to be added for Subsequence.cpp -------------------------------------------------------------------------------- /Phase - 4(60 questions)/Day-01/3. Count triplets smaller sum.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 4(60 questions)/Day-01/3. Count triplets smaller sum.cpp -------------------------------------------------------------------------------- /Phase - 4(60 questions)/Day-01/4. Maximum sum increasing triplets.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 4(60 questions)/Day-01/4. Maximum sum increasing triplets.cpp -------------------------------------------------------------------------------- /Phase - 4(60 questions)/Day-02/5. Stone Game.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 4(60 questions)/Day-02/5. Stone Game.cpp -------------------------------------------------------------------------------- /Phase - 4(60 questions)/Day-02/6. Subsets.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 4(60 questions)/Day-02/6. Subsets.cpp -------------------------------------------------------------------------------- /Phase - 4(60 questions)/Day-02/7. Subsets II.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 4(60 questions)/Day-02/7. Subsets II.cpp -------------------------------------------------------------------------------- /Phase - 4(60 questions)/Day-03/10. Count Good Numbers.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 4(60 questions)/Day-03/10. Count Good Numbers.cpp -------------------------------------------------------------------------------- /Phase - 4(60 questions)/Day-03/11. Sparse Arrays.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 4(60 questions)/Day-03/11. Sparse Arrays.cpp -------------------------------------------------------------------------------- /Phase - 4(60 questions)/Day-03/12. Maximum Subarray.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 4(60 questions)/Day-03/12. Maximum Subarray.cpp -------------------------------------------------------------------------------- /Phase - 4(60 questions)/Day-03/13. Climbing Stairs.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 4(60 questions)/Day-03/13. Climbing Stairs.cpp -------------------------------------------------------------------------------- /Phase - 4(60 questions)/Day-03/14. Divisor Game.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 4(60 questions)/Day-03/14. Divisor Game.cpp -------------------------------------------------------------------------------- /Phase - 4(60 questions)/Day-03/15. Stone Game II.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 4(60 questions)/Day-03/15. Stone Game II.cpp -------------------------------------------------------------------------------- /Phase - 4(60 questions)/Day-03/16. Counting Bits.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 4(60 questions)/Day-03/16. Counting Bits.cpp -------------------------------------------------------------------------------- /Phase - 4(60 questions)/Day-03/17. Decode Ways.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 4(60 questions)/Day-03/17. Decode Ways.cpp -------------------------------------------------------------------------------- /Phase - 4(60 questions)/Day-03/8. Build Array from Permutation.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 4(60 questions)/Day-03/8. Build Array from Permutation.cpp -------------------------------------------------------------------------------- /Phase - 4(60 questions)/Day-03/9. Eliminate Maximum Number of Monsters.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 4(60 questions)/Day-03/9. Eliminate Maximum Number of Monsters.cpp -------------------------------------------------------------------------------- /Phase - 4(60 questions)/Day-04/18. Divisible by 10.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 4(60 questions)/Day-04/18. Divisible by 10.cpp -------------------------------------------------------------------------------- /Phase - 4(60 questions)/Day-04/19. Connected Components in a Graph.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 4(60 questions)/Day-04/19. Connected Components in a Graph.cpp -------------------------------------------------------------------------------- /Phase - 4(60 questions)/Day-04/20. Is it a tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 4(60 questions)/Day-04/20. Is it a tree.cpp -------------------------------------------------------------------------------- /Phase - 4(60 questions)/Day-05/21. Clone Graph.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 4(60 questions)/Day-05/21. Clone Graph.cpp -------------------------------------------------------------------------------- /Phase - 4(60 questions)/Day-05/22. Job Scheduling - max number of jobs.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 4(60 questions)/Day-05/22. Job Scheduling - max number of jobs.cpp -------------------------------------------------------------------------------- /Phase - 4(60 questions)/Day-05/23. Peak Index in a Mountain Array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 4(60 questions)/Day-05/23. Peak Index in a Mountain Array.cpp -------------------------------------------------------------------------------- /Phase - 4(60 questions)/Day-05/24. Course Schedule.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 4(60 questions)/Day-05/24. Course Schedule.cpp -------------------------------------------------------------------------------- /Phase - 4(60 questions)/Day-05/25. Evaluate Division.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 4(60 questions)/Day-05/25. Evaluate Division.cpp -------------------------------------------------------------------------------- /Phase - 4(60 questions)/Day-05/26. Sqrt(x).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 4(60 questions)/Day-05/26. Sqrt(x).cpp -------------------------------------------------------------------------------- /Phase - 4(60 questions)/Day-06/27. Symmetric Tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 4(60 questions)/Day-06/27. Symmetric Tree.cpp -------------------------------------------------------------------------------- /Phase - 4(60 questions)/Day-06/28. Count Square Sum Triples.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 4(60 questions)/Day-06/28. Count Square Sum Triples.cpp -------------------------------------------------------------------------------- /Phase - 4(60 questions)/Day-07/29. Arithmetic Square.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 4(60 questions)/Day-07/29. Arithmetic Square.cpp -------------------------------------------------------------------------------- /Phase - 4(60 questions)/Day-07/30. Sliding Window Maximum.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 4(60 questions)/Day-07/30. Sliding Window Maximum.cpp -------------------------------------------------------------------------------- /Phase - 4(60 questions)/Day-07/31. Gas Station.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 4(60 questions)/Day-07/31. Gas Station.cpp -------------------------------------------------------------------------------- /Phase - 4(60 questions)/Day-07/32. Least Common Ancestor.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 4(60 questions)/Day-07/32. Least Common Ancestor.cpp -------------------------------------------------------------------------------- /Phase - 4(60 questions)/Day-08/33. Median of Array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 4(60 questions)/Day-08/33. Median of Array.cpp -------------------------------------------------------------------------------- /Phase - 4(60 questions)/Day-08/34. House Robber III.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 4(60 questions)/Day-08/34. House Robber III.cpp -------------------------------------------------------------------------------- /Phase - 4(60 questions)/Day-08/35. House Robber II.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 4(60 questions)/Day-08/35. House Robber II.cpp -------------------------------------------------------------------------------- /Phase - 4(60 questions)/Day-08/36. Balanced Binary Tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 4(60 questions)/Day-08/36. Balanced Binary Tree.cpp -------------------------------------------------------------------------------- /Phase - 4(60 questions)/Day-08/37. Container With Most Water.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 4(60 questions)/Day-08/37. Container With Most Water.cpp -------------------------------------------------------------------------------- /Phase - 4(60 questions)/Day-09/38. Majority Element.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 4(60 questions)/Day-09/38. Majority Element.cpp -------------------------------------------------------------------------------- /Phase - 4(60 questions)/Day-09/39. Rotated Sorted Array Search.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 4(60 questions)/Day-09/39. Rotated Sorted Array Search.cpp -------------------------------------------------------------------------------- /Phase - 4(60 questions)/Day-09/40. Repetitions.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 4(60 questions)/Day-09/40. Repetitions.cpp -------------------------------------------------------------------------------- /Phase - 4(60 questions)/Day-09/41. Increasing Array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 4(60 questions)/Day-09/41. Increasing Array.cpp -------------------------------------------------------------------------------- /Phase - 4(60 questions)/Day-09/42. Permutations.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 4(60 questions)/Day-09/42. Permutations.cpp -------------------------------------------------------------------------------- /Phase - 4(60 questions)/Day-09/43. Binary Tree Preorder Traversal.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 4(60 questions)/Day-09/43. Binary Tree Preorder Traversal.cpp -------------------------------------------------------------------------------- /Phase - 4(60 questions)/Day-09/44. Binary Tree Postorder Traversal.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 4(60 questions)/Day-09/44. Binary Tree Postorder Traversal.cpp -------------------------------------------------------------------------------- /Phase - 4(60 questions)/Day-09/45. Binary Tree Inorder Traversal.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 4(60 questions)/Day-09/45. Binary Tree Inorder Traversal.cpp -------------------------------------------------------------------------------- /Phase - 4(60 questions)/Day-09/46. Number Spiral.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 4(60 questions)/Day-09/46. Number Spiral.cpp -------------------------------------------------------------------------------- /Phase - 4(60 questions)/Day-09/47. Two Knights.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 4(60 questions)/Day-09/47. Two Knights.cpp -------------------------------------------------------------------------------- /Phase - 4(60 questions)/Day-10/48. Two Sets.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 4(60 questions)/Day-10/48. Two Sets.cpp -------------------------------------------------------------------------------- /Phase - 4(60 questions)/Day-10/49. Bit Strings.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 4(60 questions)/Day-10/49. Bit Strings.cpp -------------------------------------------------------------------------------- /Phase - 4(60 questions)/Day-10/50. Trailing Zeros.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 4(60 questions)/Day-10/50. Trailing Zeros.cpp -------------------------------------------------------------------------------- /Phase - 4(60 questions)/Day-11/51. Coin Piles.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 4(60 questions)/Day-11/51. Coin Piles.cpp -------------------------------------------------------------------------------- /Phase - 4(60 questions)/Day-11/52. Palindrome Reorder.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 4(60 questions)/Day-11/52. Palindrome Reorder.cpp -------------------------------------------------------------------------------- /Phase - 4(60 questions)/Day-12/53. Creating Strings.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 4(60 questions)/Day-12/53. Creating Strings.cpp -------------------------------------------------------------------------------- /Phase - 4(60 questions)/Day-12/54. Apple Division.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 4(60 questions)/Day-12/54. Apple Division.cpp -------------------------------------------------------------------------------- /Phase - 4(60 questions)/Day-13/55. Distinct Numbers.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 4(60 questions)/Day-13/55. Distinct Numbers.cpp -------------------------------------------------------------------------------- /Phase - 4(60 questions)/Day-13/56. Apartments.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 4(60 questions)/Day-13/56. Apartments.cpp -------------------------------------------------------------------------------- /Phase - 4(60 questions)/Day-13/57. Ferris Wheel.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 4(60 questions)/Day-13/57. Ferris Wheel.cpp -------------------------------------------------------------------------------- /Phase - 4(60 questions)/Day-13/58. Dice Combinations.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 4(60 questions)/Day-13/58. Dice Combinations.cpp -------------------------------------------------------------------------------- /Phase - 4(60 questions)/Day-13/59. Book Shop.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 4(60 questions)/Day-13/59. Book Shop.cpp -------------------------------------------------------------------------------- /Phase - 4(60 questions)/Day-13/60. Course Schedule.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 4(60 questions)/Day-13/60. Course Schedule.cpp -------------------------------------------------------------------------------- /Phase - 4(60 questions)/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 4(60 questions)/README.md -------------------------------------------------------------------------------- /Phase - 5(60 questions)/Day-01/1. Sum of Digits of String After Convert.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 5(60 questions)/Day-01/1. Sum of Digits of String After Convert.cpp -------------------------------------------------------------------------------- /Phase - 5(60 questions)/Day-01/2. Largest Number After Mutating Substring.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 5(60 questions)/Day-01/2. Largest Number After Mutating Substring.cpp -------------------------------------------------------------------------------- /Phase - 5(60 questions)/Day-01/3. Maximum Compatibility Score Sum.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 5(60 questions)/Day-01/3. Maximum Compatibility Score Sum.cpp -------------------------------------------------------------------------------- /Phase - 5(60 questions)/Day-02/10. A. Digits Sum.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 5(60 questions)/Day-02/10. A. Digits Sum.cpp -------------------------------------------------------------------------------- /Phase - 5(60 questions)/Day-02/4. RMQSQ - Range Minimum Query.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 5(60 questions)/Day-02/4. RMQSQ - Range Minimum Query.cpp -------------------------------------------------------------------------------- /Phase - 5(60 questions)/Day-02/5. Help Ashu.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 5(60 questions)/Day-02/5. Help Ashu.cpp -------------------------------------------------------------------------------- /Phase - 5(60 questions)/Day-02/6. Multiples of 3.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 5(60 questions)/Day-02/6. Multiples of 3.cpp -------------------------------------------------------------------------------- /Phase - 5(60 questions)/Day-02/7. A. Subsequence Permutation.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 5(60 questions)/Day-02/7. A. Subsequence Permutation.cpp -------------------------------------------------------------------------------- /Phase - 5(60 questions)/Day-02/8. B. I Hate 1111.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 5(60 questions)/Day-02/8. B. I Hate 1111.cpp -------------------------------------------------------------------------------- /Phase - 5(60 questions)/Day-02/9. D. Buying Shovels.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 5(60 questions)/Day-02/9. D. Buying Shovels.cpp -------------------------------------------------------------------------------- /Phase - 5(60 questions)/Day-03/11. C. Friends and Gifts.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 5(60 questions)/Day-03/11. C. Friends and Gifts.cpp -------------------------------------------------------------------------------- /Phase - 5(60 questions)/Day-03/12. B. Running for Gold.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 5(60 questions)/Day-03/12. B. Running for Gold.cpp -------------------------------------------------------------------------------- /Phase - 5(60 questions)/Day-03/13. A. Polycarp and Coins.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 5(60 questions)/Day-03/13. A. Polycarp and Coins.cpp -------------------------------------------------------------------------------- /Phase - 5(60 questions)/Day-03/14. Letter Combinations of a Phone Number.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 5(60 questions)/Day-03/14. Letter Combinations of a Phone Number.cpp -------------------------------------------------------------------------------- /Phase - 5(60 questions)/Day-04/15. Course Schedule II.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 5(60 questions)/Day-04/15. Course Schedule II.cpp -------------------------------------------------------------------------------- /Phase - 5(60 questions)/Day-04/16. Number of Provinces.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 5(60 questions)/Day-04/16. Number of Provinces.cpp -------------------------------------------------------------------------------- /Phase - 5(60 questions)/Day-04/17. Shortest Bridge.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 5(60 questions)/Day-04/17. Shortest Bridge.cpp -------------------------------------------------------------------------------- /Phase - 5(60 questions)/Day-04/18. All Paths From Source to Target.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 5(60 questions)/Day-04/18. All Paths From Source to Target.cpp -------------------------------------------------------------------------------- /Phase - 5(60 questions)/Day-04/19. Surrounded Regions.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 5(60 questions)/Day-04/19. Surrounded Regions.cpp -------------------------------------------------------------------------------- /Phase - 5(60 questions)/Day-04/20. Rotting Oranges.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 5(60 questions)/Day-04/20. Rotting Oranges.cpp -------------------------------------------------------------------------------- /Phase - 5(60 questions)/Day-04/21. Word Ladder.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 5(60 questions)/Day-04/21. Word Ladder.cpp -------------------------------------------------------------------------------- /Phase - 5(60 questions)/Day-05/22. C. Boboniu and Bit Operations.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 5(60 questions)/Day-05/22. C. Boboniu and Bit Operations.cpp -------------------------------------------------------------------------------- /Phase - 5(60 questions)/Day-05/23. Count primes using digits.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 5(60 questions)/Day-05/23. Count primes using digits.cpp -------------------------------------------------------------------------------- /Phase - 5(60 questions)/Day-06/24. Next Greater Element I.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 5(60 questions)/Day-06/24. Next Greater Element I.cpp -------------------------------------------------------------------------------- /Phase - 5(60 questions)/Day-06/25. Next Greater Element II.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 5(60 questions)/Day-06/25. Next Greater Element II.cpp -------------------------------------------------------------------------------- /Phase - 5(60 questions)/Day-06/26. Nearest Smaller Element.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 5(60 questions)/Day-06/26. Nearest Smaller Element.cpp -------------------------------------------------------------------------------- /Phase - 5(60 questions)/Day-06/27. Stock span problem.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 5(60 questions)/Day-06/27. Stock span problem.cpp -------------------------------------------------------------------------------- /Phase - 5(60 questions)/Day-06/28. Largest Rectangle in Histogram.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 5(60 questions)/Day-06/28. Largest Rectangle in Histogram.cpp -------------------------------------------------------------------------------- /Phase - 5(60 questions)/Day-07/29. Maximal Rectangle.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 5(60 questions)/Day-07/29. Maximal Rectangle.cpp -------------------------------------------------------------------------------- /Phase - 5(60 questions)/Day-07/30. Rain Water Trapped.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 5(60 questions)/Day-07/30. Rain Water Trapped.cpp -------------------------------------------------------------------------------- /Phase - 5(60 questions)/Day-07/31. Min Stack.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 5(60 questions)/Day-07/31. Min Stack.cpp -------------------------------------------------------------------------------- /Phase - 5(60 questions)/Day-08/32. First non-repeating characters.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 5(60 questions)/Day-08/32. First non-repeating characters.cpp -------------------------------------------------------------------------------- /Phase - 5(60 questions)/Day-08/33. MAXSPPROD.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 5(60 questions)/Day-08/33. MAXSPPROD.cpp -------------------------------------------------------------------------------- /Phase - 5(60 questions)/Day-08/34. Simplify Path.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 5(60 questions)/Day-08/34. Simplify Path.cpp -------------------------------------------------------------------------------- /Phase - 5(60 questions)/Day-08/35. Redundant Braces.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 5(60 questions)/Day-08/35. Redundant Braces.cpp -------------------------------------------------------------------------------- /Phase - 5(60 questions)/Day-09/36. Reunion of 1's.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 5(60 questions)/Day-09/36. Reunion of 1's.cpp -------------------------------------------------------------------------------- /Phase - 5(60 questions)/Day-09/37. Minimum Cost of ropes.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 5(60 questions)/Day-09/37. Minimum Cost of ropes.cpp -------------------------------------------------------------------------------- /Phase - 5(60 questions)/Day-09/38. D. Caesar's Legions.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 5(60 questions)/Day-09/38. D. Caesar's Legions.cpp -------------------------------------------------------------------------------- /Phase - 5(60 questions)/Day-09/39. Power of Two.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 5(60 questions)/Day-09/39. Power of Two.cpp -------------------------------------------------------------------------------- /Phase - 5(60 questions)/Day-09/40. D. Flowers.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 5(60 questions)/Day-09/40. D. Flowers.cpp -------------------------------------------------------------------------------- /Phase - 5(60 questions)/Day-09/41. C. Longest Regular Bracket Sequence.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 5(60 questions)/Day-09/41. C. Longest Regular Bracket Sequence.cpp -------------------------------------------------------------------------------- /Phase - 5(60 questions)/Day-10/42. E. Let's Go Rolling!.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 5(60 questions)/Day-10/42. E. Let's Go Rolling!.cpp -------------------------------------------------------------------------------- /Phase - 5(60 questions)/Day-10/43. Sum of Digits.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 5(60 questions)/Day-10/43. Sum of Digits.cpp -------------------------------------------------------------------------------- /Phase - 5(60 questions)/Day-10/44. Digit Sum k.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 5(60 questions)/Day-10/44. Digit Sum k.cpp -------------------------------------------------------------------------------- /Phase - 5(60 questions)/Day-10/45. Digit Frequency k.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 5(60 questions)/Day-10/45. Digit Frequency k.cpp -------------------------------------------------------------------------------- /Phase - 5(60 questions)/Day-11/46. Olympics Ranking.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 5(60 questions)/Day-11/46. Olympics Ranking.cpp -------------------------------------------------------------------------------- /Phase - 5(60 questions)/Day-11/47. Problem Difficulties.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 5(60 questions)/Day-11/47. Problem Difficulties.cpp -------------------------------------------------------------------------------- /Phase - 5(60 questions)/Day-12/48. Check If String Is a Prefix of Array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 5(60 questions)/Day-12/48. Check If String Is a Prefix of Array.cpp -------------------------------------------------------------------------------- /Phase - 5(60 questions)/Day-12/49. Remove Stones to Minimize the Total.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 5(60 questions)/Day-12/49. Remove Stones to Minimize the Total.cpp -------------------------------------------------------------------------------- /Phase - 5(60 questions)/Day-13/50. Set Matrix Zeroes.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 5(60 questions)/Day-13/50. Set Matrix Zeroes.cpp -------------------------------------------------------------------------------- /Phase - 5(60 questions)/Day-13/51. Add Two Numbers.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 5(60 questions)/Day-13/51. Add Two Numbers.cpp -------------------------------------------------------------------------------- /Phase - 5(60 questions)/Day-13/52. Reverse Integer.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 5(60 questions)/Day-13/52. Reverse Integer.cpp -------------------------------------------------------------------------------- /Phase - 5(60 questions)/Day-13/53. String to Integer (atoi).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 5(60 questions)/Day-13/53. String to Integer (atoi).cpp -------------------------------------------------------------------------------- /Phase - 5(60 questions)/Day-14/54. Deepest Leaves Sum.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 5(60 questions)/Day-14/54. Deepest Leaves Sum.cpp -------------------------------------------------------------------------------- /Phase - 5(60 questions)/Day-14/55. Sum of Nodes with Even-Valued Grandparent.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 5(60 questions)/Day-14/55. Sum of Nodes with Even-Valued Grandparent.cpp -------------------------------------------------------------------------------- /Phase - 5(60 questions)/Day-14/56. Binary Search Tree to Greater Sum Tre.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 5(60 questions)/Day-14/56. Binary Search Tree to Greater Sum Tre.cpp -------------------------------------------------------------------------------- /Phase - 5(60 questions)/Day-14/57. Maximum Binary Tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 5(60 questions)/Day-14/57. Maximum Binary Tree.cpp -------------------------------------------------------------------------------- /Phase - 5(60 questions)/Day-14/58. Construct Binary Search Tree from Preorder Traversal.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 5(60 questions)/Day-14/58. Construct Binary Search Tree from Preorder Traversal.cpp -------------------------------------------------------------------------------- /Phase - 5(60 questions)/Day-14/59. All Elements in Two Binary Search Trees.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 5(60 questions)/Day-14/59. All Elements in Two Binary Search Trees.cpp -------------------------------------------------------------------------------- /Phase - 5(60 questions)/Day-14/60. Recover a Tree From Preorder Traversal.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 5(60 questions)/Day-14/60. Recover a Tree From Preorder Traversal.cpp -------------------------------------------------------------------------------- /Phase - 5(60 questions)/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 5(60 questions)/README.md -------------------------------------------------------------------------------- /Phase - 6(60 questions)/Day-01/1. Find Pivot Index.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 6(60 questions)/Day-01/1. Find Pivot Index.cpp -------------------------------------------------------------------------------- /Phase - 6(60 questions)/Day-01/2. Largest Number At Least Twice of Others.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 6(60 questions)/Day-01/2. Largest Number At Least Twice of Others.cpp -------------------------------------------------------------------------------- /Phase - 6(60 questions)/Day-01/3. Plus One.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 6(60 questions)/Day-01/3. Plus One.cpp -------------------------------------------------------------------------------- /Phase - 6(60 questions)/Day-02/4. Longest Substring Without Repeat.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 6(60 questions)/Day-02/4. Longest Substring Without Repeat.cpp -------------------------------------------------------------------------------- /Phase - 6(60 questions)/Day-02/5. Square Root of Integer.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 6(60 questions)/Day-02/5. Square Root of Integer.cpp -------------------------------------------------------------------------------- /Phase - 6(60 questions)/Day-02/6. First Index.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 6(60 questions)/Day-02/6. First Index.cpp -------------------------------------------------------------------------------- /Phase - 6(60 questions)/Day-03/7. International Day of Yoga.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 6(60 questions)/Day-03/7. International Day of Yoga.cpp -------------------------------------------------------------------------------- /Phase - 6(60 questions)/Day-03/8. BUSYMAN - I AM VERY BUSY.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 6(60 questions)/Day-03/8. BUSYMAN - I AM VERY BUSY.cpp -------------------------------------------------------------------------------- /Phase - 6(60 questions)/Day-03/9. Largest square formed in a matrix.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 6(60 questions)/Day-03/9. Largest square formed in a matrix.cpp -------------------------------------------------------------------------------- /Phase - 6(60 questions)/Day-04/10. Maximum Nesting Depth of the Parentheses.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 6(60 questions)/Day-04/10. Maximum Nesting Depth of the Parentheses.cpp -------------------------------------------------------------------------------- /Phase - 6(60 questions)/Day-04/11. Remove Outermost Parentheses.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 6(60 questions)/Day-04/11. Remove Outermost Parentheses.cpp -------------------------------------------------------------------------------- /Phase - 6(60 questions)/Day-04/12. N-ary Tree Preorder Traversal.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 6(60 questions)/Day-04/12. N-ary Tree Preorder Traversal.cpp -------------------------------------------------------------------------------- /Phase - 6(60 questions)/Day-04/13. N-ary Tree Postorder Traversal.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 6(60 questions)/Day-04/13. N-ary Tree Postorder Traversal.cpp -------------------------------------------------------------------------------- /Phase - 6(60 questions)/Day-04/14. Increasing Order Search Tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 6(60 questions)/Day-04/14. Increasing Order Search Tree.cpp -------------------------------------------------------------------------------- /Phase - 6(60 questions)/Day-04/15. Final Prices With a Special Discount in a Shop.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 6(60 questions)/Day-04/15. Final Prices With a Special Discount in a Shop.cpp -------------------------------------------------------------------------------- /Phase - 6(60 questions)/Day-04/16. Remove All Adjacent Duplicates In String.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 6(60 questions)/Day-04/16. Remove All Adjacent Duplicates In String.cpp -------------------------------------------------------------------------------- /Phase - 6(60 questions)/Day-04/17. Build an Array With Stack Operations.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 6(60 questions)/Day-04/17. Build an Array With Stack Operations.cpp -------------------------------------------------------------------------------- /Phase - 6(60 questions)/Day-05/18. Baseball Game.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 6(60 questions)/Day-05/18. Baseball Game.cpp -------------------------------------------------------------------------------- /Phase - 6(60 questions)/Day-05/19. The K Weakest Rows in a Matrix.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 6(60 questions)/Day-05/19. The K Weakest Rows in a Matrix.cpp -------------------------------------------------------------------------------- /Phase - 6(60 questions)/Day-05/20. Last Stone Weight.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 6(60 questions)/Day-05/20. Last Stone Weight.cpp -------------------------------------------------------------------------------- /Phase - 6(60 questions)/Day-06/21. Count Negative Numbers in a Sorted Matrix.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 6(60 questions)/Day-06/21. Count Negative Numbers in a Sorted Matrix.cpp -------------------------------------------------------------------------------- /Phase - 6(60 questions)/Day-06/22. The K Weakest Rows in a Matrix.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 6(60 questions)/Day-06/22. The K Weakest Rows in a Matrix.cpp -------------------------------------------------------------------------------- /Phase - 6(60 questions)/Day-06/23. Peak Index in a Mountain Array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 6(60 questions)/Day-06/23. Peak Index in a Mountain Array.cpp -------------------------------------------------------------------------------- /Phase - 6(60 questions)/Day-06/24. Intersection of Two Arrays.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 6(60 questions)/Day-06/24. Intersection of Two Arrays.cpp -------------------------------------------------------------------------------- /Phase - 6(60 questions)/Day-06/25. Special Array With X Elements Greater Than or Equal X.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 6(60 questions)/Day-06/25. Special Array With X Elements Greater Than or Equal X.cpp -------------------------------------------------------------------------------- /Phase - 6(60 questions)/Day-06/26. Fair Candy Swap.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 6(60 questions)/Day-06/26. Fair Candy Swap.cpp -------------------------------------------------------------------------------- /Phase - 6(60 questions)/Day-06/27. Two Sum II - Input array is sorted.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 6(60 questions)/Day-06/27. Two Sum II - Input array is sorted.cpp -------------------------------------------------------------------------------- /Phase - 6(60 questions)/Day-06/28. Kth Missing Positive Number.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 6(60 questions)/Day-06/28. Kth Missing Positive Number.cpp -------------------------------------------------------------------------------- /Phase - 6(60 questions)/Day-06/29. . Intersection of Two Arrays II.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 6(60 questions)/Day-06/29. . Intersection of Two Arrays II.cpp -------------------------------------------------------------------------------- /Phase - 6(60 questions)/Day-06/30. Guess Number Higher or Lower.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 6(60 questions)/Day-06/30. Guess Number Higher or Lower.cpp -------------------------------------------------------------------------------- /Phase - 6(60 questions)/Day-07/31. Range Sum of BST.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 6(60 questions)/Day-07/31. Range Sum of BST.cpp -------------------------------------------------------------------------------- /Phase - 6(60 questions)/Day-07/32. Merge Two Binary Trees.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 6(60 questions)/Day-07/32. Merge Two Binary Trees.cpp -------------------------------------------------------------------------------- /Phase - 6(60 questions)/Day-07/33. Sum of Root To Leaf Binary Numbers.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 6(60 questions)/Day-07/33. Sum of Root To Leaf Binary Numbers.cpp -------------------------------------------------------------------------------- /Phase - 6(60 questions)/Day-07/34. Maximum Depth of N-ary Tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 6(60 questions)/Day-07/34. Maximum Depth of N-ary Tree.cpp -------------------------------------------------------------------------------- /Phase - 6(60 questions)/Day-07/35. Maximum Depth of Binary Tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 6(60 questions)/Day-07/35. Maximum Depth of Binary Tree.cpp -------------------------------------------------------------------------------- /Phase - 6(60 questions)/Day-07/36. Invert Binary Tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 6(60 questions)/Day-07/36. Invert Binary Tree.cpp -------------------------------------------------------------------------------- /Phase - 6(60 questions)/Day-07/37. Univalued Binary Tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 6(60 questions)/Day-07/37. Univalued Binary Tree.cpp -------------------------------------------------------------------------------- /Phase - 6(60 questions)/Day-07/38. Binary Tree Inorder Traversal.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 6(60 questions)/Day-07/38. Binary Tree Inorder Traversal.cpp -------------------------------------------------------------------------------- /Phase - 6(60 questions)/Day-07/39. Average of Levels in Binary Tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 6(60 questions)/Day-07/39. Average of Levels in Binary Tree.cpp -------------------------------------------------------------------------------- /Phase - 6(60 questions)/Day-08/40. Counting Bits.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 6(60 questions)/Day-08/40. Counting Bits.cpp -------------------------------------------------------------------------------- /Phase - 6(60 questions)/Day-08/41. Divisor Game.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 6(60 questions)/Day-08/41. Divisor Game.cpp -------------------------------------------------------------------------------- /Phase - 6(60 questions)/Day-08/42. Pascal's Triangle.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 6(60 questions)/Day-08/42. Pascal's Triangle.cpp -------------------------------------------------------------------------------- /Phase - 6(60 questions)/Day-08/43. N-th Tribonacci Number.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 6(60 questions)/Day-08/43. N-th Tribonacci Number.cpp -------------------------------------------------------------------------------- /Phase - 6(60 questions)/Day-08/44. Min Cost Climbing Stairs.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 6(60 questions)/Day-08/44. Min Cost Climbing Stairs.cpp -------------------------------------------------------------------------------- /Phase - 6(60 questions)/Day-08/45. Pascal's Triangle II.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 6(60 questions)/Day-08/45. Pascal's Triangle II.cpp -------------------------------------------------------------------------------- /Phase - 6(60 questions)/Day-08/46. Get Maximum in Generated Array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 6(60 questions)/Day-08/46. Get Maximum in Generated Array.cpp -------------------------------------------------------------------------------- /Phase - 6(60 questions)/Day-09/47. Best Time to Buy and Sell Stock.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 6(60 questions)/Day-09/47. Best Time to Buy and Sell Stock.cpp -------------------------------------------------------------------------------- /Phase - 6(60 questions)/Day-09/48. Best Time to Buy and Sell Stock II.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 6(60 questions)/Day-09/48. Best Time to Buy and Sell Stock II.cpp -------------------------------------------------------------------------------- /Phase - 6(60 questions)/Day-09/49. Flipping an Image.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 6(60 questions)/Day-09/49. Flipping an Image.cpp -------------------------------------------------------------------------------- /Phase - 6(60 questions)/Day-09/50. Sort Array By Parity.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 6(60 questions)/Day-09/50. Sort Array By Parity.cpp -------------------------------------------------------------------------------- /Phase - 6(60 questions)/Day-10/51. Get Maximum in Generated Array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 6(60 questions)/Day-10/51. Get Maximum in Generated Array.cpp -------------------------------------------------------------------------------- /Phase - 6(60 questions)/Day-10/52. Convert Binary Number in a Linked List to Integer.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 6(60 questions)/Day-10/52. Convert Binary Number in a Linked List to Integer.cpp -------------------------------------------------------------------------------- /Phase - 6(60 questions)/Day-10/53. Middle of the Linked List.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 6(60 questions)/Day-10/53. Middle of the Linked List.cpp -------------------------------------------------------------------------------- /Phase - 6(60 questions)/Day-10/54. Delete Node in a Linked List.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 6(60 questions)/Day-10/54. Delete Node in a Linked List.cpp -------------------------------------------------------------------------------- /Phase - 6(60 questions)/Day-10/55. Reverse Linked List.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 6(60 questions)/Day-10/55. Reverse Linked List.cpp -------------------------------------------------------------------------------- /Phase - 6(60 questions)/Day-10/56. Design HashSet.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 6(60 questions)/Day-10/56. Design HashSet.cpp -------------------------------------------------------------------------------- /Phase - 6(60 questions)/Day-10/57. Design HashMap.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 6(60 questions)/Day-10/57. Design HashMap.cpp -------------------------------------------------------------------------------- /Phase - 6(60 questions)/Day-10/58. Merge Two Sorted Lists.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 6(60 questions)/Day-10/58. Merge Two Sorted Lists.cpp -------------------------------------------------------------------------------- /Phase - 6(60 questions)/Day-10/59. Remove Duplicates from Sorted List.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 6(60 questions)/Day-10/59. Remove Duplicates from Sorted List.cpp -------------------------------------------------------------------------------- /Phase - 6(60 questions)/Day-10/60. Intersection of Two Linked Lists.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 6(60 questions)/Day-10/60. Intersection of Two Linked Lists.cpp -------------------------------------------------------------------------------- /Phase - 6(60 questions)/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 6(60 questions)/README.md -------------------------------------------------------------------------------- /Phase - 7(60 questions)/Day-01/1. Palindrome Linked List.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 7(60 questions)/Day-01/1. Palindrome Linked List.cpp -------------------------------------------------------------------------------- /Phase - 7(60 questions)/Day-01/2. Remove Linked List Elements.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 7(60 questions)/Day-01/2. Remove Linked List Elements.cpp -------------------------------------------------------------------------------- /Phase - 7(60 questions)/Day-01/3. Merge In Between Linked Lists.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 7(60 questions)/Day-01/3. Merge In Between Linked Lists.cpp -------------------------------------------------------------------------------- /Phase - 7(60 questions)/Day-01/4. Design Browser History.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 7(60 questions)/Day-01/4. Design Browser History.cpp -------------------------------------------------------------------------------- /Phase - 7(60 questions)/Day-01/5. Swapping Nodes in a Linked List.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 7(60 questions)/Day-01/5. Swapping Nodes in a Linked List.cpp -------------------------------------------------------------------------------- /Phase - 7(60 questions)/Day-02/10. Add Two Numbers II.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 7(60 questions)/Day-02/10. Add Two Numbers II.cpp -------------------------------------------------------------------------------- /Phase - 7(60 questions)/Day-02/6. Next Greater Node In Linked List.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 7(60 questions)/Day-02/6. Next Greater Node In Linked List.cpp -------------------------------------------------------------------------------- /Phase - 7(60 questions)/Day-02/7. Odd Even Linked List.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 7(60 questions)/Day-02/7. Odd Even Linked List.cpp -------------------------------------------------------------------------------- /Phase - 7(60 questions)/Day-02/8. Linked List Components.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 7(60 questions)/Day-02/8. Linked List Components.cpp -------------------------------------------------------------------------------- /Phase - 7(60 questions)/Day-02/9. Flatten a Multilevel Doubly Linked List.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 7(60 questions)/Day-02/9. Flatten a Multilevel Doubly Linked List.cpp -------------------------------------------------------------------------------- /Phase - 7(60 questions)/Day-03/11. Leaf-Similar Trees.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 7(60 questions)/Day-03/11. Leaf-Similar Trees.cpp -------------------------------------------------------------------------------- /Phase - 7(60 questions)/Day-03/12. Convert Sorted Array to Binary Search Tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 7(60 questions)/Day-03/12. Convert Sorted Array to Binary Search Tree.cpp -------------------------------------------------------------------------------- /Phase - 7(60 questions)/Day-03/13. Binary Tree Postorder Traversal.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 7(60 questions)/Day-03/13. Binary Tree Postorder Traversal.cpp -------------------------------------------------------------------------------- /Phase - 7(60 questions)/Day-03/14. Binary Tree Preorder Traversal.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 7(60 questions)/Day-03/14. Binary Tree Preorder Traversal.cpp -------------------------------------------------------------------------------- /Phase - 7(60 questions)/Day-03/15. Two Sum IV - Input is a BST.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 7(60 questions)/Day-03/15. Two Sum IV - Input is a BST.cpp -------------------------------------------------------------------------------- /Phase - 7(60 questions)/Day-03/16. Construct String from Binary Tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 7(60 questions)/Day-03/16. Construct String from Binary Tree.cpp -------------------------------------------------------------------------------- /Phase - 7(60 questions)/Day-03/17. Binary Tree Paths.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 7(60 questions)/Day-03/17. Binary Tree Paths.cpp -------------------------------------------------------------------------------- /Phase - 7(60 questions)/Day-03/18. Minimum Absolute Difference in BST.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 7(60 questions)/Day-03/18. Minimum Absolute Difference in BST.cpp -------------------------------------------------------------------------------- /Phase - 7(60 questions)/Day-04/19. Global and Local Inversions.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 7(60 questions)/Day-04/19. Global and Local Inversions.cpp -------------------------------------------------------------------------------- /Phase - 7(60 questions)/Day-04/20. How Many Numbers Are Smaller Than the Current Number.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 7(60 questions)/Day-04/20. How Many Numbers Are Smaller Than the Current Number.cpp -------------------------------------------------------------------------------- /Phase - 7(60 questions)/Day-04/21. Sorting the Sentence.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 7(60 questions)/Day-04/21. Sorting the Sentence.cpp -------------------------------------------------------------------------------- /Phase - 7(60 questions)/Day-04/22. Maximum Product Difference Between Two Pairs.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 7(60 questions)/Day-04/22. Maximum Product Difference Between Two Pairs.cpp -------------------------------------------------------------------------------- /Phase - 7(60 questions)/Day-04/23. Sort Array By Parity.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 7(60 questions)/Day-04/23. Sort Array By Parity.cpp -------------------------------------------------------------------------------- /Phase - 7(60 questions)/Day-04/24. Height Checker.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 7(60 questions)/Day-04/24. Height Checker.cpp -------------------------------------------------------------------------------- /Phase - 7(60 questions)/Day-04/25. Maximum Units on a Truck.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 7(60 questions)/Day-04/25. Maximum Units on a Truck.cpp -------------------------------------------------------------------------------- /Phase - 7(60 questions)/Day-04/26. The K Weakest Rows in a Matrix.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 7(60 questions)/Day-04/26. The K Weakest Rows in a Matrix.cpp -------------------------------------------------------------------------------- /Phase - 7(60 questions)/Day-05/27. Carvans.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 7(60 questions)/Day-05/27. Carvans.cpp -------------------------------------------------------------------------------- /Phase - 7(60 questions)/Day-05/28. Count Substrings.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 7(60 questions)/Day-05/28. Count Substrings.cpp -------------------------------------------------------------------------------- /Phase - 7(60 questions)/Day-05/29. Operations on Tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 7(60 questions)/Day-05/29. Operations on Tree.cpp -------------------------------------------------------------------------------- /Phase - 7(60 questions)/Day-06/30. Lowest Common Ancestor of a Binary Search Tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 7(60 questions)/Day-06/30. Lowest Common Ancestor of a Binary Search Tree.cpp -------------------------------------------------------------------------------- /Phase - 7(60 questions)/Day-06/31. Sum of Left Leaves.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 7(60 questions)/Day-06/31. Sum of Left Leaves.cpp -------------------------------------------------------------------------------- /Phase - 7(60 questions)/Day-06/32. Cousins in Binary Tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 7(60 questions)/Day-06/32. Cousins in Binary Tree.cpp -------------------------------------------------------------------------------- /Phase - 7(60 questions)/Day-06/33. Kth Largest Element in a Stream.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 7(60 questions)/Day-06/33. Kth Largest Element in a Stream.cpp -------------------------------------------------------------------------------- /Phase - 7(60 questions)/Day-06/34. Diameter of Binary Tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 7(60 questions)/Day-06/34. Diameter of Binary Tree.cpp -------------------------------------------------------------------------------- /Phase - 7(60 questions)/Day-06/35. Symmetric Tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 7(60 questions)/Day-06/35. Symmetric Tree.cpp -------------------------------------------------------------------------------- /Phase - 7(60 questions)/Day-06/36. Balanced Binary Tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 7(60 questions)/Day-06/36. Balanced Binary Tree.cpp -------------------------------------------------------------------------------- /Phase - 7(60 questions)/Day-06/37. Subtree of Another Tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 7(60 questions)/Day-06/37. Subtree of Another Tree.cpp -------------------------------------------------------------------------------- /Phase - 7(60 questions)/Day-06/38. Path Sum.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 7(60 questions)/Day-06/38. Path Sum.cpp -------------------------------------------------------------------------------- /Phase - 7(60 questions)/Day-07/39. Swap Nodes in Pairs.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 7(60 questions)/Day-07/39. Swap Nodes in Pairs.cpp -------------------------------------------------------------------------------- /Phase - 7(60 questions)/Day-07/40. Flatten Binary Tree to Linked List.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 7(60 questions)/Day-07/40. Flatten Binary Tree to Linked List.cpp -------------------------------------------------------------------------------- /Phase - 7(60 questions)/Day-07/41. Partition List.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 7(60 questions)/Day-07/41. Partition List.cpp -------------------------------------------------------------------------------- /Phase - 7(60 questions)/Day-08/42. The k-th Lexicographical String of All Happy Strings of Length n.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 7(60 questions)/Day-08/42. The k-th Lexicographical String of All Happy Strings of Length n.cpp -------------------------------------------------------------------------------- /Phase - 7(60 questions)/Day-08/43. Minimum Falling Path Sum.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 7(60 questions)/Day-08/43. Minimum Falling Path Sum.cpp -------------------------------------------------------------------------------- /Phase - 7(60 questions)/Day-08/44. Is Subsequence.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 7(60 questions)/Day-08/44. Is Subsequence.cpp -------------------------------------------------------------------------------- /Phase - 7(60 questions)/Day-08/45. Climbing Stairs.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 7(60 questions)/Day-08/45. Climbing Stairs.cpp -------------------------------------------------------------------------------- /Phase - 7(60 questions)/Day-08/46. Maximum Subarray.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 7(60 questions)/Day-08/46. Maximum Subarray.cpp -------------------------------------------------------------------------------- /Phase - 7(60 questions)/Day-08/47. All Possible Full Binary Trees.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 7(60 questions)/Day-08/47. All Possible Full Binary Trees.cpp -------------------------------------------------------------------------------- /Phase - 7(60 questions)/Day-08/48. Count Sorted Vowel Strings.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 7(60 questions)/Day-08/48. Count Sorted Vowel Strings.cpp -------------------------------------------------------------------------------- /Phase - 7(60 questions)/Day-08/49. Count Square Submatrices with All Ones.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 7(60 questions)/Day-08/49. Count Square Submatrices with All Ones.cpp -------------------------------------------------------------------------------- /Phase - 7(60 questions)/Day-08/50. Count Substrings That Differ by One Character.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 7(60 questions)/Day-08/50. Count Substrings That Differ by One Character.cpp -------------------------------------------------------------------------------- /Phase - 7(60 questions)/Day-09/51. Count Number of Teams.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 7(60 questions)/Day-09/51. Count Number of Teams.cpp -------------------------------------------------------------------------------- /Phase - 7(60 questions)/Day-09/52. Sort Integers by The Power Value.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 7(60 questions)/Day-09/52. Sort Integers by The Power Value.cpp -------------------------------------------------------------------------------- /Phase - 7(60 questions)/Day-09/53. Number of Good Ways to Split a String.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 7(60 questions)/Day-09/53. Number of Good Ways to Split a String.cpp -------------------------------------------------------------------------------- /Phase - 7(60 questions)/Day-09/54. Collecting Coins Sequel.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 7(60 questions)/Day-09/54. Collecting Coins Sequel.cpp -------------------------------------------------------------------------------- /Phase - 7(60 questions)/Day-09/55. Special Product List.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 7(60 questions)/Day-09/55. Special Product List.cpp -------------------------------------------------------------------------------- /Phase - 7(60 questions)/Day-09/56. Trailing Zeros.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 7(60 questions)/Day-09/56. Trailing Zeros.cpp -------------------------------------------------------------------------------- /Phase - 7(60 questions)/Day-09/57. Count Nodes in Complete Binary Tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 7(60 questions)/Day-09/57. Count Nodes in Complete Binary Tree.cpp -------------------------------------------------------------------------------- /Phase - 7(60 questions)/Day-09/58. Shortest Common Supersequence.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 7(60 questions)/Day-09/58. Shortest Common Supersequence.cpp -------------------------------------------------------------------------------- /Phase - 7(60 questions)/Day-09/59. Count Substrings With All 1s.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 7(60 questions)/Day-09/59. Count Substrings With All 1s.cpp -------------------------------------------------------------------------------- /Phase - 7(60 questions)/Day-09/60. Partition String.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 7(60 questions)/Day-09/60. Partition String.cpp -------------------------------------------------------------------------------- /Phase - 7(60 questions)/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/Phase - 7(60 questions)/README.md -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shumbul/Competitive-programming-everyday/HEAD/README.md --------------------------------------------------------------------------------