AstroTalk Software Developer Intern Interview Questions and Answers for Freshers

Q1. Questions about python, Sql, Basic coding questions
Add your answer

Q1. How will you handle exceptions in django framework. it was basic discussion round with the cto
Add your answer

Q1. React, React Native Basics
Add your answer
Q2. Coding Arrays & Objects
Add your answer

Q1. Oops Inheritance and Incapsulation
Add your answer

Easy level Basics were asked

Stacks queue leetcode easy level

Q1. Basic project discussion
Add your answer
Q2. Skills used in project
Ans. 
Used skills include Java, SQL, Spring Boot, RESTful APIs, and Git.
• Java programming for backend development

• SQL for database management

• Spring Boot for creating web applications

• RESTful APIs for communication between systems

• Git for version control
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Hard

Timing was late evening. Platform was good.

Q1. 
Largest Cycle in Maze Problem Statement
Given a maze represented by 'N' cells numbered from 0 to N-1, and an array arr of 'N' integers where arr[i] denotes the cell number that can be reached from the 'i'...read more
Ans. 
Identify the length of the largest cycle in a maze represented by cells and an array of integers.
• Iterate through each cell and find the cycle length using DFS or Floyd's Tortoise and Hare algorithm.

• Handle self-cycles and cells with no exit by checking arr[i] = i and arr[i] = -1 respectively.

• Output the length of the largest cycle found or -1 if no cycles exist.
Answered by AI
Add your answer
Q2. 
Ninja and the Maze Problem Statement
Ninja is stuck in a maze represented as a 2D grid. He can move in four directions (Up, Down, Left, Right) until he hits a wall ('1'). Once stopped, he can choose a new...read more
Ans. 
Determine if Ninja can reach the destination in a maze by moving in four directions until hitting a wall.
• Create a function to traverse the maze using depth-first search or breadth-first search.

• Keep track of visited cells to avoid infinite loops.

• Return 'True' if destination is reachable, 'False' otherwise.
Answered by AI
Add your answer

Q1. How set is implemented?
Ans. 
A set is implemented as a data structure that stores unique elements with no specific order.
• A set does not allow duplicate elements.

• Sets are commonly implemented using hash tables or binary search trees.

• Examples of set implementations include HashSet in Java and std::set in C++.
Answered by AI
Add your answer
Q2. How unordered set is implemented?
Ans. 
Unordered set is typically implemented using hash tables.
• Uses hash tables to store elements with unique keys

• Provides constant time complexity for insertion, deletion, and lookup operations

• Does not maintain any specific order of elements
Answered by AI
Add your answer

Q1. Sql join questions
Add your answer
Q2. Python decorartors
Add your answer