20+ Times Internet Software Developer Interview Questions and Answers

Yes, the binary array can be sorted in linear time and constant space using a single traversal.

• Use two pointers approach to swap 0s to the left and 1s to the right.

• Maintain two pointers, one for 0s and one for 1s, and iterate through the array once.

• Example: Input array [1, 0, 1, 0, 1] will be sorted to [0, 0, 1, 1, 1] in a single traversal.

Identify the largest prime factor of a given positive integer.

• Iterate from 2 to sqrt(n) to find prime factors

• Check if each factor is prime and update largest prime factor

• If no prime factor found, output -1

Yes, the cloning of a linked list with random pointer can be accomplished without utilizing extra space.

• Use a hashmap to store the mapping between original nodes and their corresponding cloned nodes.

• Iterate through the original linked list to create the cloned nodes and update the hashmap.

• Iterate through the original linked list again to set the next and random pointers of the cloned nodes using the hashmap.

• Time complexity: O(N), Space complexity: O(N) where N is the number o...read more

Find the smallest positive integer missing from an array of integers.

• Iterate through the array and mark positive integers as visited using index as a reference.

• After marking, iterate again to find the first unmarked index which represents the missing positive integer.

• Handle edge cases like duplicates and negative numbers appropriately.

• Example: For input [3, 4, -1, 1], the output should be 2.

Balls are removed and replaced based on color. Find the last ball remaining.

• Start with 20 red and 16 blue balls

• Remove 2 balls and replace based on color

• Repeat until only one ball remains

Delete a given node from a Binary Search Tree (BST) and return the inorder traversal of the modified BST.

• Traverse the BST to find the node to be deleted.

• Handle different cases like node with no children, one child, or two children.

• Update the pointers of the parent node and child nodes accordingly.

• Perform inorder traversal after deletion to get the modified BST.

Insert a new node with a given value into a binary search tree while maintaining the properties of a BST.

• Traverse the BST starting from the root node and compare the value to be inserted with each node's value to determine the correct position for insertion.

• Insert the new node as a leaf node in the appropriate position to maintain the BST properties.

• Ensure that the resulting tree is a valid binary search tree by following the properties of a BST.

• Example: Inserting value 60 in...read more

Find the second largest prime number and its index from an array of positive integers.

• Iterate through the array and check if each number is prime

• Store the largest and second largest prime numbers found so far

• Also store their indices

• Return the second largest prime number and its index

The average speed can be calculated by taking the harmonic mean of the two speeds.

• To calculate the harmonic mean, divide the sum of the speeds by the reciprocal of the sum of their reciprocals.

• In this case, the harmonic mean can be calculated as 2/(1/20 + 1/30) = 24 km/h.

The data structure to program a jigsaw puzzle program would be a graph.

• Use a graph data structure to represent the puzzle pieces and their connections.

• Each puzzle piece can be represented as a node in the graph.

• Edges between nodes represent the connections between puzzle pieces.

• To solve the puzzle, use graph traversal algorithms like depth-first search or breadth-first search.

• Apply puzzle-solving strategies like finding corner pieces first or matching edge colors.

The minimum number of steps to find the defective ball is 2.

• Divide the 8 balls into 3 groups of 3, 3, and 2 balls.

• Compare the weights of the two groups of 3 balls.

• If one group is heavier, divide it into 2 balls and compare their weights.

• If the two balls have different weights, the heavier ball is the defective one.

• If the two balls have the same weight, the remaining ball in the first group of 3 is the defective one.

Find the first missing positive number in an array of positive and negative integers.

• Sort the array in ascending order

• Iterate through the sorted array and find the first positive number that is missing

• If no positive number is missing, return the next positive number after the largest positive number in the array

Polymorphism in OOP allows objects of different classes to be treated as objects of a common superclass.

• Polymorphism allows for flexibility and reusability in code.

• It enables a single interface to be used for different data types.

• Examples include method overriding and method overloading.

Method overloading is having multiple methods in the same class with the same name but different parameters. Method overriding is having a method in a subclass with the same name and parameters as a method in its superclass.

• Method overloading involves multiple methods with the same name but different parameters.

• Method overriding involves a subclass redefining a method from its superclass with the same name and parameters.

• Method overloading is resolved at compile time based on...read more

Operator overloading is the ability to redefine operators for custom classes.

• Allows operators to be used with custom classes

• Example: '+' operator can be used to concatenate strings

• Can improve readability and simplify code

Method overloading is having multiple methods with the same name but different parameters. Method overriding is having a method in a subclass with the same name, return type, and parameters as a method in its superclass.

• Method overloading is achieved within the same class.

• Method overriding occurs in a subclass that inherits from a superclass.

• Method overloading is determined at compile-time based on the number, type, and order of parameters.

• Method overriding is determined at r...read more

A Binary Search Tree (BST) is a data structure where each node has at most two children, with the left child being less than the parent and the right child being greater.

• Nodes in a BST are arranged in a hierarchical order where the left subtree of a node contains only nodes with keys less than the node's key, and the right subtree contains only nodes with keys greater than the node's key.

• BST allows for efficient search, insertion, and deletion operations with a time complexit...read more

Polymorphism is the ability of an object to take on many forms. It allows objects of different classes to be treated as the same type.

• Polymorphism is achieved through method overriding and method overloading.

• Method overriding allows a subclass to provide a specific implementation of a method that is already defined in its superclass.

• Method overloading allows multiple methods with the same name but different parameters to be defined in a class.

• Polymorphism enables code reusabi...read more

Operator overloading is the ability to redefine the behavior of operators for user-defined data types.

• Allows operators to be used with custom data types

• Can define custom behavior for operators like +, -, *, etc.

• Helps make code more readable and intuitive

• Example: Overloading the + operator for a custom Vector class to add two vectors