Get live statistics and analysis of Craque's profile on X / Twitter

Today’s LeetCode POTD:Minimum number of increments on subarrays to form a single array. This problem focuses on transforming an integer array initial with all zeroes to input array target.For applying this transformation,we have to pick any subarray from initial and increment the subarray elements by one. We have to return the minimum number of subarray additions to achieve the transformation to target. Example: Input target array=[1,2,4,3] initial=[0,0,0,0] =>+1 from [0,3] =>[1,1,1,1] =>+1 from [1,2] =>[1,2,2,2] =>+1 from [2,3] =>[1,2,3,3] =>+1 from [2,2] =>[1,2,4,3] Total=4

Today’s LeetCode POTD:The Two Sneaky Numbers of Digitville This problem primarily focuses on identifying a pair of numbers in an input nums array where they appear two times where the rest numbers appear only once. Now the numbers in the array appear from the range from [0,n-1] where n can take from 2 to 100 according to the constraints. For this problem,there is more than one correct approach,so you can implement what feels comfortable for you.However,I will discuss three correct approaches which you can implement for this problem.

Today’s LeetCode POTD: Find X-sum of All K-Long Subarrays I We have inputs nums(an integer array),k(an integer),x(an integer).Based on these inputs we have to return an integer array answer(any name can be used,but answer for convention),where at each index i we store the sum of subarray from index i to index i+k-1. The sum can be of two types: If the subarray from index i has less than x distinct elements,we store the sum of all subarray elements at answer i If the subarray from index i has x or more distinct elements,we return the sum of x most frequent elements. If we have multiple elements which have the same frequency,pick the element which is greater for calculating sum for answer[i]. For this question,there are two approaches,where the second approach is an optimization of the first approach if we have a larger range for nums[i],x and k

Today’s LeetCode POTD:Find X Sum of All K-Long Subarrays II This problem was the same problem as yesterday’s but has a larger range of values for nums[i],k and x. Here nums is an input integer array,k and x are integers. To recollect as to what was the goal of yesterday’s problem,we have to return an integer array of length n-k+1 answer,where at answer[i] we store the sum of subarray starting from index i to i+k-1.This sum can be of two types: ->If the subarray has less than x distinct elements,we store the sum of all subarray elements at answer i ->If the subarray has x or more distinct elements,we return the sum of x most frequent elements. For today’s problem we have to return an array of long datatype instead of integer.

Been thinking of implementing an HTTP server for a while, so I finally took the first step. Read a blog that gave me some intuition on how basic HTTP servers work. It is still far from a finished product, but I managed to get a simple client-server connection working using sockets. Will post regular updates

Started with linear programming in ML Maths. Learned how it can be utilized to solve optimization problems based on constrains and an objective function. Explored feasible regions and feasible solutions where we can use them to find the maximum and minimum values for an objective function based on the corner points in the feasible region. DeepML (K-Means Clustering Implementation): Approach: For each iteration, 1)Define k clusters. For every point in the dataset, compute the Euclidean distance between the point and each centroid. 2)Assign each point to the cluster whose centroid is closest, based on the minimum distance. 3)Calculate the mean of all points in each cluster to update the centroid and form new clusters. The tricky part here was the points are given as tuples so changes can't be done in-place as tuples are immutable .Due to this, rounding the answer to 4 d.p after computing the centroids was a bit difficult but yeah completed.

Good morning,modular arithmetic ftw

Today’s LeetCode POTD:Delete Nodes from Linked List Present in Array This problem focuses on deleting all the nodes from a input linked list where each node’s value is present in the input nums array.The head of the linked list is provided here in the inputs

Today’s LeetCode POTD:Power Grid Maintenance Inputs for the problem include an integer c,which represents the number of power stations(1-indexed),integer array connections,which has entries [u,v],where bidirectional connections are established between station u and station v and integer array queries,which has queries of type [1,x] and [2,x]. Query type [1,x] indicates maintenance check for station x.If station x is online,then the check is resolved by station itself if station x is online else check is handled by the minimum station id in the same power grid as x. Query type [2,x] specifies that station x is no longer online.Query type [1,x] can either return a result of station id which handles the maintenance check else return -1 if no station can handle the check. The output for this problem involves returning an integer array,which stores results of query [1,x] in the order they appear.

Was working with routes in expo router,where i got stuck with error in Link component's href prop for 3 hours,the problem was just to include a dot . before the path string🤡

Alhamdulliah for the relationship lost Alhamdulliah for the friends made Alhamdulliah for the happy moments Alhamdulliah for the lessons learned Alhamdulliah for the tough times Alhamdulliah for the times of ease Alhamdulliah for living another day

Water Bottles II Story: Tried solving since morning but kept failing. Mistakes -> delaying exchanges,trying to exchange without enough empties. Approach: Keep exchanging while empty >= numExchange. For each new bottle, drink it immediately so it adds back to empties.