Fourkites SDE Intern Interview Questions and Answers

Assignment to develop a prototype

Q1. Face to face questions
Add your answer
Q2. Java Question Technical & coding
Add your answer
Q3. Mongodb & Mysql Question
Add your answer

Will be given Requirement to write code for Restraunt. Based on that have write code for delivering orders by delivery boys.

Q1. OOPS Concepts, Java Basics, Collections, MultiThreading
Add your answer

Q1. Shortest path sum with negative integers allowed in matrix. Path starts from top left to bottom right.
Ans. 
Use dynamic programming to find the shortest path sum with negative integers allowed in a matrix.
• Implement dynamic programming to store the minimum sum at each cell

• Consider negative integers when calculating the sum of the path

• Start from the top left cell and iterate through the matrix to find the shortest path sum
Answered by AI
View 1 more answer

Q1. Write spring code
Ans. 
Spring code is used for building Java applications with ease and efficiency.
• Use @ComponentScan annotation to automatically detect and register Spring beans

• Use @Autowired annotation for dependency injection

• Use @RequestMapping annotation to map HTTP requests to specific handler methods
Answered by AI
Add your answer
Q2. Design pattern questions asked
Add your answer

Q1. Linux commands,
Add your answer
Q2. Cloud technologies different services (iaas, paas, saas)
Ans. 
Cloud technologies offer different services like IaaS, PaaS, and SaaS for varying levels of control and management.
• IaaS (Infrastructure as a Service) provides virtualized computing resources over the internet, such as virtual servers and storage.

• PaaS (Platform as a Service) offers a platform allowing customers to develop, run, and manage applications without dealing with infrastructure.

• SaaS (Software as a Service) deli...read more
Answered by AI
Add your answer
Q3. What do you know AWS
Add your answer

There was coding test

Q1. 2 technical rounds
Add your answer
Q2. Merge sort algorithm
Ans. 
Merge sort is a divide and conquer algorithm that divides the input array into two halves, sorts them separately, and then merges them back together in sorted order.
• Divide the input array into two halves

• Recursively sort each half

• Merge the sorted halves back together
Answered by AI
Add your answer

Q1. Leetcode Easy question
Add your answer

It was a Basic Aptitude Test

We were asked to do Sorting, SQL queries (join)

Q1. Can you tell me about yourself?
Ans. 
I am a passionate software engineer with 5 years of experience in developing web applications using various technologies.
• 5 years of experience in software development

• Proficient in developing web applications

• Skilled in using various technologies such as Java, JavaScript, and SQL
Answered by AI
Add your answer