post order traversal of a Binary Search Tree Follow up Create a BST from this post order traversed array and write test cases for this function
Perguntas de entrevista de Software Development Engineer In Test Sdet Ii
359 Perguntas de entrevista compartilhadas pelos candidatos | software development engineer in test sdet ii
Reverse each word of the string without reversing the order of the words this is a test BECOMES siht si a tset
Remove all characters of a string from another string. The algorithm should be less than O(m*n) where m & n are lengths of strings and the space used should be less than O(m+n).
Q: By share screen, please create code to reverse each words in a sentence.
how to reverse words in a string preserving the formatting
The interviewer confused me like hell when describing the question. Every node of the tree has a pointer to its left most child. each node has a pointer to its next sibling. Its a BST. Find the smallest value in the tree.
Find out the number of connected cells in a 2D array
Given a BST find the second largest element?
Given the definition of a Fibonacci sequence, write a function to give the n-th term of the sequence.
Q: Most challenging part of coding you have
Exibindo 1 a 10 perguntas de entrevista
Veja perguntas de entrevista para vagas semelhantes
Software Development Engineer In Test SdetSenior Software Development Engineer In Test SdetSoftware Automation Test EngineerSenior Software Test Automation EngineerSoftware Development Engineer In TestSenior Software Development Engineer In TestSenior Software Test EngineerSenior Software Systems Test EngineerSoftware Automation TestingSoftware Development Test EngineerSoftware Test Automation EngineerLead Software Test EngineerSenior Automation Test EngineerSenior Software Qa Test EngineerSoftware Test EngineerSoftware Qa Automation EngineerSelenium Automation Test EngineerSenior Software Engineer In TestSoftware Quality Assurance Test Engineer