MedClap Interview Questions and Answers

Q1. 2 sum problem [leetcode]
Add your answer
Q2. Linkedlist problem
Ans. 
Implement various operations on a linked list and solve related problems like reversing a linked list or detecting a cycle.
• Understand the basic structure of a linked list with nodes containing data and a reference to the next node.

• For insertion, update the pointers of the nodes accordingly to maintain the sequence.

• For deletion, adjust the pointers to skip the node to be deleted.

• To reverse a linked list, iterate through...read more
Answered by AI
Add your answer

Q1. Employment history
Add your answer

45 min, general aptitude questions

Group discussion and case study on demonetisation

Q1. Confidence testing questions
Add your answer
Q2. Technical related questions
Add your answer

Q1. Why are you looking for a change?
Ans. 
Looking for new challenges and growth opportunities.
• Seeking a more challenging role to enhance my skills and knowledge.

• Interested in working with new technologies and frameworks.

• Want to be part of a dynamic and innovative team.

• Seeking better career prospects and growth opportunities.

• Looking for a company with a strong focus on professional development.
Answered by AI
Add your answer
Q2. Tell me about yourself.
Ans. 
I am an experienced Senior Front end Developer with a passion for creating user-friendly and visually appealing websites.
• Over 8 years of experience in front end development

• Proficient in HTML, CSS, JavaScript, and various front end frameworks

• Strong understanding of responsive design and cross-browser compatibility

• Experience with version control systems like Git

• Ability to collaborate with designers and backend developers...read more
Answered by AI
Add your answer

Q1. Project details and other
Add your answer

Q1. Skill sets and work profile
Add your answer

Easy basic dsa questions

Q1. Basics of dsa and project discussion
Add your answer
Q2. Stair climbing based on dp
Add your answer
Q3. Longest common subsequence
Ans. 
Longest common subsequence is the longest sequence of characters that appear in the same order in two or more strings.
• Use dynamic programming to solve this problem efficiently.

• Create a 2D array to store the lengths of longest common subsequences of substrings.

• Traverse the array to find the longest common subsequence.
Answered by AI
Add your answer
Q4. Buy and sell stock
Add your answer
Q5. Project discussion based on resume
Add your answer

He will be asking you about the logic you used to solve the OA questions. So prepare well.
He then asked questions from my resume and asked me to code and explain cycle in a linked list. I easily did the coding part using brute force and optimized approach but then he asked my to give proof that why tortoise and hare algo will work here. I explained him the mathematical proof.

Q1. In this round he started asking questions from my resume and then gave me DSA question to solve which was 523. Continuous subarray sum and then he asked me several question related to Reactjs , Nodejs , Mo...read more
Add your answer
Q2. 523. Continuous Subarray sum
Add your answer

Q1. Sql questions, analytics questions, case study
Add your answer

Q1. General discussion and introduction
Add your answer

Q1. GSC, GA, GTM, Project Handling, On-page SEO, latest trends in SEO industry
Add your answer