AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
Somish - Blockchain Solutions Interview Questions and Answers
Somish - Blockchain Solutions Interview Experiences
3 interviews found
Anonymous
Selected
I appeared for an interview before Mar 2024.
It was years ago so don't know if it is still relevant or not. But still, aptitude test was copy paste questions from online sources random questions about cs field.
(3 Questions)
- Q1. Difference between run time and compile time polymorphism.
- Ans.
Run time polymorphism occurs during program execution, while compile time polymorphism is resolved during code compilation.
Compile time polymorphism is achieved through method overloading and operator overloading.
Example of compile time polymorphism: Method overloading in Java.
Run time polymorphism is achieved through method overriding.
Example of run time polymorphism: Using virtual functions in C++.
- Q2. Write code for quick sort.
- Ans.
Quick sort is an efficient sorting algorithm that uses a divide-and-conquer approach to sort elements in an array.
1. Choose a pivot element from the array (e.g., the last element).
2. Partition the array into two sub-arrays: elements less than the pivot and elements greater than the pivot.
3. Recursively apply the same process to the sub-arrays.
4. Base case: If the array has one or zero elements, it is already sorted.
Exa...
- Q3. How to cut a dice thrice so you get max number of identical pieces?
(1 Question)
- Q1. No questions, casual discussion about willing to relocate and where can you strat this kind of questions.
Interview Preparation Tips
Senior Software Engineer Interview Questions asked at other Companies
Parth Agrawal
I applied via LinkedIn and was interviewed in Aug 2023. There were 3 interview rounds.
Create a model to predict price.
(1 Question)
- Q1. Go through the assignment code and past projects.
Quant Analyst Interview Questions asked at other Companies
Selected
I applied via Approached by Company and was interviewed before Oct 2022. There were 2 interview rounds.
(2 Questions)
- Q1. Asked regarding payment process and Bills receivable process.
- Q2. Asked about taxation
Senior Executive Finance & Accounts Interview Questions asked at other Companies
Interview questions from similar companies
I applied via Referral and was interviewed before Jan 2021. There was 1 interview round.
Interview Questionnaire
1 Question
- Q1. Java questions
Interview Preparation Tips
I applied via Campus Placement and was interviewed before May 2021. There were 2 interview rounds.
Numerical ability and logical reasoning followed by some coding mcqs
(1 Question)
- Q1. Print 1 to 100 without for loop
- Ans.
Printing 1 to 100 without for loop
Use recursion to print numbers from 1 to 99
Print 100 outside the recursion
Use a base case to stop recursion at 100
Interview Preparation Tips
I applied via Campus Placement and was interviewed before Jun 2021. There were 2 interview rounds.
Simple aptitude test
(1 Question)
- Q1. General questions as per your cv
Interview Preparation Tips
- Aptitude
I applied via Recruitment Consultant and was interviewed before Jul 2020. There was 1 interview round.
Interview Questionnaire
1 Question
- Q1. DS Algo Questions on Trees. Leadership Principles
Interview Preparation Tips
I applied via Naukri.com
Interview Questionnaire
2 Questions
- Q1. Why Amazon?
- Q2. What do you expect from Amazon?
Interview Preparation Tips
I applied via Newspaper Ad and was interviewed before Jun 2021. There were 3 interview rounds.
(1 Question)
- Q1. Basic questions of java.
(1 Question)
- Q1. Intro and other hr related questions.
Interview Preparation Tips
SAMKIT JAIN
I appeared for an interview in Aug 2017.
Interview Questionnaire
7 Questions
- Q1. Implement Merge Sort.
- Ans.
Merge Sort is a divide and conquer algorithm that sorts an array by dividing it into two halves, sorting them separately, and then merging the sorted halves.
Divide the array into two halves
Recursively sort the two halves
Merge the sorted halves
- Q2. Given a BST containing distinct integers, and a number ‘X’, find all pairs of integers in the BST whose sum is equal to ‘X’.
- Ans.
Find pairs of integers in a BST whose sum is equal to a given number.
Traverse the BST and store the values in a hash set.
For each node, check if (X - node.value) exists in the hash set.
If yes, add the pair (node.value, X - node.value) to the result.
Continue traversal until all nodes are processed.
- Q3. Given a set of time intervals in any order, merge all overlapping intervals into one and output the result which should have only mutually exclusive intervals.
- Ans.
Merge overlapping time intervals into mutually exclusive intervals.
Sort the intervals based on their start time.
Iterate through the intervals and merge overlapping intervals.
Output the mutually exclusive intervals.
Example: [(1,3), (2,6), (8,10), (15,18)] -> [(1,6), (8,10), (15,18)]
- Q4. What are the different types of hashing? Suggest an alternative and a better way for Linear Chaining.
- Ans.
Different types of hashing and alternative for Linear Chaining
Different types of hashing include division, multiplication, and universal hashing
Alternative for Linear Chaining is Open Addressing
Open Addressing includes Linear Probing, Quadratic Probing, and Double Hashing
- Q5. Implement AVL Tree.
- Ans.
An AVL tree is a self-balancing binary search tree where the heights of the left and right subtrees differ by at most one.
AVL tree is a binary search tree with additional balance factor for each node.
The balance factor is the difference between the heights of the left and right subtrees.
Insertion and deletion operations in AVL tree maintain the balance factor to ensure the tree remains balanced.
Rotations are performed ...
- Q6. Minimum number of squares whose sum equals to given number n.
- Ans.
Find the minimum number of squares whose sum equals to a given number n.
Use dynamic programming to solve the problem efficiently.
Start with finding the square root of n and check if it is a perfect square.
If not, then try to find the minimum number of squares required for the remaining number.
Repeat the process until the remaining number becomes 0.
Return the minimum number of squares required for the given number n.
- Q7. Insertion sort for a singly linked list.
- Ans.
Insertion sort for a singly linked list.
Traverse the list and compare each node with the previous nodes
If the current node is smaller, swap it with the previous node
Repeat until the end of the list is reached
Time complexity is O(n^2)
Interview Preparation Tips
Experience: There were 2 coding questions (no penalty for wrong submission) and 20 Multiple Choice Questions(with negative marking). We were given 90 minutes to solve them. MCQs were based on Data Structures, OS, CN, C outputs, OOP etc.
Tips: Experience in Competitive Programming might help in solving coding questions. No constraints were mentioned and detailed Instructions related to problem were stated vaguely. So code carefully.
Duration: 1 hour 30 minutes
Total Questions: 22
Round: Technical Interview
Experience: The interviewer asked me to introduce myself and a brief introduction of the projects that I have done. She first asked me questions related to my project. After that she moved on to the data structures part.
Tips: Take your time to approach the problems and if the question is not clear ask the interviewer to explain it again.
Round: Technical Interview
Experience: The interviewer asked me about how my previous round went. After that, he asked me to introduce myself and a brief introduction of the projects that I have done. He first asked me a few questions related to my project. Then he moved on to the data structures part. In this round the interviewer gave me strict time limit for coding the solution on paper for each problem and as soon as I was done coding he gave me 2-3 minutes every time to find errors and debug my code.
Tips: Do not panic even if the interviewer sets time limit while solving problems. If the question is not clear ask the interviewer to explain it again.
College Name: The LNM Institute Of Information Technology, Jaipur
Skills evaluated in this interview
Somish - Blockchain Solutions Interview FAQs
Tell us how to improve this page.
Interview Questions for Popular Designations
Somish - Blockchain Solutions Interview Process
based on 4 interviews
Interview experience
Interview Questions from Similar Companies
Somish - Blockchain Solutions Reviews and Ratings
based on 10 reviews
Rating in categories
|
Executive Assistant
4
salaries
|  ₹3.2 L/yr - ₹7 L/yr |
|
Full Stack Developer
4
salaries
| ₹3 L/yr - ₹4.8 L/yr |
|
Administration Manager
3
salaries
| ₹3.8 L/yr - ₹5.6 L/yr |
|
Senior Accountant
3
salaries
| ₹3.6 L/yr - ₹5.7 L/yr |
|
Technical Project Manager
3
salaries
| ₹14 L/yr - ₹15.4 L/yr |
TCS
Accenture
Cognizant
Infosys
- Home >
- Interviews >
- Somish - Blockchain Solutions Interview Questions
