The first qn of coding round was something like this find smallest sum of prime pair sets where n is the length of prime no. Where 100<=n<=20000 and k is the no. Of prime no. To concatenate . Any 2 no of those pairs when concatenating should also be prime ...find the sum in sorted format ...input is n and k as single line seperated with a space
Python Developer Interview Questions
6,393 python developer interview questions shared by candidates
One question was related to linked list,reverse k nodes at a time.The second question was trapping rainwater question.Both questions are in leetcode.
Tell me about your background
Representative the directory structure in a data structure and parse the structure to represent the levels of directories
Python libraries, Rest API, Pandas
About my self , what projects I completed , soft skills and why I'm interested
How to create flask login application
What are directives in angular 2+
What are flask securities
How to convert angular js to angular2+
Viewing 4801 - 4810 interview questions