Software Engineer

How constructors are called?

Explain Volatile Keyword.

Explain Banker's Algorithm with example.

Ninja has given a list of unique words 'WORDS' of size 'N' and he wants to find all the words in the list formed after concatenating two or more words in the same list.

As Ninja's best friend, he asked you to help him with the above problem. So, your task is to find all words in the list which are formed after concatenating two or more words in the same list.

Print words in any order.

Note: One word can be concatenated multiple times. It is guaranteed that there is at least one word in the list, which is formed after concatenating two or more words.

Example:

Input: 'WORDS' = ["ninjas", "coding", "codingninjas"]
Output: ["codingninjas"]

Only word "codingninjas' is formed after concatenating two or more words in the list i.e "coding" and "ninjas".

Given a singly linked list of 'N' nodes. The objective is to determine the middle node of a singly linked list. However, if the list has an even number of nodes, we return the second middle node.

Note:

1. If the list is empty, the function immediately returns None because there is no middle node to find.
2. If the list has only one node, then the only node in the list is trivially the middle node, and the function returns that node.

A doubly-linked list is a data structure that consists of sequentially linked nodes, and the nodes have reference to both the previous and the next nodes in the sequence of nodes.

You are given a sorted doubly linked list of size 'n'.

Remove all the duplicate nodes present in the linked list.

Example :

Input: Linked List: 1 <-> 2 <-> 2 <-> 2 <-> 3

Output: Modified Linked List: 1 <-> 2 <-> 3

Explanation: We will delete the duplicate values ‘2’ present in the linked list.

fun()

{ static int i = 0; i++ fun()}

What is o/p of i and what do you understand by static keyword?

Explain Memory Layout of C Programs.

CTC Discussion. 

Availability to join from Hyderabad. 

Education backgrounds.