LATEST
There was a question that required me to modify the Binary Search algorithm as
required.
Another question dealt with traversal, reversal, and intermingling of two Linked
Lists.
They asked to introduce myself and some questions about my achievements and FYP.
How would I deal with some of the challenges associated with the job?
What can you contribute to this company?
Can you give us a brief introduction?
If you face a deadline and your work is not complete what will you do?
What were your tough times and how did you manage?
What does it mean by professionalism to you?
What do you want to do in the future?
They asked me about my preferred stream of content.
====================================
Remove nodes from a binary tree outside a given range.
how would you handle x.y.z scenario
What can you contribute to this company
If you face a deadline and your work is not complete what will you do?
What were your tough times and how did you manage?
What does it mean by professionalism to you?
What do you want to do in the future?
Can you give us a brief introduction?
What are my expectations with this job position, and why I want to be the part of
this team?
What functionality would you add to the Educative's website.
============================
There were 7 technical questions in the interview.
1. Rotation of arrays elements ---------------
2. Construct Doubly LinkedList from BST ----------------
3. Pushing element of singly linked list into Stack in reverse order ---------
4. Finding Kth last element in Binary Search Tree ----------
5. Finding median in constant time complexity
=======================
How can two singly linked lists merge at less than O(N) time?
Show that the given tree is a valid BinarySearchTree. -------------
Different problems related arrays, link list, BST and Hashing.
======================
1- Find mid node in Singly Linked List. ========
2- Mirror a Binary tree. -----------
3- Return the nth last node in Singly Linked List. ======
4- Return the second last node in Doubly Linked List.
5- Merge two sorted arrays.
================================
Interview Questions
===1st Interview===
1: Find largest sum subarray in an arbitrary array.
2: Find all possible combinations of a given
sum. !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
eg. 4 = 1,1,1,1 1,1,2 1,3 2,2
===2nd Interview===
3: Find second maximum in a BST.
Restrictions: Cannot use any DS. Should be less than
O(n) average. Do it recursively. !!!!!!!!!!!!!!!!!!!!!1
4: Write a function to see if brackets are balanced or not.
Restrictions: Cannot use any Datastruct. Should not be
greater than O(n). !!!!!!!!!!!!!!!!!!!!!!!!!!!
Examples: "{}" => true, "{{}}{}" => true, "{{}}" => true,
"{}{}}" => false, "{}}}{{}" => false
===3rd Interview===
5: Write a Function to print first non repeated (unique)
character in a string
e.g: "aBnnN$$a" --> returns 'B'
6: Find if there is a loop in a linked list.
7: Print the sum of all nodes on the nth level of a binary
tree.
===Interview with the CTO===
This interview was a conversation about me, my projects, the company and specially
about the product.
What features can be added or improved?
Where I see myself in 5 years?
Discussion about the possibility, pros and cons of a Mobile App.
The CTO explained in detail what is expected from me by the company, the work
culture, what my goals should be at the company etc.
==========================
Q1: Check whether a given tree is binary search tree or not.
Q2: You have been provided with a stack containing non sorted values. Return the
stack with sorted values either in ascending or descending order.
Constraint: You can only use stacks and no other data structure.
Q3: Given an array filled with integers from 1 until N, find the missing number.
Q4: Given head of a linked list, return the list in an alternating fashion. That is
take one node from front and one from back.
Q5: Given three sorted arrays, find the smallest common element present in all
three arrays in linear time and constant space.
===================================
Interview Questions
Find majority element in an array list
Swap two nodes in a linked list
Find the largest sum sub-array from an integer array
Check if a singly linked list is a palindrome
Determine whether two specific nodes are cousins in a binary tree
Check if two string arrays are flippable
Check if a string has balanced brackets without using any data structures
Delete a value from a singly linked list, with no access to the head/tail of the
list
Construct a height-balanced binary search tree from an integer array
====================================