• Skip to main content
  • Skip to footer
  • Home
  • Become An Aficionado (Join Our Mailing List)
BMA

BeMyAficionado

Inspire Affection

Ad example

problem-solving

Advent Of Code 2020 – Day 7 – Handy Haversacks

December 18, 2020 by varunshrivastava 2 Comments

Advent of Code 2020 - DAY 7

Finally, Directed Weighted Graphs have made their way to the Advent Of Code 2020 on Day 7. If you are unfamiliar with graphs then I highly recommend you to go through the below articles: Undirected Graphs and Graph Processing This above article will give you enough information to get you started with today's problem. On this note, let's start with today's problem. We … [Read more...] about Advent Of Code 2020 – Day 7 – Handy Haversacks

Advent Of Code 2020 – Day 6 – Custom Customs

December 17, 2020 by varunshrivastava Leave a Comment

Advent of Code 2020 - DAY 6

This problem was a bit hard to understand at first because the information is not directly given, you have to derive it from the given input. The story goes like this, your aeroplane has reached a regional office where you will switch to a much larger plane, custom declaration forms are distributed to passengers. The form asks a series of yes-or-no questions marked from … [Read more...] about Advent Of Code 2020 – Day 6 – Custom Customs

Advent Of Code 2020 – Day 5 – Binary Boarding

December 16, 2020 by varunshrivastava Leave a Comment

Advent Of Code Day 5 - Binary Boarding

You've made it through the passport verification phase. Now, it's time to board the plane. You board the plane but then you realize that you have dropped your boarding pass. So, how are you going to handle this situation. Well, you are a developer, you know only one thing and that is to write code. That is what you are going to do. Somehow, you scanned all the nearby … [Read more...] about Advent Of Code 2020 – Day 5 – Binary Boarding

Advent Of Code 2020 – Day 4 – Passport Processing

December 12, 2020 by varunshrivastava Leave a Comment

Advent of Code 2020 - DAY 4 - Passport Processing

I just love the way Eric Wastl links the story. This time it's about passport processing. Do visit the link to read the story and understand the task better. But at a high-level, you need to understand this - there are two types of documents: North Pole CredentialsPassport The passport scanner machine is slow and facing some problem detecting which passport have … [Read more...] about Advent Of Code 2020 – Day 4 – Passport Processing

Advent Of Code 2020 – Day 3 – Toboggan Trajectory

December 12, 2020 by varunshrivastava Leave a Comment

Advent of Code 2020 - DAY 3

Great job reaching here so far. Finally, we've logged in to Toboggan successfully, now we have to travel to the airport through a jungle. The path is not very good and has a lot of trees. So, here comes our next task. The trees in this area only grow on exact integer coordinates in a grid. You make a map (your puzzle input) of the open squares (.) and trees (#) you can see. … [Read more...] about Advent Of Code 2020 – Day 3 – Toboggan Trajectory

Advent Of Code 2020 – DAY 2 – Object-Oriented Way

December 9, 2020 by varunshrivastava Leave a Comment

Advent of code day 2 - Password Philosophy

The Password Philosophy is the topic of today's discussion. Since there is not much to do with today's problem apart from the string parsing, I thought of doing it in an object-oriented way. The problem statement is mostly based on the string parsing. You will get a list of lines with the password and password check policy. The task is to parse the policy and password from … [Read more...] about Advent Of Code 2020 – DAY 2 – Object-Oriented Way

Almost Sorted Hacker Rank Problem (Medium Difficulty)

November 27, 2020 by varunshrivastava Leave a Comment

Hackrank-Problem-Almost-Sorted-Medium-Difficulty

Recently I came across this problem in hacker rank. This problem is really fascinating as it teaches you to handle a lot of edge cases and variables at the same time. So, I thought of writing an article on this one. I hope you will enjoy it as much as I enjoyed solving it. Simplified Problem Statement You will be given an array of N integers. This array could be … [Read more...] about Almost Sorted Hacker Rank Problem (Medium Difficulty)

Footer

Become an Aficionado

BeMyAficionado is all about helping you connect, grow, and make an impact—one idea at a time.

Join our mailing list for exclusive how-to guides, insider stories, and free e-books.

Get first access to new posts, tools and resources we only share with subscribers.

Join 874 other subscribers

Recent

  • Is The Cosmos a Vast Computation?
  • Building Semantic Search for E-commerce Using Product Embeddings and OpenSearch
  • Leader Election with ZooKeeper: Simplifying Distributed Systems Management
  • AWS Serverless Event Driven Data Ingestion from Multiple and Diverse Sources
  • A Step-by-Step Guide to Deploy a Static Website with CloudFront and S3 Using CDK Behind A Custom Domain

Search

Tags

Affordable Hosting algorithms amazon aoc-2020 believe in yourself best database earn money blogging education elementary sorting algorithms experience fashion finance Financial Freedom food friends goals google india indian cuisine indian education system java life life changing love make money microservices motivation oops podcast poor education system principles of microservices problem-solving programmer programming python reality seo spring success success factor technology top 5 typescript wordpress

Copyright © 2025 · Be My Aficionado · Log in

Go to mobile version