Game Of Life 🪦💐| Daily LeetCode Challenge | Day 12 | Coding Interview

This question has been marked as medium level on leetcode which in reality should be easy. The reason is that the best complexity you can achieve is O(m*n) where m is the number of rows and n is the number of columns and the simplest brute force is giving exactly that (The solution was faster than 100% of other submissions!).




Writer (100K+ views) | Software Engineer | C++ veteran, 💜 Dart

Love podcasts or audiobooks? Learn on the go with our new app.

Recommended from Medium

AVRO schema generation with reusable fields — Data Scientists

Facebook does it. Why can’t we?

What to Know Before Building Your Industrial IoT Platform

Use These Scraping APIs For Extracting Data Without Prohibitions

Morgan Stanley Interview Experience 2021

How to install Jenkins on Ubuntu 20.04 beat Evil Geniuses at The International 10

Flood Fill Algorithm

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store
Ganesh Prasad

Ganesh Prasad

Writer (100K+ views) | Software Engineer | C++ veteran, 💜 Dart

More from Medium

Spiral 🌀 Matrix II | Daily LeetCode Challenge | Day 13 | Coding Interview

Spiral Matrix 2 | LeetCode challenge day 13 | Leetcode 59

Leetcode — Shortest Subarray to be Removed to Make Array Sorted

Leet Code — Valid Parentheses

LeetCode 200 — Number of Islands