HexaView Technologies
10+ DigitalMatics Technologies Interview Questions and Answers
You are given an array/list ‘BINARYNUMS’ that consists of ‘N’ distinct strings which represent all integers from 0 to N in binary representation except one integer. This integer between 0 to ‘N’ w...read more
You are given an array ‘ARR’ of length ‘N’. There are two operations, ‘FIRST_SUM’ and ‘LAST_SUM’ for every index ‘i’ (1 <= i <= N) in the array,
i) FIRST_SUM(i) calculates the sum of first i numbers....read more
Given a text and a wildcard pattern of size N and M respectively, implement a wildcard pattern matching algorithm that finds if the wildcard pattern is matched with the text. The matchi...read more
Print the following pattern
Pattern for N = 4
The dots represent spaces.
Input Format :
N (Total no. of rows) Output Format :
Pattern in N lines You are given a N x M matrix of integers, return the spiral path of the matrix
Example Of Spiral Path
Input Format:
The first line contains an integer 'T' which denotes the number of test cases or...read moreNinja is given a pattern. Now he is asked to print the same pattern for any given ‘N’ number of rows.
Note:
There is only one space between the values of each column in a row. For example, Patt...read more1. Which Data Structure is best, Linked List or Array and why?
2. Comparison of Time complexity of insertion, deletion, and searching in an array and linked list.
3. SQL Query to count the tota...read more
Four people are trying to cross a sketchy rope bridge in the middle of the night. Only two can cross at a time. They only have one flashlight, and so one person must bring it back across the bridge to the...read more
You have been given a binary tree of 'N' unique nodes and a Start node from where the tree will start to burn. Given that the Start node will always exist in the tree, your task is to print the...read more
Q10. Design of algorithms and puzzles and DBMS
Designing algorithms and puzzles requires creativity and logical thinking. DBMS knowledge is essential for efficient data management.
Algorithm design involves breaking down complex problems into smaller, manageable steps.
Puzzle design requires creativity and the ability to think outside the box.
DBMS knowledge is essential for efficient data management and retrieval.
Understanding data structures and algorithms is crucial for designing efficient DBMS systems.
Willing to relocate?
What is your biggest achievement?
Able to handle pressure?
Q12. How many times we can subtract 10 from 100?
You can subtract 10 from 100 ten times.
Subtract 10 from 100 once to get 90.
Subtract 10 from 90 to get 80.
Repeat this process until you reach 0.
You can subtract 10 from 100 ten times in total.
Q13. Valid parenthesis (all approaches ) time and space complexity and past projects.
Valid parenthesis time and space complexity and past projects
Approaches for checking valid parenthesis include using a stack or recursion
Time complexity for stack approach is O(n) and space complexity is O(n)
Time complexity for recursion approach is O(2^n) and space complexity is O(n)
Past projects may include developing algorithms for string manipulation or parsing
Q14. What is class ,object and differentiationthem
A class is a blueprint for creating objects, which are instances of a class. Objects are instances of a class with specific attributes and behaviors.
Class: Blueprint for creating objects
Object: Instance of a class with specific attributes and behaviors
Differentiation: Class is like a template, object is a specific instance of that template
Q15. find duplicate numbers, prime num er program
Program to find duplicate numbers and prime numbers in an array of strings.
Iterate through the array to find duplicate numbers using a hashmap or set.
Check each number in the array for primality using a function that checks divisibility.
Store the duplicate numbers and prime numbers in separate arrays for further processing.
Q16. Pillars of oops
Pillars of OOPs include Inheritance, Encapsulation, Abstraction, and Polymorphism.
Inheritance: Allows a class to inherit properties and behavior from another class.
Encapsulation: Bundling data and methods that operate on the data into a single unit.
Abstraction: Hiding the complex implementation details and showing only the necessary features of an object.
Polymorphism: Ability of an object to take on many forms.
Q17. Naive algorithm
Naive algorithm is a simple approach to solving a problem without considering efficiency.
Naive algorithms are straightforward and easy to implement.
They may not be the most efficient solution for complex problems.
Examples include linear search for finding an element in an array and bubble sort for sorting elements.
Q18. ACID Properties
ACID properties are a set of properties that guarantee database transactions are processed reliably.
ACID stands for Atomicity, Consistency, Isolation, Durability
Atomicity ensures that all operations in a transaction are completed successfully or none at all
Consistency ensures that the database remains in a consistent state before and after the transaction
Isolation ensures that transactions are independent of each other
Durability ensures that once a transaction is committed, i...read more
More about working at HexaView Technologies
Interview Process at DigitalMatics Technologies
Top Interview Questions from Similar Companies
Reviews
Interviews
Salaries
Users/Month
Made with ❤️ in India. Trademarks belong to their respective owners. All rights reserved © 2024 Info Edge (India) Ltd.
