I didn’t know there was this type of array until I tried to solve one of the coding questions that needs output something like string[][], and the second array length can be varied.
The following is the documentation of the jagged array: https://docs.microsoft.com/en-us/dotnet/csharp/programming-guide/arrays/jagged-arrays
There are a lot of materials that I want to retain in my memory, work or non work related. Currently I’m learning how to retain my memory better by following this course on Udemy. Currently Udemy has $10 pricing on most of the courses during Black Friday. The offer ends tomorrow so I suggest you to take a look and buy some while they’re still cheap.
An interesting problem from Hackerrank to detect whether a tree is a binary search tree (BST). Continue reading
Perhaps I’ll start with the problem statement. Given an unsorted array of integers, find the length of longest continuous increasing subsequence.
لَا تَئْكُلْ رُبَّمَا إِنْ أَرَدْتَ أَنْ تَقُوْلَ لَا
The translation of the above arabic phrase is:
