Daily Coding Problem: Pascal’s Triangles and Space Complexity

Great to hear that!

I’m sorry for the comments disappearing by the way: I’m pretty new to Hackernoon and I always forget to set free comments on posts!

But I always catch on hahaha!

Hi there! First of all thank you so much for the comment: I’m glad you found this interesting and enjoyable! I’m also on [Medium](https://medium.com/@nicola.moro2312) if you like this type of problems, feel free to check it out!

I love the fact that you ported the code from Go, great tackle! The main problem with Go is that sometimes you need to “reinvent the wheel” for simple things, like the `compareSlices` function (a primitive in most of the other languages). It’s a great opportunity to dive deep into code, though!

Surely I won’t stop writing these problems, also in other languages like Python or Java! So thank you so much again for reaching out!

\
About the solution, if I’m understanding your question correctly, the function `compareSlices` only returns true if the `array` variable (outside the for loop) is `[1]`. So it is used only to check the first case, because without that we won’t be able to build `[1,1]` from `[1]` with this procedure. In any other case the function will return false, triggering the for loop.

The space complexity holds because we don’t use any other variable, array or data structure to build the lines: we just update the variable `array` at each loop. So the space taken by the procedure is always the space taken by `array` , meaning the length of the kᵗʰ line of the triangle!

\
If I’m missing something from your question feel free to ask more and thanks again!

\


Daily Coding Problem: Remove the k-th Index From the Linked List in One Pass

Hi and thanks for your comment: I really appreciate you liked the article.

As I refer at the top of these articles (not only this one, but also other d.c.p. I wrote), I take the ideas mainly from a news-letter which proposes coding problems to tackle. The source about which company first asked this question is given in the newsletter, so I’m basically just reporting what they state. I suppose you are probably right, though: this one hardly is a real interview question.

I’ll take the Amazon reference out of the article then, thanks for the hint!

\


Daily Coding Problem: Use Your Coding Skills to Check the Checkmate

You are perfectly right, thanks for pointing it out! I wrote it with the idea of the “theoretical school case” in mind, so I was considering the king as the only piece left on the board. But sure, if there are other pieces, one should elaborate more on that piece of code!

Read My Stories

The Avalanche Algorithm — How To Calculate the Maximum Possible Path in a Binary Tree

Overlapping Rectangles: A Daily Coding Problem

Daily Coding Problem: What Angle is It? 

When You Have to Throw Eggs From the Rooftop: Daily Coding Problem

Daily Coding Problem: Computing Big Exponentials

Daily Coding Problem: Rotating Matrices

Daily Coding Problem: Minimum Coins Count

Daily Coding Problem: Next Biggest Number

Daily Coding Problem: Building an Algorithm to Calculate Huge Factorials!

Daily Coding Problem: Triangular Numbers and Big Divisors

WriteUp — Fantastic times tables

NSA Finally Admits The Purchase Of Americans’ Sensitive Data

How to Develop a DSL in Kotlin

Nicola Moro