Timeline for Find sum of neighbors in a 2D array
Current License: CC BY-SA 4.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 16, 2019 at 12:05 | answer | added | FTorrado | timeline score: 3 | |
| Jun 16, 2019 at 11:16 | answer | added | kockburn | timeline score: 4 | |
| Jun 15, 2019 at 22:17 | history | edited | RamaM | CC BY-SA 4.0 |
added 408 characters in body
|
| Jun 15, 2019 at 21:16 | history | edited | Oh My Goodness | CC BY-SA 4.0 |
punctuation and formatting
|
| Jun 15, 2019 at 17:38 | comment | added | RamaM | For edge cases i am taking care of -ve cordinates like if row/col is a -ve integer . Wanted to know if there are any other edge cases. And also if there are better ways to solve this problem as I am using nested for loops. @Mast i think the above will work for all inputs till the row/col are given as intergers. | |
| Jun 15, 2019 at 17:37 | comment | added | Mast♦ | What happens if the input is not a number? Is that as intended? | |
| Jun 15, 2019 at 17:22 | history | edited | dfhwze | CC BY-SA 4.0 |
readability
|
| Jun 15, 2019 at 16:57 | comment | added | dfhwze | Since you ask about edge cases, I would expect that you have thought about them and have prepared some unit tests. Could you add the code of your unit tests? | |
| Jun 15, 2019 at 16:55 | review | Close votes | |||
| Jun 18, 2019 at 18:28 | |||||
| Jun 15, 2019 at 16:43 | comment | added | RamaM | This is my first post. Any comments is appreciated. Thank you! | |
| Jun 15, 2019 at 16:40 | review | First posts | |||
| Jun 15, 2019 at 16:57 | |||||
| Jun 15, 2019 at 16:38 | history | asked | RamaM | CC BY-SA 4.0 |