vishalg0wda

package com.booking.payments.point.common.core.annotation;

import com.booking.payments.point.common.core.model.MetricNames;
import io.micrometer.core.annotation.Timed;
import java.lang.annotation.Documented;
import java.lang.annotation.ElementType;
import java.lang.annotation.Retention;
import java.lang.annotation.RetentionPolicy;
import java.lang.annotation.Target;
import org.springframework.beans.factory.annotation.Qualifier;

vishalg0wda

class Solution {
    public int[][] merge(int[][] intervals) {
        Map<Integer, Integer> intervalMap = new HashMap<>();
        for (int[] interval: intervals) {
            intervalMap.putIfAbsent(interval[0], 0);
            intervalMap.compute(interval[0], (k, v) -> v > interval[1] ? v : interval[1]);
        }
        Map<Integer, Integer> merged = new HashMap<>();
        List<Integer[]> out = new LinkedList<>();
        int minStart = -1, maxEnd = -1;

vishalg0wda

class Solution {
    public boolean exist(char[][] board, String word) {
        if (word == null || word.length() == 0) return true;
        boolean[][] visited = new boolean[board.length][board.length];
        Character startChar = word.charAt(0);
        for (int r = 0; r < board.length; r++) {
            for (int c = 0; c < board.length; c++) {
                visited[r][c] = true;
                if (board[r][c] == startChar && backtracking(1, r, c, visited, board, word)) return true;
                visited[r][c] = false;

vishalg0wda

from collections import deque
class Solution:
    def __init__(self):
        self.grid = None
        self.rows = 0
        self.cols = 0
    
    def bfs(self, rottens: list[tuple[int]]) -> int:
        q = deque([(rr, rc, 0) for (rr, rc) in rottens])
        minutes = 0

vishalg0wda

class Solution:
    def knightProbability(self, N: int, K: int, r: int, c: int) -> float:
        moves = [(-2, 1), (-2, -1), (-1, 2), (-1, -2), (1, 2), (1, -2), (2, 1), (2, -1)]
        dp0 = [[1] * N for _ in range(N)]
        to_visit = {(r, c)}
        count = 0
        for _ in range(K):
            dp1 = [[0] * N for _ in range(N)]
            new_to_visit = set()
            for (r, c) in to_visit:

vishalg0wda

def knightProbability(self, N: int, K: int, r: int, c: int) -> float:
    grid = [[0] * N for _ in range(N)]
    # utility to count number of moves given a starting position
    def recur(r: int, c: int, k: int) -> int:
        if not (0 <= r < N and 0 <= c < N):
            return 0
        if k == 0:
            return 1
        # try all 8 possible moves
        return (

vishalg0wda

from typing import Generator
        
class TreeNode:
    def __init__(self, key, val):
        self.key = key
        self.val = val
        self.left = None
        self.right = None
        
    def __str__(self):