bparanj

# Definition for singly-linked list.
# class ListNode
#     attr_accessor :val, :next
#     def initialize(val = 0, _next = nil)
#         @val = val
#         @next = _next
#     end
# end
# @param {ListNode} head
# @return {Integer}

bparanj

# @param {String} s
# @return {Integer}
def balanced_string_split(s)
    counter = 0
    balance = 0
    characters = s.chars
    characters.each do |c|
        balance += 1 if c == 'L'
        balance -= 1 if c == 'R'
        counter += 1 if balance == 0

bparanj

def create_target_array(nums, index)
    result = []
    
    i = 0
    while result.size < nums.size
      result.insert(index[i], nums[i])
      i += 1
    end
    result
end

bparanj

# @param {Integer[]} nums
# @return {Integer[]}
def decompress_rl_elist(nums)
    result = []
    for index in (0..nums.size-2) do
      item = nums[index]
      if index.even?
        item.times do
          result << nums[index+1]  
        end 

bparanj

# @param {Integer} n
# @return {Integer}
def subtract_product_and_sum(n)
    product = 1
    sum = 0
    while n > 0
       sum += n % 10  
       product *= n % 10
       n = n / 10
    end

bparanj

# @param {Integer[]} nums
# @param {Integer} n
# @return {Integer[]}
def shuffle(nums, n)
    result = []
    first = 0
    second = n
    index = 0
    while result.size < 2*n
      result[index] = nums[first]

bparanj

# @param {Integer[]} nums
# @return {Integer[]}
def running_sum(nums)
    nums.each_with_index do |item, index|
       if index == 0
           next
       end
        nums[index] = nums[index] + nums[index-1]
    end
end

bparanj

# @param {String} s
# @param {Integer[]} indices
# @return {String}
def restore_string(s, indices)
    result = '' * indices.size
    indices.each_with_index do |item, index|
        result[item] = s[index]
    end
    result
end

bparanj

Node* Tree::generateFromTraversal(int *inorder, int *preorder, int inStart, int inEnd) {
    // Reference: https://algorithms.tutorialhorizon.com/make-a-binary-tree-from-given-inorder-and-preorder-traveral/
    static int preIndex = 0;
 
    if (inStart > inEnd){
        return nullptr;
    }
 
    Node* node = new Node(preorder[preIndex++]);
 

bparanj

# Definition for a binary tree node.
# class TreeNode
#     attr_accessor :val, :left, :right
#     def initialize(val = 0, left = nil, right = nil)
#         @val = val
#         @left = left
#         @right = right
#     end
# end
# @param {TreeNode} root