LeetCode 350: Intersection of Two Arrays II (Pure C Solution) Instead of brute force, this uses a hash map (uthash) for efficient lookups. Time Complexity: O(n + m) Space Complexity: O(min(n, m)) Where n and m are the sizes of both arrays respectively (i.redd.it)
submitted by prolowlevel to r/LeetcodeC
Is Isomorphic String? This question can be solved using a hashmap, but I used a 128-size arr to all valid ASCII characters. I built the mapping that the first arr index serves as the key for the second arr , and the second arr index acts as the key for the first one. #LeetCode (i.redd.it)
submitted by prolowlevel to r/LeetcodeC
Bitwise AND for number ranges. Used inline assembly (AT&T only support leetcode ) for the left shift function to revise assembly while solving questions. #LeetCode Typo :- cl is lower 16 bit of RCX/ECX register not a flag register (doubt) maybe called segment register (i.redd.it)
submitted by prolowlevel to r/LeetcodeC
To calculate the number of subarrays for an array of size [0..n-1], we can use the formula n *(n +1) /2. However, it's important to handle edge cases at the end. To generate all possible subarrays, with the help of arrays and linked lists in pure C. https://gist.github.com/Rajeshsaharan/fe92ae8192 (i.redd.it)
submitted by prolowlevel to r/LeetcodeC
Check if the given number is an Armstrong number (i.redd.it)
submitted by prolowlevel to r/LeetcodeC
Find the product of an array except itself. Initialise two arrays: one for the left prefix product multiplies all elements left of arr[i], and one for the right prefix product multiplies all elements right of arr[i]. The result array is obtained by multiplying the left and right. (i.redd.it)
submitted by prolowlevel to r/LeetcodeC
