Chetan Dattachetan77.hashnode.dev·May 13, 2024Kth element of 2 sorted arraysProblem Given two sorted arrays arr1 and arr2 of size N and M respectively and an element K. The task is to find the element that would be at the kth position of the final sorted array. Example 1: Input: arr1[] = {2, 3, 6, 7, 9} arr2[] = {1, 4, 8, 10...DiscussLeetcodekth-element-of-2-sorted-arrays

Chetan Dattachetan77.hashnode.dev·May 5, 2024Painter's Partition ProblemProblem Given an array/list of length ‘n’, where the array/list represents the boards and each element of the given array/list represents the length of each board. Some ‘k’ numbers of painters are available to paint these boards. Consider that each u...DiscussLeetcodepainters-partition-problem

Chetan Dattachetan77.hashnode.dev·May 5, 2024410. Split Array Largest SumProblem Given an integer array nums and an integer k, split nums into k non-empty subarrays such that the largest sum of any subarray is minimized. Return the minimized largest sum of the split. A subarray is a contiguous part of the array. (link) Ex...DiscussLeetcodesplit-array-largest-sum

Chetan Dattachetan77.hashnode.dev·Apr 27, 20241011. Capacity To Ship Packages Within D DaysProblem A conveyor belt has packages that must be shipped from one port to another within days days. The ith package on the conveyor belt has a weight of weights[i]. Each day, we load the ship with packages on the conveyor belt (in the order given by...DiscussLeetcodeCapacity To Ship Packages Within D Days

Chetan Dattachetan77.hashnode.dev·Apr 27, 20241283. Find the Smallest Divisor Given a ThresholdProblem Given an array of integers nums and an integer threshold, we will choose a positive integer divisor, divide all the array by it, and sum the division's result. Find the smallestdivisor such that the result mentioned above is less than or equa...DiscussLeetcodeFind the Smallest Divisor Given a Threshold

Simran Anandsimranblogss.hashnode.dev·Apr 20, 2024"Mastering Binary Search Trees: A Java Journey Through Efficient Data Structures"An elaborate blog article explaining the concepts of binary search tree, its various applications, operations that can be performed and example use cases with details covered in my YouTube video! Introduction A Binary Search Tree (BST) is a fundament...Discuss·20 likes·40 readsJava

Lucalijucay.hashnode.dev·Apr 16, 2024Bits & Beyond 4: Binary treesLast time, we learned about the basics of data structures. In this entry of Bits & Beyond, we will learn about binary trees. Binary trees are a part of data structures but given its amount of information, you have to learn, I decided to make an extra...DiscussBits & Beyond: Journey into programmingBinaryTrees

Chetan Dattachetan77.hashnode.dev·Mar 24, 2024Find Nth Root Of MProblem statement You are given two positive integers 'n' and 'm'. You have to return the 'nth' root of 'm', i.e. 'm(1/n)'. If the 'nth root is not an integer, return -1. (link) Note: 'nth' root of an integer 'm' is a number, which, when raised to th...DiscussLeetcodeleetcode

Chetan Dattachetan77.hashnode.dev·Mar 20, 2024540. Single Element in a Sorted ArrayProblem You are given a sorted array consisting of only integers where every element appears exactly twice, except for one element which appears exactly once. Return the single element that appears only once. Your solution must run in O(log n) time a...Discusssingle-element-in-a-sorted-array

Chetan Dattachetan77.hashnode.dev·Mar 12, 202434. Find First and Last Position of Element in Sorted ArrayGiven an array of integers nums sorted in non-decreasing order, find the starting and ending position of a given target value. If target is not found in the array, return [-1, -1]. You must write an algorithm with O(log n) runtime complexity. (link) ...DiscussLeetcodelower bound