There are total 4 programming question

            Two questions are easy and  two are medium level. All are standard questions like
			1. Longest increasing subsequence
			2. Word Compression
			3. Last remaining element
			4. 4th one is like 
				For strings and an integer k, a selection of substrings is valid if the following conditions are met

				The length of every substring is greater than or equal to k
				Each substring is a palindrome.
				No two substrings overlap.
				Determine the maximum number of valid substrings that can be formed from s.

         I am able to solve 3 completely and the 4th one partially accepted.

           Interview start with the Normal introduction part.

           The interviewer start with giving 2 coding questions, they use their coding platform (codebunk)

           Program 1: Theory part of BST, how it works and then question statement is -

					  Check given binary tree is valid BST or not and how the optimal solution can work.

					  Link: https://leetcode.com/problems/validate-binary-search-tree/

           Program 2: This question to array related can say a kadane Algorithm Question (Complexity)

                       Maximum Subarray sum: https://leetcode.com/problems/maximum-subarray/
					   
					   
          Then Theory questions are :

			How does memory allocation work in the program (static and dynamic memory allocation)
			Then OOPS concept theory part, deep down in abstraction part
			Java String declaration difference Example
			String str = “abc”;
			String str = new String(“abc”);
			
			

           The interview started with a simple question – “Tell me about yourself”.

           Theory Questions:

				Difference Between Array and Linked List
				DBMS – ACID properties and give real-life examples.
				OS – Deadlock Condition, the difference between thread and process, semaphores, Mutex
				Networking – HTTP request, DNS, how TCP works, how all process works and more question
				Finally a programming Question:

	Make a library system where it can store 50 songs at most.

	If a song is played or added then

	Condition 1: if library size is less than 50 then just add

	Condition 2: if this song already exists in the library then remove it from where it is, and come on the top part.

	**All Insertion and deletion parts should be done in O[1] time Complexity.

	You can use one and more data structures.

	(I use Queue and Hashmap for solution)