Problem: LeetCode June Challenge - Day 15 Ideas: If the current node is greater than the value searched, then the value searched can’t be in the right subtree, where all elements are greater, and viceversa.

Problem: LeetCode June Challenge - Day 14 Ideas: Another DP problem.

Problem: LeetCode June Challenge - Day 13 Ideas: Sort the vector so you only need to look after the current element to find multiples.

Problem: LeetCode June Challenge - Day 12 Ideas: Use a vector to be able to generate a random index and pick that element.

Problem: LeetCode June Challenge - Day 11 Ideas: I won’t do the trivial solution that the problem mentions.

Problem: LeetCode June Challenge - Day 10 Ideas: Binary search for O(log(n)) complexity.

Problem: LeetCode June Challenge - Day 9 Ideas: Another standard DP problem.

Problem: LeetCode June Challenge - Day 8 Ideas: n must be positive.

Problem: LeetCode June Challenge - Day 7 Ideas: This is a very standard dp problem.

Problem: LeetCode June Challenge - Day 6 Ideas: People with the same height will be sorted according to the number of people in front of them.