Hi All,
I took a long break from applying to companies and was enjoying my stay at Cognizant. Now, as I have started applying again and looking forward to a switch I promise again to flood you with my interview experiences again.
So, the first interview I was scheduled for was from SymphonyAzimaAI. The HR was really very humble and postponed my interview by a week owing to my fever. The job role was of Back End Developer. I have been into a different domain currently hence I was initially reluctant to appear for the interview but in one of my discussions with HR, I got to know about the scope of internal transition into AI and ML-related departments in the company. Since I am an ML enthusiast I decided to take on the interview.
The interviewer called in the evening as preplanned and first asked me about my wholesome professional experience.
Below are the technical questions I was asked and how I answered them
1. Tell me the difference between methods Put and Post
This is certainly uncommon as people generally ask about the difference between Get and Post. I stumbled with this question but and struggled to describe Put. Though I have used it often for an update I couldn't explain it clearly.
2. What are the different information that you send in a request header?
I have known it for a while and could name a few based on my memory.
3. Can You describe the role of the header content type available in the header?
This was easy for me as well. It basically describes the type of content the request body contains.
4.Suppose you have been given an array and an integer N. Your task is to get the first pair whose summation gives the integer.
I solved it using a brute force approach but the interviewer wanted me to solve the same using an approach of lesser complexity. I tried to come up with a solution but couldn't think of any at that moment.
After a while, I was interrupted and he explained the solution. This problem could be solved using O(1) in the best case and O(n) in the worst case. If you iterate the elements in the array and for every element, you take the difference of that element from N and see if the value exists in the array. If it exists then break or continue.
m - length of the array
arr - array
N - the integer
for i from 0 to m-1
if exists (N-arr[0]) in arr
pos=i
break
This was easy but still, I couldn't solve it owing to my detachment from solving such problems for a long time.
I was then asked if I had any qualms. I asked about the growth opportunities at SymphonyAzimaAI for a new joiner. I had a feeling that I couldn't make it for the last problem and I was informed the same after a week.
Albeit, it was a great learning experience for me and I continued to work on my weaker areas by solving a coding problem on regular basis. I took the 30 days coding challenge in hackerrank and also enrolled for a course on DS and Algo in Udemy.
I now feel more confident and looking forward to encountering more opportunities.
Comments
Post a Comment