INCREFF Legal Executive Interview Questions and Answers

Algorithm to find LCM of all numbers from 1 to n and its time complexity

• Find prime factors of all numbers from 1 to n

• For each prime factor, find the highest power it appears in any number from 1 to n

• Multiply all prime factors raised to their highest power to get LCM

• Time complexity: O(n*log(log(n)))

NoSQL databases are flexible, scalable, and can handle large amounts of unstructured data.

• NoSQL databases are schema-less, allowing for easy and flexible data modeling.

• They can handle large amounts of unstructured data, making them suitable for big data applications.

• NoSQL databases are highly scalable and can easily handle high traffic and large user bases.

• They provide horizontal scalability by distributing data across...read more

The question asks to find the count of words in a dictionary that can be formed by a given number.

• Iterate through each word in the dictionary

• Check if the characters in the word can be formed using the given number

• Increment the count if the word can be formed

Finding lowest common ancestor of two nodes in binary tree

• Traverse the tree from root to both nodes and store the paths in separate arrays

• Compare the paths to find the last common node

• Return the last common node as the lowest common ancestor

• Use recursion to traverse the tree efficiently

To find the merging point of two linked lists

• Traverse both linked lists and find their lengths

• Move the pointer of the longer list by the difference in lengths

• Traverse both lists simultaneously until they meet at the merging point

Reverse a linked list iteratively

• Create three pointers: prev, curr, and next

• Initialize prev to null and curr to head

• Loop through the list and set next to curr's next node

• Set curr's next node to prev

• Move prev and curr one step forward

• Return prev as the new head

The number of rectangles in an MxN matrix can be calculated using a formula.

• The formula is (M * (M + 1) * N * (N + 1)) / 4

• The matrix can be divided into smaller sub-matrices to count the rectangles

• The number of rectangles can also be calculated by counting all possible pairs of rows and columns

The number is 7744.

• The number must end in 00 or 44.

• The square root of the number must be a whole number.

• The only possible number is 7744.

I am a software developer with experience in multiple programming languages and a passion for problem-solving.

• Proficient in Java, Python, and C++

• Experience with web development using HTML, CSS, and JavaScript

• Familiarity with agile development methodologies

• Strong problem-solving and analytical skills

• Passionate about learning new technologies and staying up-to-date with industry trends

Java function to return subnet mask of IP and URL after www.

• Read the file and store IP addresses and URLs in separate arrays

• Use regex to extract subnet mask from IP address

• Use substring to extract URL after www.

• Return subnet mask and URL as separate strings

Inner join returns only the matching rows between two tables, while outer join returns all rows from one table and matching rows from the other.

• Inner join combines rows from two tables based on a matching column.

• Outer join returns all rows from one table and matching rows from the other.

• Left outer join returns all rows from the left table and matching rows from the right table.

• Right outer join returns all rows from the...read more

To find the length of non-looped linked list, we need to traverse the list and count the number of nodes.

• Traverse the linked list using a pointer and count the number of nodes until the end of the list is reached.

• If a loop is encountered, break out of the loop and continue counting until the end of the list.

• Return the count as the length of the non-looped linked list.