“Journey never starts from thinking ,it starts from taking actions “ by referencing this quote I will embark on this journey to become a high-end developer with ethics and knowledge I will share my problems that I faced during my learning process eve...
Kicking off a challenge like the 100 Days of Code gets you excited and nervous at the same time. When I started this journey, I had a clear goal: to boost my problem-solving skills, get better at data structures and algorithms (DSA), and keep my MERN...
LeetCode Like a Lady: Cracking Coding Interviews in Heels - Linked List Solutions Hello, world! I’m excited to share my journey through the Linked List problems from Striver's A2Z DSA Sheet. In this series, I’ll be posting function implementations in...
Introduction Hello, fellow coders! I'm excited to share my journey in mastering Data Structures and Algorithms (DSA) with you. Recently, I embarked on a speedrun through TakeYouForward's comprehensive DSA course, and I’ve just completed the Patterns ...
Problem 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...
Problem 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...
Problem 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...
Problem 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...
Problem Given the head of a singly linked list, group all the nodes with odd indices together followed by the nodes with even indices, and return the reordered list. The first node is considered odd, and the second node is even, and so on. Note that ...
Problem Statement Given the head of a linked list, return the list after sorting it in ascending order. (link) Example 1: Input: head = [4,2,1,3] Output: [1,2,3,4] Example 2: Input: head = [-1,5,3,4,0] Output: [-1,0,3,4,5] Example 3: Input: head ...
