Kristian Bouw’s Post

Solved all 4 problems of today's weekly. Here is how I approached each of them. Q1. Find the K-th Character in String Game I Start with a string of size 1 containing only "a". - create a new string by changing each character to the next character in alphabetical order. Append the new string to the original string. Repeat the following process till the string becomes atleast of size k. Q2. Count of Substrings Containing Every Vowel and K Consonants I For each of the substring check if it contain all 5 vowels and exactly k consonents. Q3. Count of Substrings Containing Every Vowel and K Consonants II Maintain a sliding window with at max k consonants and keep track of vowels in the front of the window, removing which there can still be all 5 vowels. Q4. Find the K-th Character in String Game II From the end of the operations array keep popping the elements which are not necessary and add the rest of the elements. The addition is the number of increment that took place.

🌟 Day 3 of #gfg160 Challenge 🚀 Today's problem was "Rotate an Array". 🌀 ✅ Problem: Rotate an array by d elements to the left (counter-clockwise direction). ✅ Approach: Used the reversal algorithm to solve the problem efficiently with O(n) time complexity and O(1) space complexity. #GeeksforGeeks #DSA #ProgrammingJourney #KeepCoding #womenintech

(Day 51/100): Today I worked on writing a Breadth First Search algorithm for a tower defense game I am building. The purpose is to provide a game object with the shortest path to the endpoint, which will be dynamically calculated and recalculated whenever that path is blocked. #100daysofcode #100daysofcodechallenge #100daysofcoding #100daysofcodingchallenge 

💥  Leetcode Weekly 407 Upsolve 💥 Quest 1: https://lnkd.in/gij3GdcZ Soln: T.C = O(31) S.C = O(1) Perform an iteration from [0...31) and for each create a mask that is (1<<i) check for the bits of that position if bit of N is !=0 and bit of K is 0 that signifies we can reduce this to 0 and increment count for this operation else return -1 directly if its not atlast check whether n==k if it is return count else -1 Submission link : https://lnkd.in/g8zgHV9N Quest 2: https://lnkd.in/gvSTHWVp Soln: T.C = O(n) S.C = O(1) Just count the number of vowels in the given string, if vowels count is zero then only Bob can win sounds funny for bob perspective, since if vowels count is odd alice can remove the whole string and bob will be left with an empty string wherase if it is even, and greater than zero alice can remove the odd vowels and bob will left out with odd count of vowels and he cannot perform anything and Alice will win the game. POV: If alice wins return true, else return false Submission link : https://lnkd.in/gnT7Hzku Quest 3 : https://lnkd.in/gPVaPPaz Soln: T.C = O(n) S.C = O(1) Initialize a count and a flag variable we need to start taking from the low index inorder to have our answer contain maximum value iterate and if flag == 1 and current character is 1 too then just simply increase count else if flag == 1 and current character is 0 change flag to 0 otherwise if flag ==0 and character is 1 then increment answer by count and  change flag to one and increase the count, most probably an implementation type problem Submission link : https://lnkd.in/gsyKSjgx Quest 4: https://lnkd.in/gHqAag9c Soln: T.C = O(1) S.C = O(1) Brute force will be like what will be my start and end point where I need to increment or decrement my values of nums for this Time Complexity is O(n^2*d) where d is the difference, now inorder to eliminate d we can have a stopping like stuff that tells yes for this value I can move further with current value of differnce for a particular ith pos diff Time Complexity is O(n^2). Atlast the Optimized approach is to do three check one what if its equal other what if nums[i] > target[i] that means we need a minus operation and atlast what if nums[i] < target it signifies we need a positive operation. Submission link : https://lnkd.in/gC3d56FG #leetcode #cpp #problem #coding

#GaussianSplatting #VFX in 4K. Here’s the new version featuring 2 little crew members, compared to the previous video I posted. All the composite layers, including the background, operators, and camera, are #Splats created from photo scans in the Garage Studio (no video footage was used in making this video). #AI processing by BTS | Behind the Stage media servers. You can also check it out on YouTube at this link: https://shorturl.at/iIe6q #RealityCapture #PostShot #AfterEffects

6:45 Task TDX Arena Cy Jump Lab (Capture the Flag) This lab was about manipulating code in the URL. Changing a number that equals how far a player can jump gives you an advantage in the game. The same goes for your blaster in the game. By changing the number in the URL your blaster will shoot faster to destroy anything in your path. Task: Complete

Might be the craziest one yet but now you can generate ANY objects. Literally any because if the model does not exist, I use SDXL Lightning to generate image for it, then use TripoSR to turn it into .glb object and import it into the game in (not so) realtime. Text-to-Image took around 1m and Image-to-3D took around another 30s. And you know what, LOCALLY. All of these are run on my machine.

How to call into managed code from Burst in Unity? Find my notes here: https://lnkd.in/d_QJwaX5

Using an existing game engine to generate Perlin noise is for n00bs. Cool people always write their own custom multi-dimensional noise generator from scratch, using only the highest-quality hash functions like SHA-512 to minimize frequency biases. Only brokies use those crufty old entropy-poor hard coded Perlin permutation tables. Pfftt.

In today's tutorial, I explain a render error code "1073741819;" what it means, and how to fix the issue, specifically with Nvidia drivers. #tutorials #houdini #houdinitutorial #houdinifx #3d #render #rendering #rendering3d #troubleshooting #error #fix #fixed #nvidia #animation Reference for Background Music https://lnkd.in/eQrfchNR https://lnkd.in/eNH2MzgR