convert infix to postfix (Input: A + B * C + D Output: ABC*+D+ Input: ((A + B) – C * (D / E)) + F Output: AB+CDE/*-F+ print repeating in o(n)(input-1,2,3,4,2,3,5, output-2,3}

Question we’re on writing programs based on data structures and algorithms 1. Find target sum index of given list 2. Best time to sell shares problem

*DSA and Coding* Two coding questions: - max and min occurance in a string - pairs whose sum = x in an int array *Testing* Asked to define test strategy and test cases for business case: - Watsapp group creation feature - Big billion day *Quality Assurance* Asked to define test strategy and test cases for business case. Discussion went deep into code level: - New microservice in an existing product *Coding & Language Internals* One coding question and test framework questions (what you are interviewed) : - move all negative numbers to left end of integer array - Loads of language questions were also asked *Coding & Structural Understanding* One coding question and asked to define and write framework level of functional structure for a given problem. - Remove all vowels - Write code structure of printer functionality (more of how dev would write it using OOPs concepts and SOLID principles) *Manager* Scenario based test strategy questions were asked assuming you are leading the test efforts in a project *Director* More of less similar to manager round with some questions from past experience