I'd rather be in outer space đ¸
No title available
Cosmic Funnies
Cosimo Galluzzi
JBB: An Artblog!
titsay
Acquired Stardust
todays bird
đŞź
â
"I'm Dorothy Gale from Kansas"
Not today Justin
Product Placement
RMH
pixel skylines
cherry valley forever
Jules of Nature
$LAYYYTER
styofa doing anything
No title available
seen from United Kingdom
seen from United States
seen from TĂźrkiye
seen from United Kingdom
seen from Malaysia
seen from Germany
seen from United States
seen from Italy
seen from Singapore
seen from United States
seen from TĂźrkiye
seen from Singapore
seen from United States
seen from United States
seen from Germany
seen from France
seen from United States
seen from India
seen from United States
seen from Brazil
@studyalgos
Is it OK to cheat using AI in interviews?
Last month I interviewed someone for a senior data-engineer role: a standard sliding-window style problem, nothing exotic. They echoed the prompt, then started typing in a handful of seconds. Under three minutes later they had an optimal, polished solutionâhonestly better than I would have typed cold. So I asked one follow-up: Why a hash map here instead of a set? About ten seconds of silence.âŚ
View On WordPress
5 Software Engineering Skills AI Canât Replace
Something strange keeps happening in software engineering discourse: every week another headline claims coding is dead. Comments under almost every technical video ask the same questionâshould I still learn to code in 2026? Some engineering skills cannot be replaced with AI. Here is a clearer picture: AI replaces tasks, not engineers. Models can draft, debug, and refactor quickly. They do notâŚ
View On WordPress
Your Resume Has Three Readers in 2026 â Only One Is Human
Why writing a resume for the recruiter alone is no longer enough â and what to do about it. When you hit submit in 2026, your resume does not go straight to a person. It takes a trip: first an automated filter, then an AI-assisted scoring pass, and only then a human hiring manager. Two of those three readers are AI-driven. Most people still optimize only for the third â which is a big reasonâŚ
View On WordPress
Your Entire Developer Roadmap in 8 GitHub Repos
Solving a programming exercise is one thing; becoming the engineer everyone turns to is another. Somewhere between âjuniorâ and âsubject matter expertâ there is a pathâbut when you start out, nobody hands you a map. This article lays out eight free GitHub repositories, in order, that together cover your developer roadmap: from choosing what to learn, to interviewing, to understanding systemsâŚ
View On WordPress
8 LeetCode Patterns to solve 2000+ problems
There are almost 3,000 problems on LeetCode. Blind 75, Blind 150, and other curated lists promise confidenceâbut the underlying structure matters more than any single list. After tagging problems by core technique, one discovery stood out: just 8 patterns cover over 2,000 problems. Not 80. Not 20. Eight. The 8 Patterns at a Glance #PatternProblemsCumulative1Two Pointers2442442SlidingâŚ
View On WordPress
Coding Interviews in 2026 â How AI Changed (and Didn't Change) the Game
Anthropicâthe company that builds Claudeâsends every engineering candidate an email before their interview: âNote that use of AI tools during this interview is not permitted.â Meanwhile, Meta hands you Claude, GPT-5, and Gemini inside the interview and says âgo ahead, use them all.â Both companies still test you on algorithms and data structures. Google puts âexperience with data structures andâŚ
View On WordPress
Serialize and Deserialize Binary Tree: Efficient String Representation
When working with binary trees, you often need to transmit or store them. You canât send a visual representationâyou need a string format that preserves the tree structure. This is where serialize and deserialize come in. Understanding these concepts is crucial for working with trees in real-world applications, from coding platforms to AI systems. Binary tree and its serialized stringâŚ
View On WordPress
Minimum Window Substring: Combining Sliding Window and Two Pointers
Hard problems often require combining multiple algorithmic concepts. The minimum window substring problem demonstrates this perfectlyâyou need to merge the sliding window technique with the two-pointer approach to achieve an efficient linear-time solution. Letâs explore how these concepts work together to solve this challenging problem. Finding the smallest substring in string s that containsâŚ
View On WordPress
Finding the Median of Two Sorted Arrays: From Brute Force to Optimal Solution
Finding the median of two sorted arrays seems straightforward at first glance. However, this problem challenges you to achieve logarithmic time complexity, making it a favorite in coding interviews. Letâs explore different approaches and work toward the most efficient solution. Two sorted arrays example showing the problem setup Visual representation of two sorted arrays that need to beâŚ
View On WordPress
The Problem with Generic LeetCode Study Plans (And How to Fix It)
If you have an upcoming interview in two weeks or two months, youâve probably found yourself staring at LeetCodeâs 3000+ problems wondering: âWhere do I even start?â The challenge is clear: you canât solve all 3000 problems, and every company prioritizes different topics. Resources like Blind 75 or Grind 75 are helpful, but theyâre static lists that donât account for your timeline, targetâŚ
View On WordPress
The Problem with Generic LeetCode Study Plans (And How to Fix It)
If you have an upcoming interview in two weeks or two months, youâve probably found yourself staring at LeetCodeâs 3000+ problems wondering: âWhere do I even start?â The challenge is clear: you canât solve all 3000 problems, and every company prioritizes different topics. Resources like Blind 75 or Grind 75 are helpful, but theyâre static lists that donât account for your timeline, targetâŚ
View On WordPress
Bit Manipulation Fundamentals: Bitwise Logical Operators (AND, OR, XOR)
Ever wondered where those zeros and ones that computers supposedly work with are actually located? While youâre writing code in high-level programming languages, the system quietly manipulates these binary digits behind the scenes. Understanding bit manipulation can make your programs very, very fast â and thatâs exactly why tech companies love engineers who master these concepts. What Are BitsâŚ
View On WordPress
Introduction to System Design
A new series on System Design!!
Welcome to my new series on System Design! This series aims to demystify the concepts of system design, making them accessible and easy to understand. Whether youâre preparing for interviews or looking to build scalable systems, this series will provide you with the foundational knowledge you need. Why System Design? System design is crucial for several reasons: Career Growth: Many companies,âŚ
View On WordPress
[Leetcode] - Maximum Product Subarray Solution
In this blog post, we'll explore the "Maximum Product Subarray" problem, where our task is to find the contiguous subarray within an array that yields the maximum product. We'll discuss the problem statement in detail and explore two approaches: the brute
In the given problem statement, we have an array of integers and we need to find the maximum product possible for a contiguous subarray. The most important part of this problem is that the elements have to be contiguous. So special attention needs to be given for negative numbers and zeroes. Input: nums = [ 2 , 3 , -2 , 4 ] Output: 6 Explanation: [ 2 , 3 ] has the largest product 6. Fig:âŚ
View On WordPress
[Leetcode] - Longest Common Prefix Solution
Most of the string based problems either revolve around a prefix or a suffix. A prefix is a character or a sequence of characters that occur in the beginning of a string. In this problem we try to find the longest common prefix in an array of strings.
In the given problem statement, we have an array of strings and we need to find the longest common prefix among them. If no common prefix exists, just return an empty string. The starting characters of any string are called as a prefix, and the last letters are called suffix. This prefix can have any length. Among a certain set of strings, a longest common prefix will be the one that exists inâŚ
View On WordPress
Introduction to Boolean Algebra with examples
Introduction to Boolean Algebra with examples
Nowadays, we are surrounded by electronic equipment that is controlled by Boolean operations. Life appears to be impossible without these tools. The sole mathematical concept that is crucial for someone who wants to study electronics and fields connected to logical electronic devices is a Boolean algebra. A collection of expressions with only two possible statesâtrue or falseâwere created byâŚ
View On WordPress
[Leetcode] - Move zeroes Solution
Given an array of positive integers with some zeroes. You need to move all the zeroes to the end without changing the relative order of non-zero elements. A unique solution makes this problem really easy to understand.
In the given problem statement, we have an integer array that may or may not have some zeroes. You need to move all the zeroes to the right of the array without disturbing the original order of all the remaining elements. We desire a space complexity of . Let us understand the problem easily by a test case. Example 1:Input: nums = [ 0, 1, 0, 3, 12 ] Output: [ 1, 3, 12, 0, 0 ] Fig: RelativeâŚ
View On WordPress