#Truchet / bitmasking in 8 bits in progress. The grid is now complete and uses a set of 15 tiles. It's not easy to map the values ​​correctly. Next improvement: move to a 3x3 or larger matrix system to define tiles relations, and draw them dynamically.

#generativeart #tiling #pattern #bitmasking

#TruchetBounds / work in progress

After several fails to find a good way for randomly filling a grid with truchet tiles, I discovered a vintage videogame technique called #bitmasking

> Evaluate a tile value from its cardinals neighbors 1,2,4,8.
The basic tiles set consists in only 6 tiles with rotation, determined by the tile value.
Seems promising.

#pattern #truchet #tiling

👋 Hi everyone! recently, I was solving a LeetCode problem, “Find the Longest Substring Containing Vowels in Even Counts”, and came across an incredibly efficient solution using bit masking. Let me break down the journey step by step.👇
📎 See blog post: https://medium.com/@akshat.singh1718/how-i-got-fascinated-by-bit-masking-in-algorithms-6626b4f2c929

#bitmasking #Algorithms #bitmanipulation #optimization

☑️ Day 5/100: #Leetcode daily question

🟨 Question: 1371. Find the Longest Substring Containing Vowels in Even Counts

This question was medium-level and a really good question of bit masking.

🐈‍⬛ Check out my #GitHub where I post all the daily streak 🔥 questions and #LeetcodeContest 🏆 solutions

🔗 Solution Link: https://github.com/akshatsingh1718/leetcode/tree/main/findtheLongestSubstringContainingVowelsinEvenCounts

🔗 My Leetcode Github: https://github.com/akshatsingh1718/leetcode
#coding #python #dailycode #Bitmasking

☑️ Day 2/100: #Leetcode daily question

🟣 Question: 1684. Count the Number of Consistent Strings.

This question was easy and I solved it with 4 different approaches.
1️⃣ #Bruteforce
2️⃣ #Hashset
3️⃣ #Booleanarray
4️⃣ #Bitmasking

🐈‍⬛ Check out my #GitHub where I post all the daily streak 🔥 questions and #LeetcodeContest 🏆 solutions

🔗 https://github.com/akshatsingh1718/leetcode/tree/main/counttheNumberofConsistentStrings