Ibrahim Khan’s Post

One good reason to use regular functions over arrow functions - when you debug a complex bug, you can see the name of functions in the call stack - big time saver! Also, you can pass around a named function as a callback function in multiple places over an anonymous arrow function. However, with array methods - map, filter & reduce, I do prefer anonymous arrow function. Thoughts?

Automate the transfer of data between your systems to eliminate the need for manual re-keying, saving time and reducing errors. Find out more: https://buff.ly/3Wbz6XG

The best feature of a newsletter that some people are missing: ∞> Automatic $$ ∞> Automatic trust ∞> Automatic Work It is automation my brothers Use it, and make $$ or gain trust or do what you want to. But don't miss it

This year alone, Smart Rate shifts had a 23% higher fill rate than non-Smart Rate shifts. Learn if real-time automated adjustments saving you time, money, and stress - is the missing piece of your strategy puzzle. Book a demo today: https://lnkd.in/g7DbXkjk

Intentional Scheduling and Using a Checklist https://bit.ly/4cD8E0O

lets talk Node (Event Streams) When handling large amounts of data, using the standard read and write methods from the file systems module can be quite slow. That's where Event Streams come into play. In this video, I'll demonstrate why it's a superior method. You'll be amazed to see the significant difference in bytes, highlighting it effectiveness when it comes to optimisation.

Dive right in and learn how to increase the limit of the number of workflow rules available per object or entity: https://sforce.co/3HpBhRd

Day 4/365, Q2870. Minimum Number of Operations to Make Array Empty Intuition The goal is to find the minimum number of operations required to make all numbers in a given list divisible by 3. The approach involves examining the frequency of each number in the list and determining the minimum operations needed for groups of numbers with the same frequency. `Bruteforce Approach` After creating frequency map of numbers in list, we can try all possible path, so either we can pick 2 or 3 in recursively call with frequency subtracting choice from it, maintaining minimum count, if any call reaches to 1 return -1 as answer, this approach is very time consuming we can impoving it using DP as we can see for below cases case answer 1 -1 2 1 3 1 4 2 5 2 6 2 7 3 8 3 `Optimal Approach` In this approach we maintain count the frequency of each number in the list using a Counter. Iterate through the frequency values, calculate the minimum operations for each group of numbers with the same frequency, and accumulate these values. Return the total minimum operations. Special case: If any number appears only once, return -1, as it cannot be made divisible by 3 with operations. Time complexity: O(N) Space complexity: O(K), where K is the number of unique elements in list

Round Robin: 1. The basic round-robin algorithm directs client requests to different service instances sequentially. 2. Statelessness is typically a prerequisite for the services in this approach. Sticky Round-Robin: 1. An enhancement of the round-robin method where subsequent requests from a client are directed to the same service instance that handled their initial request. 2. Promotes continuity for a specific client with a particular service. Weighted Round-Robin: 1. Allows administrators to assign weights to each service instance. 2. Services with higher weights are assigned more requests, distributing the load based on specified priorities. 3. Provides a mechanism for fine-tuning the allocation of requests among different services.

Dive right in and learn how to increase the limit of the number of workflow rules available per object or entity: https://sforce.co/3HpBhRd