HashedIn by Deloitte
10+ Interview Questions and Answers
You have been given a number of stairs. Initially, you are at the 0th stair, and you need to reach the Nth stair. Each time you can either climb one step or two steps. You are...read more
You are given two arbitrary binary trees consisting of N and M number of nodes respectively, your task is to check whether the two trees are mirror of each other or not.
Two trees a...read more
You are given an infinite supply of coins of each of denominations D = {D0, D1, D2, D3, ...... Dn-1}. You need to figure out the total number of ways W, in which you can make a change fo...read more
You are given an array of integers NUM consisting of N elements. This array represents the digits of a number. Your task is to increase the number by 1, or we can say you have to add 1 to th...read more
Ninja has to design a 2 players game Tic-Tac-Toe played on an ‘N’ * ‘N’ grid.
Ninja has to assume the following rules while playing the game:
This game is played between two people (Player 1 a...read moreYou have been given a column title as appears in an Excel sheet, return its corresponding column number.
For example:
A -> 1 B -> 2 C -> 3 ... Z -> 26 AA -> 27 AB -> 28 ... Input Format
The ...read moreQ7. Q1 - Pre order traversal without recursion. Q2 - Reverse a linked list.
Q1 - Pre order traversal without recursion. Q2 - Reverse a linked list.
Q1: Use a stack to keep track of nodes. Start with root, push it to stack. Pop top node, print it, push right and left children to stack.
Q2: Traverse the linked list and change the direction of the pointers. Set the head of the reversed list as the last node of the original list.
Q8. Q1 - Sort the string according to frequency of characters
Sort a string based on the frequency of its characters.
Create a hash table to store the frequency of each character.
Sort the characters based on their frequency using a sorting algorithm.
Reconstruct the string based on the sorted characters and their frequency.
Q9. What is sharding and how it can be implemented.
Sharding is a database partitioning technique to improve performance and scalability.
It involves dividing a large database into smaller, more manageable parts called shards.
Each shard contains a subset of the data and can be stored on a separate server.
Sharding can be implemented using different strategies such as range-based, hash-based, or round-robin.
It requires careful planning and coordination to ensure data consistency and availability.
Examples of sharding in popular da...read more
Q10. What are assymptotic notation
Asymptotic notation is a way to describe the performance of an algorithm in terms of its input size.
Asymptotic notation is used to analyze the efficiency of algorithms by focusing on how they behave as the input size approaches infinity.
Common notations include O (Big O), Ω (Big Omega), and Θ (Big Theta), which represent the worst-case, best-case, and average-case time complexity respectively.
For example, if an algorithm has a time complexity of O(n^2), it means that the algo...read more
Interview Process at null
Top Software Engineer 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.
