Bala Paranj bparanj

Bala Paranj is interested in innovation and problem solving.

bparanj / flatten_tree.rb

Created August 13, 2020 23:02

	# 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

bparanj / bit_strings.rb

Created August 11, 2020 17:44

	def bit_strings(index, array, result)
	# Base case
	if index == array.length
	result << array.dup
	else
	# Make a choice to include
	array[index] = 1
	bit_strings(index+1, array, result)
	# Make a choice to exclude
	array[index] = 0

bparanj / subset_sum2.py

Created August 8, 2020 18:04

	def print_subset_sum(i, sol, psum, elements, x):
	# Base case
	if psum == x:
	print_subset_binary(sol, elements)
	elif i < len(elements):
	# Generate candidates
	for k in range(0, 2):

	# Check if recursion tree can be pruned
	if psum + k * elements[i] <= x:

bparanj / permutations.py

Last active August 2, 2020 19:27

	def generate_subsets(i, sol, elements):
	# Base case
	if i == len(elements):
	# Print complete solution
	print_subset_binary(sol, elements)
	else:
	# Generate candidate elements
	for k in range(0, 2):
	# Include candidate in partial solution
	sol[i] = k

bparanj / binarywatch.rb

Created August 2, 2020 14:50

bparanj / LCA Code

Created July 27, 2020 22:25 — forked from adamgarcia4/LCA Code

	# Definition for a binary tree node.
	# class TreeNode:
	# def __init__(self, x):
	# self.val = x
	# self.left = None
	# self.right = None

	class Solution:
	def lowestCommonAncestor(self, root: 'TreeNode', p: 'TreeNode', q: 'TreeNode') -> 'TreeNode':
	'''

bparanj / balanced.rb

Created July 27, 2020 20:43

	# 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

bparanj / binary_tree_paths.rb

Created July 27, 2020 20:43

	# 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

bparanj / Insert Interval

Created July 21, 2020 21:28 — forked from shamod/Insert Interval

+class Solution(object):
+    def insert(self, intervals, newInterval):
+        """
+        :type intervals: List[List[int]]
+        :type newInterval: List[int]
+        :rtype: List[List[int]]
+        """
+        '''
+        Test cases
+        i) [], [2,5] => [[2,5]]

bparanj / sliding window notes

Created July 20, 2020 03:21 — forked from adamgarcia4/sliding window notes

	# 1004: Max ConsecutiveOnes III
	maxLength = 0
	numZeros = 0

	# 1052: Grumpy Bookstore Owner
	maxCustWhenGrumpy = 0
	idxOfStartX = 0
	custWhenGrumpy = 0

	# 1456: Max Number of Vowels in Substring of given length