1486. XOR Operation in an Array
The solution involved generating a sequence of numbers as defined by the problem's start and n parameters, then applying a bitwise XOR operation to all elements to find the final result.
#LeetCode#CodingChallenge#Algorithms#BitwiseOperations
Day 129! ๐ Tackled a bitwise manipulation problem today: swapping nibbles in an integer! ๐ก It's all about using the right masks (0x0F and 0xF0) and bit shifts. Solved it efficiently and learned a lot! #BitwiseOperations#CodingChallenge#ProblemSolving#Day129#Cpp
๐ฅ Day 300 of DSA Series โ Milestone Unlocked! ๐๐
300 days of consistent problem-solving on LeetCode! ๐ฏ๐ง
Solved 1 question:
1๏ธโฃ Longest Subarray with Maximum Bitwise AND ๐งฎ ๐ช
Letโs keep pushing forward! ๐ป๐ฅ
#Day300#DSA#LeetCode#100DaysOfCode#BitwiseOperations#Milestone
Today, we Covered:
โข STL(Standard Template Library) of C .
โข Vector Function type.
โขStatic vs Dynamic memory allocation.
โขHow vector is stored in memory.
โขLeet code Q 136: "Single Number" solved using bitwise XOR.
#Coding#Cplusplus#STL#leetcode#BitwiseOperations#XOR
โ๏ธ Another important OP_CODE in BSV is OP_LSHIFT and OP_RSHIFT. These perform bitwise left and right shifts, allowing for more complex data manipulations within smart contracts. BTC does not support these. #BitwiseOperations#SmartContracting