All are Leetcode medium interview questions. I was asked problems related to binary search, trees and sliding window. The interviewers were nice and friendly, would also hint whenever they saw I was stuck or going in circles.

First round 3 questions 1hr 30min time round 2 sort the stack without using extra space and next question is give the length of the last word in a string many questions regarding my projects and simple dbms questions like what is meant by indexing

There are 2 rounds - one is coding round. Questions are of easy to medium level 1)Find LCA in binary tree 2)given an array of prime numbers and a positive integer k, consider a array of numbers whose prime factors consists of only primes given in the prime numbers list. Return the kth(1-based indexing) smallest element of the array