-
-
Save renatamarques97/89ee44f7c7877b93bea9a3d767b3b865 to your computer and use it in GitHub Desktop.
Leet Code Problems
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| # @param {String} j | |
| # @param {String} s | |
| # @return {Integer} | |
| def num_jewels_in_stones(j, s) | |
| jewels = j.split("") | |
| total = 0 | |
| s.split("").each do |stone| | |
| total += 1 if jewels.include?(stone) | |
| end | |
| total | |
| end |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| # @param {Integer[]} candies | |
| # @param {Integer} extra_candies | |
| # @return {Boolean[]} | |
| def kids_with_candies(candies, extra) | |
| max_candies = candies.max | |
| candies.map do |candy| | |
| candy + extra >= max_candies | |
| end | |
| end |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| def number_of_steps(num) | |
| counter = 0 | |
| while num != 0 | |
| num = num.even? ? num / 2 : num - 1 | |
| counter += 1 | |
| end | |
| counter | |
| end |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| def number_of_steps(num) | |
| steps = 0 | |
| while num != 0 | |
| num.even? ? num /= 2 : num -= 1 | |
| steps += 1 | |
| end | |
| puts steps | |
| end |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| def number_of_steps(num) | |
| steps = 0 | |
| while num != 0 | |
| if num.even? | |
| num = num/2 | |
| steps +=1 | |
| end | |
| if num.odd? | |
| num -= 1 | |
| steps +=1 | |
| end | |
| end | |
| steps | |
| end |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| # @param {Integer} num | |
| # @return {Integer} | |
| def number_of_steps(num) | |
| next_step(num, 0) | |
| end | |
| def next_step(value, step_count) | |
| return step_count if value.zero? | |
| if value.odd? | |
| next_step(value - 1, step_count + 1) | |
| else | |
| next_step(value / 2, step_count + 1) | |
| end | |
| end |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| # @param {Integer[]} nums | |
| # @return {Integer[]} | |
| def running_sum(nums) | |
| result = [] | |
| nums.each do |el| | |
| previous_value = result.last || 0 | |
| result.push(previous_value + el) | |
| end | |
| result | |
| end |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| # @param {Integer[]} nums | |
| # @param {Integer} n | |
| # @return {Integer[]} | |
| def shuffle(nums, n) | |
| (0..n). do |index| | |
| first_half = nums[0...n] | |
| second_half = nums[n..-1] | |
| result = [] | |
| (0...n).each do |index| | |
| result.push(first_half[index], second_half[index]) | |
| end | |
| result | |
| end |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| # @param {Integer[]} nums | |
| # @param {Integer} n | |
| # @return {Integer[]} | |
| def shuffle(nums, n) | |
| (0...n).flat_map do |index| | |
| [nums[index], nums[index + n]] | |
| end | |
| end |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment