Freshersworld.com Software Engineer Interview Questions and Answers

DSA has 2-3 rounds depending on the team that is hiring. coding and algorithms 1 and coding and algorithms 2 and concurrency.
Topics for coding and algorithms are into Tress, Graphs
Concurrency round is all about implementing base modules

1 hour simple questions based on DSA

Q1. About your prior experience
Add your answer
Q2. Challenging task at your workplace
Add your answer

Q1. Just normal discussion
Add your answer

Q1. Find the leaves of the tree.
Ans. 
Leaves of a tree are the nodes with no children in a tree data structure.
• Traverse the tree and identify nodes with no children.

• Use depth-first search or breadth-first search algorithms to find leaves.

• Examples: In a binary tree, leaves are nodes with no left or right child.

• In a general tree, leaves are nodes with no children in their child list.
Answered by AI
Add your answer
Q2. Find the LCA of tree.
Ans. 
The Lowest Common Ancestor (LCA) of a tree is the shared ancestor of two nodes farthest from the root.
• Start from the root and traverse the tree to find the paths from the root to the two nodes.

• Compare the paths to find the last common node between them, which is the LCA.

• If one of the nodes is an ancestor of the other, then the ancestor node is the LCA.
Answered by AI
Add your answer

Q1. What projects you worked upon?
Ans. 
I have worked on projects involving web development, mobile app development, and data analysis.
• Developed a web application using React and Node.js for a client in the e-commerce industry

• Created a mobile app using Flutter for a startup in the healthcare sector

• Performed data analysis on customer behavior using Python and SQL for a marketing company
Answered by AI
Add your answer
Q2. What internships you did?
Ans. 
I completed internships at ABC Company and XYZ Company during my undergraduate studies.
• Interned at ABC Company working on web development projects

• Interned at XYZ Company assisting with software testing and quality assurance

• Gained hands-on experience in coding, debugging, and problem-solving
Answered by AI
Add your answer

It was 2 coding questions of medium level

Q1. Longest substring with non repeating characters
Ans. 
Find the longest substring in a given string that does not contain any repeating characters.
• Use a sliding window approach to iterate through the string.

• Keep track of the characters seen so far using a set.

• Update the start and end indices of the window to find the longest substring.

• Return the length of the longest substring.
Answered by AI
Add your answer
Q2. Candy problem. There is similar question in geeks for geeks
Add your answer

There were 2 questions to test our basic coding knowledge.

Q1. Some basic introduction followed by sort 2 arrays into a single array.
Add your answer

Q1. Applications of various data structures.
Ans. 
Data structures are used in various applications like search algorithms, storage systems, and graph algorithms.
• Search algorithms like binary search use arrays and trees for efficient searching.

• Storage systems use data structures like hash tables and linked lists for organizing and accessing data.

• Graph algorithms like Dijkstra's algorithm use graphs and trees for solving complex problems.
Answered by AI
Add your answer

Q1. Some basic hr questions like tell me about yourself, what do you know about magicbricks,where do you see yourself in 5 years etc
Add your answer