Adaptable Tools’ Post

The semantic interface palette is simple https://buff.ly/4fF2G0N

The semantic interface palette is simple https://buff.ly/411rA5Z

DSA-Day 161🔶 Question: 1669. Merge In Between Linked Lists You are given two linked lists: list1 and list2 of sizes n and m respectively. Remove list1's nodes from the ath node to the bth node, and put list2 in their place. Approach: Merge the nodes of list2 into list1 between indices a and b (inclusive). Traverse list1 until the node before index a, then traverse list1 again to find the node after index b. Connect the end of list2 to the node after index b and return the modified list1. Time complexity: O(n) Space complexity: O(1) Code: https://lnkd.in/ghjRNiNd #dsa #softwareengineer #leetcode #interviewprep

Sometimes you may want to match for an exact value with Gravity Forms conditional logic, but what if you want to match any value that’s *somewhat* close? This snippet accommodates those similar but not identical values!

Binary Search Algorithm representation with P5.js . link- https://lnkd.in/dhGCEbYh

I completed the third part of the Odyssey Lift-off course on arguments at https://lnkd.in/e6QAJmeh Some key takeaways I learned about the Apollo server: - The 'Query' type in the schema are entry-points for the schema. Other possible entry points are 'Mutation' and 'Subscription' - Resolver chains are used for nested objects and fields in GraphQL.  The `parent` parameter in the resolver refers to the returned data of the preceding resolver function in the chain. The great thing is it's only called when the query asks for the field. - A resolver function populates the data for a field in your schema. The function has four parameters. The first, parent, contains the returned data of the previous function in the resolver chain. The second, args, is an object that contains all the arguments provided to the field. We use the third parameter, contextValue, to access data sources such as a database or REST API. Finally, the fourth parameter, info, contains informational properties about the operation state. - If you see a `$` symbol in a Graphql query, this indicates a variable - The 'useQuery' hook returns an object with three useful properties that are used in an app. 'loading' indicates whether the query has been completed and results have been returned. 'error' is an object that contains any errors that the operation has thrown. data contains the results of the query after it has been completed. To set variables in our query, we declare them in the second parameter of the 'useQuery' hook, inside an options object. Intriguing as to how the Apollo server and React works. Pretty fun stuff! #graphql #apolloodyssey #netflix #react

Two Sum : Return indices of two numbers, whose sum equals to `target` C++ implementation with std::map<int, int> nested for loop vs single for loop + map

DSA-Day 154🔶 Question:1481. Least Number of Unique Integers after K Removals Given an array of integers arr and an integer k. Find the least number of unique integers after removing exactly k elements. Approach: Use the Counter class to count the frequency of each element in the input array, then sort these elements by frequency. Iterate through the sorted list, remove elements with the lowest frequencies until the remaining removals (k) are insufficient. Return the count of unique elements left after removals. Time Complexity: O(n log n) for sorting, where n is the length of the input array. Space Complexity: O(n) for the Counter dictionary. Code: https://lnkd.in/gdNPujzf #dsa #softwareengineer #leetcode #interviewprep

167. Two Sum II - Input Array is Sorted Note: Two pointers with Binary Search. The index starts from 1 instead of 0 so be careful! TC: O(logn) as we are using binary search on a sorted array SC: O(1) as we are only using pointers.

𝙄𝙣𝙨𝙚𝙧𝙩𝙞𝙤𝙣 𝙎𝙤𝙧𝙩 𝙄𝙢𝙥𝙡𝙚𝙢𝙚𝙣𝙩𝙖𝙩𝙞𝙤𝙣 f(n) = n + 1 + 1 + n^2 + n^2 + n^2 + 1 f(n) = 3n^2 + n + 3 So, the complexity of the insertion sort code is O(n^2), which is a 𝒇𝒂𝒊𝒓 algorithm.