HN user

sciencewolf

241 karma
Posts65
Comments92
View on HN
www.drips.ai 3y ago

Top Solopreneur Ideas for 2023

sciencewolf
1pts0
algodaily.com 5y ago

Java Interview Questions Cheat Sheet

sciencewolf
3pts1
algodaily.com 5y ago

What I Didn't Expect to Learn from Running My Side Hustle

sciencewolf
1pts0
algodaily.com 5y ago

Blockchain Interview Questions

sciencewolf
1pts0
algodaily.com 5y ago

A Visual Guide to Understanding the Blockchain Architecture

sciencewolf
2pts0
algodaily.com 5y ago

Monoliths vs. Microservices for Junior Engineers

sciencewolf
4pts0
algodaily.com 5y ago

Understanding Mutable vs. Immutable Objects

sciencewolf
3pts0
algodaily.com 5y ago

Fundamental Sorting Algorithms: Bubble and Insertion

sciencewolf
1pts0
algodaily.com 5y ago

An Introduction to Practical Software Design Patterns

sciencewolf
3pts0
algodaily.com 5y ago

Data Structures Cheat Sheet

sciencewolf
51pts6
algodaily.com 5y ago

A Beginner's Reference to SQL vs. NoSQL

sciencewolf
2pts0
algodaily.com 5y ago

Memoization in Dynamic Programming Through Examples

sciencewolf
1pts0
algodaily.com 6y ago

A Bird’s Eye View into the Sliding Windows Pattern

sciencewolf
2pts0
algodaily.com 6y ago

How to Solve the Coin Change Problem

sciencewolf
1pts0
algodaily.com 6y ago

A Visual Guide to Solving the Longest Increasing Subsequence Problem

sciencewolf
1pts0
algodaily.com 6y ago

A Visual Guide to Reversing a Linked List

sciencewolf
3pts0
algodaily.com 6y ago

Does Studying for Whiteboard Interviews Make You a Better Engineer?

sciencewolf
1pts0
algodaily.com 6y ago

Recursive Backtracking for Combinatorial, Path Finding, Sudoku Solver Algorithms

sciencewolf
6pts1
algodaily.com 6y ago

Bitwise Operators and Bit Manipulation for Interviews

sciencewolf
3pts0
algodaily.com 6y ago

Problem Solving with Recursion vs. Iteration

sciencewolf
2pts0
algodaily.com 6y ago

Databases and SQL Cheat Sheet for Interviews

sciencewolf
2pts0
algodaily.com 6y ago

How Do We Get a Balanced Binary Tree?

sciencewolf
2pts0
algodaily.com 6y ago

Solving the Longest Palindromic Substring Problem

sciencewolf
1pts0
algodaily.com 6y ago

Debugging Abstractions: The Benefits of Mindfulness for Software Engineers

sciencewolf
3pts1
algodaily.com 6y ago

Implementing Graphs: Edge List, Adjacency List, Adjacency Matrix

sciencewolf
1pts0
algodaily.com 6y ago

What Is the Linked List Data Structure?

sciencewolf
1pts0
www.medium.com 6y ago

Insights and My Experience from My Interview at Facebook

sciencewolf
3pts0
algodaily.com 6y ago

Show HN: A Collection of Stories About People Who Landed Their Dream Tech Job

sciencewolf
6pts1
algodaily.com 6y ago

How Does DP Work? Dynamic Programming Explained

sciencewolf
2pts0
www.no.lol 6y ago

Does It Spark Joy?

sciencewolf
2pts0

As others have said, every other request is a 504 at the moment.

But for the platform itself-- pretty cool that you have file separations and visual renderings, going beyond simple code execution. I like it. I tried build something similar on algodaily.com a while back, but found that my audience wasn't that interested in creating tutorials.

Some feedback:

1) I wasn't immediately sure there were multiple steps at first.

2) Execution time is a bit slow.

3) I was monitoring the network calls and saw no requests when code executed -- are you doing this in the client? Just a heads up that there's some security vulnerabilities to be aware of.

4) The UI could use some polishing. Maybe look for a color palette that blends colors together better.

Congrats on shipping!

Hey Marc,

I'm not as cynical as notretarded, but I do wonder how you'll eventually make money. It can't be cheap to manually edit 1,000+ resumes weekly, so it does make me wonder what the end goal is and what the paid services will look like. Maybe some AI/data play?

Your blueprint to good technical resumes is super useful though-- I run a technical interview course and mentor quite a number of software engineers, will definitely share out.

I used to use the ladders all the time when looking for jobs, so thanks for creating that service too.

Hard disagree. Building, shipping, and learning from my mistakes is the only I was able to actually apply anything I learned from books. IMO the best method is to do both - start building now, and read books relevant to whatever part of the journey you're stuck on or need help with.

Totally, 100% agree with this. I would even take it one step further, and say that there are really good tools for developing this mental model nowadays. I didn't really feel like I understood what code was doing until I used tools like chrome devtools, pythontutor.com, or algodaily.com to visualize and step through iteration. It's helpful to know what's happening at each line with the call stack, variables, references, etc. -- but it can be intimidating to start. Drawing it out on paper first might be a better way to begin.

Hope this helps some people :-) I've always wanted a cheat sheet that I could print out or save as a reference. A quick scan before interview day will be sure to help you feel more confident.

Hey Jack,

Just a heads up - I tried to sign up for your mailing list but kept seeing "ERROR: Did you forget to type your email?" even after typing the email. I've tried a few different emails and also tried viewing the page in incognito mode. Hope you get this fixed soon, as I'd really love to get more of your content!

[dead] 6 years ago

When studying for interviews, I tried to use Python as much as possible for its clean syntax and expressiveness. However, it was surprisingly hard to find a "cheat sheet" where I could get a quick glance of trivial language-specific interview questions that I might get.

I created an interactive tutorial that covers the basics of Python, and possible interview questions that might be asked at the junior-mid level. It allows you to try the features as you review them. Hope you find it useful!

I actually wrote a very similar article recently: https://algodaily.com/blog/does-studying-for-whiteboard-inte...

I'm not sure how people in the comments are saying that the "advanced stuff is never used", when the author used the A* search algorithm at work! I'm especially fond of this passage:

You should also know about basic data structures that are pretty common, like hashtables, queues, or stacks. But specific algorithms like Dijkstra or A* are not ones you'd need to memorize: you'll have a reference for this, just like I had when implementing crypto.

Everyone complains about the lack of applications for these interviews, but there's not really an expectation to go beyond the fundamentals.

Backtracking is a very important concept, especially in whiteboard coding interviews. It is also often used to identify solutions that satisfy a given constraint.

After learning backtracking, I found that it changed the way I thought about problems. Rather than trying to "conjure up" a magical, efficient solution-- backtracking is actually the process of iteratively finding many solutions, without wasting time on ones that don't work.

We created this tutorial to help beginners understand the power of this technique. We try to accomplish this by walking the reader through increasingly difficult examples, showing how we can efficient backtrack our way to the right solution.

Thanks so much for the heads up :-) It's amazing how much of the user's perspective you miss when you're heads-down in code all day.

I've added some navigational indicators to hopefully make it a little clearer that you can press the footer buttons or swipe on the screen. Appreciate the friendly feedback!

I think I'd agree, but my argument is that going from a medium problem solved "pretty easily in a bad way" to a "fully optimized and efficient way" is easier than most people think. There's only a dozen or so patterns needed.

As an example, if you know the two pointer technique (https://algodaily.com/lessons/using-the-two-pointer-techniqu...), you're well on your way to solving at least 1/3 to half of array problems in a performant manner.

You need to figure out _why_ you can't do medium problems. If you can solve easy ones, it means you have the fundamentals down, and probably just need more exposure.

250 sounds like a lot, but I'd also be curious how you do the problems, and why you're having issues.

Where are you getting stuck? Are you looking at the answers immediately? Or are you struggling through the problem, and only peeking at hints as much as is needed to make a breakthrough?

Do you think through and recognize the patterns (two pointer, greedy, dynamic, etc) that are needed to tackle the problem, or are you just jumping into code instantly?

What do you do when you get stuck? Do you confidently ask for help, knowing hints are part of the game?

How's your timing? Are you getting in a brute force solution and an optimized one?

Addressing these concerns will reveal where you need work, and then you can continue to get better without being too affected by your current state. Remember, no one was born knowing how to solve these problems, so you can always get better and reach your economic goals.

Small plug -- we created AlgoDaily (https://algodaily.com) to teach programming interview skills using a visual, patterns-based approach. The lessons on approaching the interview and how to prepare might be especially helpful.