Unreal Engine’s Post

In my today's challenge in Hacker Rank I solved list comprehensions! You are given three integers x,y and z representing the dimensions of a cuboid along with an integer . Print a list of all possible coordinates given by(i,j,k) on a 3D grid where the sum of i+j+k is not equal to n . Here 0<=i<=x,0<=j<=y,0<=k<=z . Please use list comprehensions rather than multiple loops, as a learning exercise.

Do you want to learn how I solved it? Just leave a reaction and ask for explanation and will do.

I admire both Adam and Kevlin in what they share with technical community. And while I haven't read Adam's book yet, I know some of its content through his presentations available on YouTube. A nice quote from Kevlin's foreword: "There are the personal stories that accompany each individual connected to the software, whether developer or manager, architect or customer. These are the successes, frustrations, weddings, children, delights, losses, fashions, ups and downs of well-being, and all those things we call life that make up the backdrop against which code is written, heads are scratched, whiteboard discussions are had, bugs are fixed, and logs are puzzled over. For those involved in the creation of software, the stories of the code and the stories outside the code are woven together. Software development is made of people." #softwaredevelopment #softwaredevelopmentlifecycle

Participated in GeeksforGeeks Rated Contest 159 Here's the intuition behind some of the problems I tackled: Q1: Sorting Item > Build BlackBox that return Number to column String (Similar Idea exists in Leetcode),and sort Based on Number Q2: Bridge to Bits I created a dp[1e5][64] array. The key was to count columns with zeroes and store the minimum one. This approach ultimately provided the answer. Q4: Candies Distribution This problem was solved using partial prefix sums combined with binary search. Similar ideas and questions can be found in the CSES Problem Set, specifically related to standard segment trees. Here's a link to a relevant problem: CSES Problem Set - Range Update Queries.

Day: 1 Today, as part of my challenge to solve the Top 150 Interview Questions from LeetCode, I solved these three problems: 1. 125. Valid Palindrome: Used a basic brute force technique. [My Solution: https://lnkd.in/gZ3AfPFR] 2. 392. Is Subsequence: Used a basic brute force technique. [My Solution: https://lnkd.in/gPNY_NaF] 3. 167. Two Sum II - Input Array Is Sorted: Used a hash map, as the normal brute force approach was giving a TLE. [My solution: https://lnkd.in/gzZpikDv]

Day 79: 100 Days of LeetCode Today, I solved Problem 142, Linked List Cycle II. I used Floyd's Tortoise and Hare algorithm to detect a cycle in the linked list and then identified the starting node of the cycle. This problem helped me improve my understanding of cycle detection and pointer manipulation in linked lists.

The final part of my 5 part interview with Adam Bien is up now: https://lnkd.in/drYpgDUC In this part we talk a lot about debugging and the various processes used to track an issue in production.

Day 12 : #30daysofcode GeeksforGeeks : Implement strstr Today I have solved a very basic. Implement strstr where The function returns an integer denoting the first occurrence of the string x in s. Github (solution) : https://lnkd.in/dpE9bhJJ #day12 #gfg

The new Rust video is out. In this one, we'll start discussing about error handling and the panic! macro. We will make a couple of examples and we will talk about unrecoverable errors and how to check the backtrace. https://lnkd.in/d4SUFRta

Before jumping on the bandwagon of the latest tech trends, make sure to take a step back and think about the problem you're trying to solve. Not every trendy technology will be the solution you need. #TechAdvice #ProblemSolving