Difficulty: Medium Link: Day 26, May Leetcode Challenge Problem Description A decimal number is called deci-binary if each of its digits is either 0 or 1 without any leading zeros. For…

# Tag: Tech Interview

Difficulty : Medium Link: Day 12: May Leetcode Challenge Problem Description Given the root of a binary tree, return the level order traversal of its nodes’ values. (i.e.,…

Difficulty: Medium Link: Day 19:May Leetcode Challenge Problem Description Given an integer array nums of size n, return the minimum number of moves required to make all array elements…

Problem Description Given two strings word1 and word2, return the minimum number of steps required to make word1 and word2 the same. In one step, you can delete exactly one character in either string. Examples Constraints…

Difficulty: Medium Link: Day 4 : May Leetcode Challenge Problem Description Given an array nums with n integers, your task is to check if it could become non-decreasing by…

Difficulty : Easy Link: Leetcode April Challenge 2021: Day 23 Problem Description Give a string s, count the number of non-empty (contiguous) substrings that have the…

Difficulty: Medium Link: Day 21: April Leetcode Challenge Problem Description Given a triangle array, return the minimum path sum from top to bottom. For each step, you may…

Difficulty : Easy Link: Leetcode 543 Problem Description Given the root of a binary tree, return the length of the diameter of the tree. The diameter of a binary tree is the length of…

Difficulty: Medium Link: April Leetcoding Challenge : Day 14 Given the head of a linked list and a value x, partition it such that all nodes less than x come before…

Difficulty : Medium Link : April Leetcoding Day 13 Problem Description You are given a nested list of integers nestedList. Each element is either an integer…