codertcet111

Leetcode 53 Maximum Subarray

# @param {Integer[]} nums
# @return {Integer}
def max_sub_array(nums)
    max = nums[0]
    sum = 0
    nums.each_with_index do |ele, i|
        sum += ele
        if sum > max 

codertcet111

Leetcode 51 N queen

def solve_n_queens(n)
  @n = n
  @solutions = []

  board = Array.new(n) { Array.new(n, '.') }
  place_queens(board, 0)
  
  @solutions

codertcet111

Leetcode 49 Group Anagram

# @param {String[]} strs
# @return {String[][]}

def group_anagrams(strs)
    sum_ascii_hash = {}
    strs.each_with_index do |str, i|
        sorted_aa = str.chars.sort.join
        sum_ascii_hash["#{sorted_aa}"] ? sum_ascii_hash["#{sorted_aa}"] << i : sum_ascii_hash["#{sorted_aa}"] = [i]

codertcet111

Leetcode 48 Rotate image

# @param {Integer[][]} matrix
# @return {Void} Do not return anything, modify matrix in-place instead.
def rotate(matrix)
    # Just change row's to column, like [1,2,3] 1st row will become last column
    # Then 2nd row [4,5,6] will become 2nd column and so on
    #ignore: matrix.transpose.reverse
    n = matrix.length
    (0...n).each do |i|

codertcet111

Leetcode 45 Jump game

# @param {Integer[]} nums
# @return {Integer}
def jump(nums)
    
    # Explanation:
    # Example: [6,4,3,1,1,5,4,3,2,3,1,9,7,4,3,2,1,1,6,2,1]
    # for each ele in loop
    # for current ele, check the next possible window with ele sized elements

codertcet111

Leetcode 38: count and say

# @param {Integer} n
# @return {String}
def count_and_say(n)
    return "1" if n == 1
    str = count_and_say(n-1)
    str = str.split("").map {|ch| ch.to_i}
    #str.tally.map{|k,v| "#{v}#{k}" }.join("")
    len = str.length

codertcet111

Leetcode 18: 4 sum hard


# def four_sum(nums, target)
#     nums.sort!
#     set = Set.new
#     output = []

#     (0..nums.length - 4).each do |i|
#         (i + 1..nums.length - 3).each do |j|

codertcet111

Leetcode 1: two sum

# @param {Integer[]} nums
# @param {Integer} target
# @return {Integer[]}
def two_sum(nums, target)
    temp_hash = {}
    nums.each_with_index do |i, ind|
        return [temp_hash[i], ind] if temp_hash[i]
        temp_hash[target - i] = ind

codertcet111

Leetcode 2: Add two numbers linkedlist

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

codertcet111

Leetcode 3: Longest substring without repeating character

# @param {String} s
# @return {Integer}
def length_of_longest_substring(s)
    return 0 if s == "" || s == nil
    arr = s.split("")
    curr_count = 1
    max_len = 1
    curr_arr = [arr[0]]