SDE - 2

Given a linked list containing a series of numbers that are separated by ‘0’. You need to find the sum of the series and replace the series’s elements with its sum.

For Example :

If the given linked list is 3 ->4 ->0 ->5 ->0, you should return linked list as - 7 -> 5.

Note :

You need to replace the sum values in the linked list without using any extra space.

It is guaranteed that there will be no two consecutive zeroes in the linked list.

What is render?(Learn) 

What is dispatcher?(Learn) 

Aggregation and composition?(Learn) 

GPU Programming?(Learn)

What are Threads?(Learn) 

What are Semaphore?(Learn) 

What are Mutexes? Why are they used?(Learn)

While learning DSA, Ninja found two N-ary trees and wants to check whether they are mirror images of each other or not. But, he can’t find a suitable method to check the same. Can you help Ninja to solve this problem?

You are given two N-ary trees, ‘TREEA’ and ‘TREEB’ having ‘N’ vertices labeled from 0 to ‘N’-1, and both the trees are rooted at node 0. Your task is to find whether the trees are mirror images of each other or not. Edges of the tree are in order from left to right.

For Example:

For the given example below, the trees are mirror images of each other.

You are given a binary tree having 'n' nodes.

The boundary nodes of a binary tree include the nodes from the left and right boundaries and the leaf nodes, each node considered once.

Figure out the boundary nodes of this binary tree in an Anti-Clockwise direction starting from the root node.

Example :

Input: Consider the binary tree A as shown in the figure:

Output: [10, 5, 3, 7, 18, 25, 20]

Explanation: As shown in the figure

The nodes on the left boundary are [10, 5, 3]

The nodes on the right boundary are [10, 20, 25]

The leaf nodes are [3, 7, 18, 25].

Please note that nodes 3 and 25 appear in two places but are considered once.

Implement Visitor Pattern

Implement Singleton pattern

Difference between Singleton and Static. Implement them

What is Logger design? Implement it

Any other approach for logging other than singleton and static

How singleton is tightly coupled

Inheritance vs Association class - which one to choose - IS-A relationship choose inheritance, HAS-A choose association.

DB design

Implement No SQL based DB design

What is UML association?

Challenges faced while designing in office and my current project related questions

What are your strengths and weakness? 

Cn you list some of the challenges faced? 

Are you willing to relocate? 

What kind of work are you looking for?
Why do you want to switch? 

If you will get similar work then what will you do? 

What are the challenges faced? 

What Complexity handled in current project?

You are given a singly linked list of integers.

Your task is to swap every two adjacent nodes, and return the head of the modified, linked list.

For Example:

We have a linked list 1->2->3->4->5->6->7 and so on. You are supposed to swap pairs of a linked list like swap (1,2), (3,4), (5,6), and so on.

Note:

1. You may not modify the data in the list’s nodes; only nodes themselves may be changed. Because imagine a case where a node contains many fields, so there will be too much unnecessary swap.

2. If a pair of a node does not exist, then leave the node as it is.

Implement MOQ, Nunit