i
HyperVerge
Filter interviews by
Clear (1)
I applied via Campus Placement and was interviewed in Feb 2024. There was 1 interview round.
1.5 hours, data structure and algorithms, Their own platform
I was interviewed before Sep 2020.
Round duration - 180 minutes
Round difficulty - Medium
It was a 3-hr coding round that started at around 6 PM. It had 2-3 coding questions. The test was on InterviewBit.
Determine the K-th permutation from a sequence of the first N natural numbers.
Integer T indicating the number of test cases followed by 'T' t...
The task is to find the Kth permutation of the sequence of first N natural numbers.
Generate all possible permutations of the sequence of first N natural numbers
Sort the permutations in lexicographical order
Return the Kth permutation from the sorted list
You are given a string 'STR'. Your task is to determine the total number of palindromic substrings present in 'STR'.
"abbc"
5
The task is to find the total number of palindromic substrings in a given string.
Iterate through each character in the string and consider it as the center of a potential palindrome
Expand outwards from the center to check if the substring is a palindrome
Count the number of palindromic substrings found
Round duration - 90 minutes
Round difficulty - Medium
Technical interview - comprised of discussion on projects, internships and solving DSA problems.
In my case major part was discussion on projects. I had done projects in Android, iOS and Web Dev. The interviewer himself was very experienced in these fields so he asked thorough questions to test my knowledge.
The DSA problems were at par with what was asked in the coding round, and he just wanted the pseudo-code.
The interview took place on Google Meet at around noon.
Given two strings, S
and T
with respective lengths M
and N
, your task is to determine the length of their longest common subsequence.
A subsequence is a seque...
The problem is to find the length of the longest common subsequence between two given strings.
A subsequence is a string that can be derived from another string by deleting some or no characters without changing the order of the remaining characters.
We can solve this problem using dynamic programming.
Create a 2D array to store the lengths of the longest common subsequences for all possible prefixes of the two strings.
It...
Round duration - 60 minutes
Round difficulty - Easy
The interviewer was very friendly. The first thing he told me was to relax because I was done with the hard part. This round consisted of general questions like -
1. What do you consider to be your greatest strengths and weaknesses?
2. What do you plan to do in the upcoming years?
3. Will you want to pursue higher education?
4. How has your journey at your college been?
5. Do you think you’re a team player? Give some instances to prove it.
6. If I were to call your friends and ask them about your biggest weaknesses, what do you think they’ll say?
Very interestingly, after the last question, he asked me to name a few of my friends and asked for their phone numbers too.
I was very nervous about if he was actually going to call them and ask this question.
Tip 1 : Don’t try to cover all coding platforms. Stick to one and be thorough with it.
Tip 2 : Pick a topic, understand its basics, then start solving problems, starting with the easy ones.
Tip 3 : Solve previously asked questions. It tells you about the level of questions that the company asks.
Tip 1 : You should have multiple interesting projects on your resume (3-4).
Tip 2 : You should be prepared to explain anything that’s written on your resume.
Top trending discussions
I was interviewed before Sep 2016.
posted on 2 Jun 2023
I applied via Campus Placement and was interviewed in Dec 2022. There were 4 interview rounds.
2 questions dsa based
I applied via Company Website and was interviewed in Nov 2023. There were 2 interview rounds.
Assign a remote coding assessment
Clearly define the problem statement and requirements
Provide a set of input/output examples for testing
Specify the programming language and any constraints
Set a time limit for completion
Include instructions for submission and evaluation
The task of Assignment
I was interviewed in Mar 2021.
Round duration - 60 Minutes
Round difficulty - Medium
The test was scheduled in early morning
The environment was stable and strict
Joining two tables in SQL involves using the JOIN keyword to combine rows from both tables based on a related column.
Use the JOIN keyword followed by the table you want to join and the ON keyword to specify the column to join on
Types of joins include INNER JOIN, LEFT JOIN, RIGHT JOIN, and FULL JOIN
Example: SELECT * FROM table1 JOIN table2 ON table1.column = table2.column
Given a string, your task is to determine if it is a palindrome considering only alphanumeric characters.
The input is a single string without any leading or trailing...
Check if a given string is a palindrome considering only alphanumeric characters.
Remove non-alphanumeric characters from the input string.
Compare characters from start and end of the string to check for palindrome.
Handle edge cases like empty string or single character input.
Round duration - 12 minutes
Round difficulty - Medium
The technical interview was scheduled in evening.
The environment was stable and friendly
The interviewer provided enough comfort. He asked some technical questions that’s all.
Round duration - 10 minutes
Round difficulty - Medium
This HR interview was scheduled in morning
The environment was fine as it was the last round
The interviewer was friendly and was trying to know how much willing I am to join the company.
Tip 1 : search frequently asked questions
Tip 2 : prepare smartly the important topics
Tip 1 : keep it short
Tip 2 : must add the projects you have worked on
I was interviewed in Feb 2021.
Round duration - 90 minutes
Round difficulty - Medium
It is from 12 to 1:30 pm. Environment was very friendly and interviewer was very nice.
Given the first term A
, the common ratio R
, and an integer N
, your task is to find the Nth term of a geometric progression (GP) series.
The general...
Calculate the Nth term of a geometric progression series modulo 10^9 + 7.
Use the formula A * R^(N-1) to find the Nth term of the GP series.
Remember to calculate the result modulo 10^9 + 7.
Handle multiple test cases efficiently to stay within the time limit.
Round duration - 90 minutes
Round difficulty - Easy
Very friendly environment
Tip 1 : Practice DS algorithm
Tip 2 : Practice as many question you can
Tip 3 : Also practice different MCQ question
Tip 1 : Write only things you know
Tip 2 : Be truthful with your resume
posted on 17 Nov 2024
I was interviewed in Nov 2020.
Round duration - 60 minutes
Round difficulty - Easy
MCQs + coding round
Prateek is a kindergarten teacher with a mission to distribute candies to students based on their performance. Each student must get at least one candy, and if two s...
Round duration - 60 minutes
Round difficulty - Easy
Coding round
You are given a positive integer n
. Your task is to identify the largest prime factor of this given positive integer.
If there is no prime factor for a given intege...
Round duration - 40 minutes
Round difficulty - Easy
TR+HR+MR
Given two integers a
and b
, your task is to swap these numbers and output the swapped values.
The first line contains a single integer 't', representing the num...
Tip 1 : Focus on basics
Tip 2 : Utterly understanding of syntax of programs
Tip 3 : Always answer with full confidence
Tip 1 : Mention the skills that you are completely confident with
Tip 2 : Always be aware of all the points that you have mentioned in your resume
posted on 9 Nov 2021
I was interviewed in Nov 2020.
Round duration - 60 minutes
Round difficulty - Easy
You are provided with an array or list of integers named ARR
of size N
. The task is to determine two things:
Count the number of elements with odd and even occurrences in an array of integers.
Iterate through the array and use a hashmap to store the count of each element.
After counting, iterate through the hashmap to determine odd and even occurrences.
Return the counts of elements with odd and even occurrences.
You are given a singly linked list where each node contains an integer value and a reference to the next node or NULL if it is the last node. The task is to remov...
Remove nodes in a singly linked list with a greater value on the right.
Traverse the linked list and compare each node's value with the values of nodes to its right.
If a node has a greater value on the right, remove it from the linked list.
Update the references of the previous node to skip the removed node.
Tip 1 : Try solving Love Babbar 450 Prog questions
Tip 2 : Have a good resume
Tip 3 : Do learn some extra technologies eg. ML/AI
Tip 1 : Do not lie at all
Tip 2 : Have some projects listed
based on 1 interview
Interview experience
based on 1 review
Rating in categories
Software Engineer
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Product Manager
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Deep Learning Engineer
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Business Analyst
6
salaries
| ₹0 L/yr - ₹0 L/yr |
Solution Architect
5
salaries
| ₹0 L/yr - ₹0 L/yr |
Fractal Analytics
Mu Sigma
TCS
Wipro