Given a sorted array of distinct integers and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order. You must write an algorithm with O(log n) runtime complexity. Example 1: Input: nums = [1,3,5,6], target = 5 Output: 2
Software Developer Python Interview Questions
6,380 software developer python interview questions shared by candidates
Explain static void public in python
DS, Database and Design Problems
Q: Mysql index. the difference of Innodb and MyISAM Q: data structure of redis and their implement
Pouvez-vous nous présenter votre expérience avec Django et Django REST Framework ?
I do want to disclose
Batería de preguntas técnicas de lo que necesitaba el cliente, apuntaba sin parar, parecía que marcaba una lista de checks. No fluía una conversación.
The first one was 4 questions on code signal, and you have to answer to proceed in person. The second one was an interview with an employee to dig into your past work and also questions about finding the top 5 performing stores in a chain of stores.
- Tell me about your previous projects - Are these things applicable in our projects? - What problems do you see if we were to implement your solutions? - Do you have experience in automatic testing? - Code challenge: c1 = [1, -2, 3, 5, 6, 765, 23, 867, 23] c2 = ["sunday", "b", "asdf", "sunday", "sunday", "sunday", "af", "monday", "sunday"] #WHAT TYPE of "data structure" is this data above? #select avg(c1*c1) from tab where c2='sunday' # Implement the line above in python # WHAT COULD GO WRONG in your solution (SPOILER: DivBy0)? # What would a db return in case there's an (divby0) error?
tell me about your self.
Viewing 6161 - 6170 interview questions