Techweirdo Software Developer Intern Interview Questions and Answers for Freshers

Moderate difficulty level questions were asked

High difficulty level questions were asked

Round duration - 45 Minutes
Round difficulty - Easy

This round was held on Google Meet Video Call at 10 A.M.
There were 2 Interviewers and they were very helpful.

Q1. Kth largest element in the unsorted array
You are given an array consisting of 'N' distinct positive integers and a number 'K'. Your task is to find the kth largest element in the array.
E...read more
Ans. Brute Force
• The most obvious brute force approach would be to sort the array in descending order and return the ‘K’th element from the beginning of the array.
• Sort the array in descending order, for sorting most of the languages have their inbuilt sort methods which are usually very fast.
• After sorting, return the element arr['K'-1](i.e. element at index ‘K’-1, considering 0-based indexing).
Space Complexity: O(1)Explanati...read more
Answered by CodingNinjas
View 1 more amswer
Q2. System Design Question
Draw E-R Diagram for Uber.
Add your answer
Q3. Maximum sum path from the leaf to root
You are given a binary tree of 'N' nodes.
Your task is to find the path from the leaf node to the root node which has the maximum path sum among all the roo...read more
Ans. Recursive Subproblem
The idea here is that we will do a recursive solution by asking the children of the current node for the max sum path and then choose the path with the max sum. 
 
The approach will be as follows:
1. Get the max sum path for the left subtree.
2. Get the max sum path for the right subtree.
3. Select the one with the max sum from both and insert current node's data into it.
4. Return the updated path.
    
Al...read more
Answered by CodingNinjas
View 1 more amswer

Round duration - 30 Minutes
Round difficulty - Easy

The round was 2nd technical round conducted through Google Meet.
There were 2 interviewers and they were helpful.
Timing was from 11:10 A.M - 12:00 P.M

Q1. Technical Question
Given a file of 1 GB having data in form of digits, sort the file elements with 100 MB RAM available.
 
Add your answer
Q2. Add Two Numbers As Linked Lists
You are given two linked lists representing two non-negative numbers. The digits in the linked list are stored in reverse order, i.e. starting from least significant digit (...read more
Ans. Recursion
• A simple approach could be to recursively add the nodes of the linked list while keeping track of the carry generated.
• The idea behind this approach is the same as finding the sum of two numbers manually on a paper, where we start by adding the LSD and move on till the MSD. Also, keeping track of the carry generated in every iteration.
• As the linked lists represent the numbers in reverse order, the LSD occurs at...read more
Answered by CodingNinjas
View 2 more amswers

Round duration - 15 Minutes
Round difficulty - Easy

Timing was 12:30 P.M. to 1:00 P.M.
It was held on Google Meet and HR was helpful.

Q1. Basic HR Questions
Who is your role model?
Where do you see yourself in 5 years?
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

This round contains 40 mcq questions 15 dsa and 25 aptitude.
then there was 5 coding questions.

Q1. Technical Question
What would be the best way to store and read a really long string, with each entry is an index for another array?
Add your answer
Q2. Check If Binary Representation of a Number is Palindrome
Ninja is given an integer ‘N’. Ninja wants to find whether the binary representation of integer ‘N’ is palindrome or not.
A palindrome is a sequen...read more
Ans. 
Check if binary conversion of given number is palindrome or not. Ex: 6 (0110) is palindrome.
I used a recursive function for binary conversion and then check for palindrome using a loop. Refrain from using inbuilt functions as they wanna check your logic. O(n) time complexity.
Answered by CodingNinjas
View 1 more amswer
Q3. Word Break
You are given a list of “N” strings A. Your task is to check whether you can form a given target string using a combination of one or more strings of A.
Note :
You can use any string of A mult...read more
Ans. 
 One Sentence (string) is given. find out the words, that has length even and greater than equal to 4 (e.g. 4,6,8.. etc.) and separate them with space.
e.g. Given String : “abcd abc abcde abcdef”
Output: “ab cd abc abcde abc def”
I allocated a new string dynamically, and used two for loops to copy one string to another, adding a space at the middle of the word where word length was >=4 and even. O(n^2) time comple
Answered by CodingNinjas
View 4 more amswers

Round duration - 25 minutes
Round difficulty - Easy

Technical Round

Q1. Sort 0 1
You have been given an integer array/list(ARR) of size N that contains only integers, 0 and 1. Write a function to sort this array/list. Think of a solution which scans the array/list only once an...read more
Ans. 
Then he made it complex by saying that if there are numbers from 0 to k in an array of size n then how will you sort them in O(n), I told him the count sort, he agreed with it and then asked me to quickly write down the code, I wrote it down, there was a silly mistake which he pointed out and said that it’s good and then moved on to next problem. He saw my code for fourth largest in an array, I did it using heap and ti...read more
Answered by CodingNinjas
View 1 more amswer

Round duration - 78 minutes
Round difficulty - Easy

My slot was at 4.30 pm on 11 th oct 2020

Q1. Fishmonger
A fishmonger wants to bring his goods from port to the market. On his route, he has to traverse an area with many states. He has to pay a toll at each border.
He is a good businessman. He want...read more
Ans. Brute Force
In this approach, we have to make a recursive function that returns the minimum toll needed to reach the N-1 node within the given time limit. We have to create a visited array of size N to maintain which vertices are already visited.
1. We will check If we reached the last node, then return the currToll. This will act as the base case of the recursive function.
2. We will call the recursive function on all the adja...read more
Answered by CodingNinjas
View 1 more amswer

Round duration - 20 Minutes
Round difficulty - Easy

It happened in the afternoon

Q1. Shape and Overriding
Create a Class Shape having a field shapeType and a function printMyType.
Create another class, Square and Rectangle, which inherits the Shape class and has additional fields length ...read more
Ans. Intuitive Approach
• In the code, there is a class Shape has an attribute shapeType after that, we have class Square and Rectangle, which is inheriting the property of class Shape and has an additional attribute length, length, and breadth, respectively.
• After that, we first create an object s of Square class and passed the length of a square, creating an object calling printMyType and calculateArea method, respectively.
• He...read more
Answered by CodingNinjas
Add your answer
Q2. OS Questions
What is process and explain threading
Explain binary semaphore?
Explain paging
What are overlays.
Add your answer
Q3. DBMS Qustion
What are ACID properties
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

Q1. Assignment
Write an essay on any topic and speak.
Ans. 
Tip 1 : Have good pronunciation practice
Tip 2 : Practice by reciting difficult words
 
Answered by CodingNinjas
Add your answer