Software Engineer

You have been given a string STR and a non-empty string PTR. Your task is to find all the starting indices of PTR’s anagram in STR.

An anagram of a string is another string which contains the same characters and is obtained by rearranging the characters.

For example: ‘SILENT’ and ‘LISTEN’ are anagrams of each other. ‘ABA’ and ‘ABB’ are not anagram because we can’t convert ‘ABA’ to ‘ABB’ by rearranging the characters of particular strings.

Note:

1. Both STR and PTR consist of English uppercase letters.
2. Length of string 'STR' will always be greater than or equal to the length of string ‘PTR’.
3. In case, there is no anagram substring, then return an empty sequence.
4. In case of more than one anagrams, return the indices in increasing order.

You have been given a Binary Search Tree of integers with ‘N’ nodes. You are also given data of a node of this tree. Your task is to delete the given node from the BST.

A binary search tree (BST) is a binary tree data structure that has the following properties:

• The left subtree of a node contains only nodes with data less than the node’s data.

• The right subtree of a node contains only nodes with data greater than the node’s data.

• Both the left and right subtrees must also be binary search trees.

Example:

For the given BST, if we want to delete the node with data 5 :

The modified BST will be:

Please notice that another valid answer is:

Note :

1. The node which we want to delete will always be present in the given tree.

2. If after deletion the tree becomes empty, print -1.

Introduce yourself (which programming language you prefer, etc.).
What is threading? Anywhere you have used it? Why use processes when we have threads?
Why C++? C++ vs python questions were asked like which consumes more space.

What are ACID properties? Are modern databases always consistent? If one server talks to another, and that one talks to another, and they don’t have the copies of each other’s DB in their local buffers, can it lead to an inconsistent state? (In short study OS, and DBMS well).
Given a tree and a target node’s address, find all of its cousins. (Can only use recursive stack space, no queue, no map, only recursive stack space allowed).
Given a table consisting of employee_id, employee_name, and manager_id (who is itself an employee), write SQL query to get the names of all employees and their managers. (famous question)