Search Interview Questions

^{This question was recently asked at 'Spillman Technologies'.This question is still unanswered. Can you please provide an answer.}

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve Asked in 1 Companies}

Q1533. How long will it take for you to join Canopy ?

^{This question was recently asked at 'Canopy Tax'.This question is still unanswered. Can you please provide an answer.}

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve Asked in 1 Companies}

Q1534. What is the Big O notation for Fibonacci series - both iterative as well as recursive ?

^{This question was recently asked at 'Canopy Tax'.This question is still unanswered. Can you please provide an answer.}

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve Big o Notation Asked in 1 Companies expert}

Q1535. Write code to see if a Linked List has cycle in it ?

or

Write code using Floyd Algorithm to see if a linked list has cycle in it ? What is it's comlexity ?

Ans. public class LinkedList {

Node start = null;
Node head = null;

class Node {
Integer body;
Node nextNode;

Node(Integer value) {
body = value;
}
}

public static void main(String[] args) {
LinkedList ll = new LinkedList();

ll.addNodeToEnd(5);
ll.addNodeToEnd(10);
ll.addNodeToEnd(15);

ll.traverse();

if(checkIfLoop(l1)){
System.out.println("There is a Loop");
} else {
System.out.println("No Loop");
}
}

private boolean checkifLoop(Test l1) {
Node slow = start;
Node fast = start;
Node faster = start;

while(slow != null ) {
fast = slow.nextNode;
faster = fast.nextNode;
if(slow == fast || slow == faster) {
return true;
}
slow = slow.nextNode;
}

return false;
}

}

Complexity of this algorithm is O(n)

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve LinkedList Cyclic LinkedList}

Q1536. What is the access time for ArrayList and LinkedList ?

Data Structure

Ans. O(1) for ArrayList
O(n) for LinkedList

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve Asked in 2 Companies}

Q1537. What is the runtime complexity of appending strings to string object and Why ?

Ans. O(n^2) because each time a string is appended a new String is created and it runs through all the letters to copy them over.

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve}

Q1538. Design an algorithm and write code to remove the duplicate characters in a string without using any additional buffer.

^{This question is still unanswered. Can you please provide an answer.}

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve}

Q1539. Write a method that returns maximum depth of a tree ?

^{This question was recently asked at 'One Click Retail'.This question is still unanswered. Can you please provide an answer.}

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve tree data structure maximum depth of tree Asked in 1 Companies}

Q1540. Given a sorted array, write an algorithm to create a binary tree.

^{This question is still unanswered. Can you please provide an answer.}

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve}

Q1541. Difference between Left and Inner Join ?

SQL

^{This question was recently asked at 'Canopy Tax,Cogent Infotech Corp'.This question is still unanswered. Can you please provide an answer.}

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve sql Asked in 2 Companies}

Q1542. What are the challenges you faced in any of your project ?

^{This question was recently asked at 'Bloomberg'.This question is still unanswered. Can you please provide an answer.}

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve Asked in 1 Companies}

Q1543. How can you identify Performance issues before going to production ?

^{This question was recently asked at 'Bloomberg'.This question is still unanswered. Can you please provide an answer.}

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve Asked in 1 Companies}

Q1544. What is the difference between time and space complexity ?

^{This question is still unanswered. Can you please provide an answer.}

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve}

Q1545. Which data structure would you use to implement LRU cache and Why ? Can you tell me the time complexity for it ?

Ans. We can use LinkedHashMap as it will give time complexity of O(1) for lookup and We can maintain the insertion order to identify the Last used elements for eviction.

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve LRU Cache Asked in 1 Companies}

Q1546. What can we do if we need to retrieve Fibonacci value at a particular index faster ? Can we use Linked List ?

Data Structure

^{This question was recently asked at 'Canopy Tax'.This question is still unanswered. Can you please provide an answer.}

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve LinkedList Asked in 1 Companies}

Q1547. Sort a List of Objects using comparable and comparator

Core Java

^{This question was recently asked at 'HCL Technologies'.This question is still unanswered. Can you please provide an answer.}

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve Asked in 1 Companies}

Q1548. what is parallel array sorting?

Ans. Java provides a new additional feature in Array class which is used to sort array elements in parallel.New methods have been added to the java.util.Arrays package that use the JSR 166 Fork/Join parallelism common pool to provide sorting of arrays in parallel.

The methods are called parallelSort() and are overloaded for all the primitive data types and Comparable objects.

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve Asked in 1 Companies}

Q1549. What is Angular JS ?

Ans. It is javascript framework which is written in javascript.It is best for single page application.It extends the html with new attributes which makes it more useful for ui dveloper.

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve Asked in 1 Companies}

Q1550. What is two way binding ?

Ans. Two-way binding means that any data-related changes affecting the model are immediately propagated to the matching view(s), and that any changes made in the view(s) (say, by the user) are immediately reflected in the underlying model. When app data changes, so does the UI, and conversely.

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve Asked in 1 Companies}

Q1551. what does restrict mean when we talk about directive ?

^{This question was recently asked at 'American Express'.This question is still unanswered. Can you please provide an answer.}

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve Asked in 1 Companies}

Q1552. how are filters added to expressions?

^{This question was recently asked at 'American Express'.This question is still unanswered. Can you please provide an answer.}

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve Asked in 1 Companies}

Q1553. what kind of filters did you worked with ?

^{This question was recently asked at 'American Express'.This question is still unanswered. Can you please provide an answer.}

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve Asked in 1 Companies}

Q1554. what kind of front end java have you worked with ?

Ans. [Open Ended Answer]

Possible Answer - I have worked with building thick client using Java , SWT and RCP.

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve Asked in 1 Companies}

Q1555. what are well formed and valid xmls ?

Ans. Well formed xml has all tags closed in the right order. well formed refers to syntax.
Valid xml is xml that succeeds validation against a DTD

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve Asked in 1 Companies}

Q1556. what kind of dtd have you worked with ?

^{This question was recently asked at 'American Express'.This question is still unanswered. Can you please provide an answer.}

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve Asked in 1 Companies}

Q1557. Is XML case sensitive ?

Ans. Yes

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve Asked in 1 Companies}

Q1558. what is a qualified name ?

Ans. QNames were introduced by XML Namespaces in order to be used as URI references.It defines a valid identifier for elements and attributes. QNames are generally used to reference particular elements or attributes within XML documents.

Help us improve. Please let us know the company, where you were asked this question :

_{Like Discuss Correct / Improve Asked in 1 Companies}

Q1559. What is XPath ?