Software Engineer Intern Trainee
30+ Software Engineer Intern Trainee Interview Questions and Answers
Q1. find average salary of employees from given table for each designation where employee age greater than 30
Calculate average salary of employees over 30 for each designation.
Filter employees with age > 30
Group employees by designation
Calculate average salary for each group
Q2. If you prepare OOPS,Data Structures it would be better to crack but can't did it and as usual they have final roundd
Preparing OOPS and Data Structures is crucial for cracking interviews, but not being able to do so doesn't mean you can't succeed in the final round.
Focus on showcasing your problem-solving skills and ability to learn quickly during the final round.
Highlight any relevant projects or experiences that demonstrate your technical abilities.
Be honest about your areas of weakness and show a willingness to improve and learn.
Practice coding problems and algorithms to strengthen your ...read more
Software Engineer Intern Trainee Interview Questions and Answers for Freshers
Q3. What language you prefer? OOPS in your preferred langauage.
I prefer Java for its strong OOP principles and widespread use in industry.
Java is my preferred language for its object-oriented programming capabilities.
I appreciate Java's encapsulation, inheritance, and polymorphism features.
Examples of OOP in Java include creating classes, objects, and implementing interfaces.
Q4. Given a binary tree, return false if there exists any node such that it has two children and left node has value greater than right, else return true.
Check if any node in binary tree violates left node value less than right node value rule.
Traverse the binary tree using depth-first search (DFS) or breadth-first search (BFS) and check each node for the given condition.
If a node has two children and the left child's value is greater than the right child's value, return false.
If no such node is found, return true.
Example: For a binary tree with nodes 5, 3, 7, 2, 4, 6, 8, the node with value 7 violates the condition as its lef...read more
Q5. How do you handle large datasets using MongoDB?
Handle large datasets in MongoDB by sharding, indexing, and using aggregation pipelines.
Use sharding to distribute data across multiple servers for horizontal scaling.
Create indexes on frequently queried fields to improve query performance.
Utilize aggregation pipelines for complex data processing and analysis.
Consider using MongoDB Atlas for managed sharding and scaling capabilities.
Q6. How would you design this item storage app
The item storage app should have a user-friendly interface and efficient search functionality.
Design a simple and intuitive user interface with easy navigation.
Include a search bar for quick access to items.
Implement a categorization system for easy organization of items.
Allow users to add, edit, and delete items.
Incorporate a barcode scanner for easy item input.
Ensure data security and privacy.
Consider cloud storage for easy access across devices.
Share interview questions and help millions of jobseekers 🌟
Q7. solve a DS problem (string manupulation)
Reverse the order of words in a sentence
Split the sentence into an array of words
Iterate through the array in reverse order and append each word to a new array
Join the new array of words back into a sentence
Q8. Differentiate between Horizontal and Vertical Scaling.
Horizontal scaling involves adding more machines to distribute load, while vertical scaling involves increasing resources on a single machine.
Horizontal scaling adds more machines to handle increased load
Vertical scaling increases resources on a single machine
Horizontal scaling is more cost-effective and easier to implement
Vertical scaling may have limitations in terms of scalability
Example: Adding more servers to a web application for horizontal scaling, upgrading CPU on a s...read more
Software Engineer Intern Trainee Jobs
0Q9. Remove duplicate characters from a string efficiently.
Use a hash set to efficiently remove duplicate characters from a string.
Create a hash set to store unique characters.
Iterate through the string and add each character to the hash set.
If a character is already in the hash set, skip it.
Convert the hash set back to a string to get the result.
Q10. how do we measure code quality?
Code quality can be measured through various metrics and tools to ensure readability, maintainability, efficiency, and reliability.
Use code review processes to assess adherence to coding standards and best practices
Utilize static code analysis tools to identify potential bugs, code smells, and security vulnerabilities
Measure code complexity using metrics like cyclomatic complexity and maintainability index
Track code coverage with unit tests to ensure adequate test coverage
Mon...read more
Q11. Create linked list and do all it's operations (add/delete) nodes.
Implement linked list with add and delete operations in a software engineer interview.
Create a Node class with data and next pointer
Implement methods to add nodes at the beginning, end, or at a specific position
Implement methods to delete nodes by value or position
Q12. What programming languages do you know?
I am proficient in Java, Python, and C++.
Java
Python
C++
Q13. Alternative character replacement in a string
Replace alternative characters in a string with a specified character
Iterate through the string and replace characters at odd indices with the specified character
Use a loop to go through each character and check if its index is odd or even before replacing
Example: Input string 'hello' and replacement character '*', output 'h*l*'
Q14. What technologies are you familiar with.
I am familiar with technologies such as Java, Python, SQL, HTML, CSS, JavaScript, and Git.
Java
Python
SQL
HTML
CSS
JavaScript
Git
Q15. Explain inheritance with example and write code
Inheritance is a concept in object-oriented programming where a class inherits properties and behaviors from another class.
Inheritance allows a class to reuse code from another class, promoting code reusability and reducing redundancy.
The class that is being inherited from is called the parent class or base class, while the class that inherits from it is called the child class or derived class.
Child classes can access the properties and methods of the parent class, and can al...read more
Q16. Print all the substrings that start with 'aa'
Print all substrings starting with 'aa'
Iterate through the input string and check for 'aa' at each position
If 'aa' is found, print the substring starting from that position
Q17. Check wheather exists a circle in Linked list
To check if a circle exists in a linked list, use Floyd's Cycle Detection Algorithm.
Use two pointers, one moving at twice the speed of the other.
If the two pointers meet at any point, there is a cycle in the linked list.
Example: 1->2->3->4->2 (cycle exists)
Example: 1->2->3->4 (no cycle)
Q18. Write a code to find frequency of each character.
Code to find frequency of each character in a given string.
Use a hashmap to store character frequencies.
Iterate through the string and update the hashmap accordingly.
Return the hashmap with character frequencies.
Q19. Check Palindrome in a Linked List
Check if a linked list is a palindrome by comparing the values from both ends.
Traverse the linked list to find the middle node using slow and fast pointers.
Reverse the second half of the linked list.
Compare the values of the first half with the reversed second half to check for palindrome.
Example: 1->2->3->2->1 is a palindrome.
Q20. Normalisation and keys from dbms
Normalization is the process of organizing data in a database to reduce redundancy and improve data integrity. Keys are used to uniquely identify records in a table.
Normalization involves breaking down data into smaller, more manageable parts to reduce redundancy.
Keys are used to uniquely identify records in a table. Examples include primary keys, foreign keys, and candidate keys.
Normalization helps in maintaining data integrity and reducing anomalies such as insertion, updat...read more
Q21. Simple DSA problem of DFS and BFS
DFS and BFS are fundamental graph traversal algorithms used to explore nodes in a graph.
DFS (Depth First Search) explores as far as possible along each branch before backtracking. It uses a stack to keep track of nodes.
BFS (Breadth First Search) explores all the neighbor nodes at the present depth prior to moving on to the nodes at the next depth. It uses a queue to keep track of nodes.
Example: For a graph with nodes A, B, C, D and edges (A, B), (A, C), (B, D), DFS would visi...read more
Q22. relocation from city to chennai
I am willing to relocate from my current city to Chennai for this opportunity.
I am excited about the opportunity to work in Chennai and experience a new city.
I am prepared to relocate and have already started looking into housing options in Chennai.
I am open to new experiences and challenges that come with relocating to a different city.
I believe that Chennai offers a great environment for professional growth and development.
Q23. Fundamentals of computer science
Fundamentals of computer science cover basic concepts and principles in computing.
Includes topics like algorithms, data structures, programming languages, and computer architecture.
Understanding of computational complexity, software engineering principles, and computer networking is essential.
Knowledge of operating systems, databases, and cybersecurity is also important.
Examples: Sorting algorithms like bubble sort, data structures like linked lists, programming languages lik...read more
Q24. Find subarray equal to k sum
Find subarray with sum equal to k in an array
Use a hashmap to store prefix sum and its frequency
Iterate through the array and check if current sum - k exists in the hashmap
If it exists, increment the count of subarrays with sum k
Q25. Reverse a Linked List
Reverse a Linked List by changing the pointers direction
Start with three pointers: current, prev, and next
Iterate through the linked list, updating the pointers to reverse the direction
Return the new head of the reversed linked list
Q26. Difference between SQL and nosql
SQL is a relational database management system, while NoSQL is a non-relational database management system.
SQL is table-based, with a predefined schema, while NoSQL is document-based, key-value pairs, graph databases, or wide-column stores.
SQL is suitable for complex queries and transactions, while NoSQL is better for hierarchical data storage and real-time applications.
Examples of SQL databases include MySQL, Oracle, and PostgreSQL, while examples of NoSQL databases include ...read more
Q27. Explain 4 pillars of oops.
The 4 pillars of OOP are Inheritance, Encapsulation, Abstraction, and Polymorphism.
Inheritance allows a class to inherit properties and behavior from another class.
Encapsulation restricts access to certain components of an object, protecting its integrity.
Abstraction hides complex implementation details and only shows the necessary features.
Polymorphism allows objects to be treated as instances of their parent class, enabling flexibility.
Q28. Search element in the array
Search for a specific element in an array of strings
Use a loop to iterate through each element in the array
Compare each element with the target element using string comparison
Return the index of the element if found, otherwise return -1
Q29. convert roman to numerals
Convert Roman numerals to numbers
Create a mapping of Roman numerals to their corresponding values
Iterate through the Roman numeral string from right to left
If the current numeral is smaller than the next numeral, subtract its value from the total
Otherwise, add its value to the total
Q30. Game with time bound timers
A game with time-bound timers requires players to complete tasks within a set time limit.
Players must strategize and prioritize tasks to complete them before the timer runs out.
Timers can be used to increase the difficulty and intensity of the game.
Examples include escape rooms, cooking games, and puzzle games with time limits.
Q31. maximum subarray variation
Find the maximum variation in a subarray of integers.
Iterate through the array and keep track of the maximum and minimum values seen so far.
Calculate the variation by subtracting the minimum value from the maximum value.
Return the maximum variation found in any subarray.
Q32. Find median in data stream
Use two heaps to maintain the median in a data stream
Use a max heap to store the smaller half of the numbers and a min heap to store the larger half
Keep the size of the two heaps balanced or differ by at most 1 to find the median efficiently
If the total number of elements is odd, the median is the top element of the max heap. If even, average the tops of both heaps
Q33. Explain 4 pillars of OOP.
The 4 pillars of OOP are encapsulation, inheritance, polymorphism, and abstraction.
Encapsulation: Bundling data and methods that operate on the data into a single unit.
Inheritance: Allowing a class to inherit properties and behavior from another class.
Polymorphism: The ability for objects to be treated as instances of their parent class.
Abstraction: Hiding the complex implementation details and showing only the necessary features.
Q34. Projects explain
Developed a web application for tracking personal fitness goals and progress
Used HTML, CSS, and JavaScript for front-end development
Implemented a RESTful API using Node.js and Express for back-end functionality
Utilized MongoDB for database storage and retrieval
Incorporated data visualization tools like Chart.js for displaying progress graphs
Q35. rotate the array
Rotate the array in place by k steps
Use the modulus operator to handle cases where k is greater than the array length
Reverse the entire array, then reverse the first k elements and the remaining elements separately
Q36. Water jug problem
The water jug problem involves finding the minimum number of steps to measure a specific amount of water using two jugs of different capacities.
Understand the capacities of the two jugs and the target amount of water to measure.
Use the operations of filling, emptying, and transferring water between the jugs to reach the target amount.
Apply the concept of the greatest common divisor (GCD) to determine if the target amount is achievable.
Interview Questions of Similar Designations
Top Interview Questions for Software Engineer Intern Trainee Related Skills
Interview experiences of popular companies
Calculate your in-hand salary
Confused about how your in-hand salary is calculated? Enter your annual salary (CTC) and get your in-hand salary
Reviews
Interviews
Salaries
Users/Month