Software Developer

You must implement the Stack data structure using a Singly Linked List.

Create a class named 'Stack' which supports the following operations(all in O(1) time):

getSize: Returns an integer. Gets the current size of the stack

isEmpty: Returns a boolean. Gets whether the stack is empty

push: Returns nothing. Accepts an integer. Puts that integer at the top of the stack

pop: Returns nothing. Removes the top element of the stack. It does nothing if the stack is empty.

getTop: Returns an integer. Gets the top element of the stack. Returns -1 if the stack is empty

You have been given a non-empty grid consisting of only 0s and 1s. You have to find the number of islands in the given grid.

An island is a group of 1s (representing land) connected horizontally, vertically or diagonally. You can assume that all four edges of the grid are surrounded by 0s (representing water).

Ninja is a big fan of some cool sequences. Let 'A' denote a cool sequence. Ninja says a sequence is cool if the following conditions are satisfied.

Each element of the sequence should be distinct.
The sequence should be of length 'N'.
Each element should have a value between 1 to 60000. 
Let 'M' denote the sum of all the elements of the sequence and 'K' be the gcd of all the elements of the sequence then 'K' should be equal to 1 and for each element, 'A[i]' (0 <= i < 'N') gcd of 'A[i]' and 'M' should not be equal to 1.

Return any cool sequence in any order. If an answer exists, the output will be 1, otherwise the output will be 0. Nonetheless, if an answer exists, return the sequence, otherwise return -1 in an array.

Note : Assume 0-based indexing.

For example:

Let 'N' = 3.
'A' = {2, 3, 63} satisfies all the conditions of the cool sequence. 

What are your strengths and weakness?

What do you think about challenges?

What is your biggest achievement till now?

What do you know about the work ethics here in Tailnode?