i
MedTourEasy
Filter interviews by
I appeared for an interview in Jan 2021.
Round duration - 125 minutes
Round difficulty - Easy
Platform for this round is Amcat. The First round have coding questions , we can write programs in any language . It was easy round.
Your task is to determine if two given strings are anagrams of each other. Two strings are considered anagrams if you can rearrange the letters of one string to form the...
Determine if two strings are anagrams of each other by checking if they contain the same characters.
Create a character frequency map for both strings and compare them.
Sort both strings and compare if they are equal.
Use a hash set to store characters of one string and remove characters of the other string to check for anagrams.
Convert a given decimal number into its equivalent octal representation.
The octal number system is a base-8 system, meaning each digit ranges ...
Convert a decimal number to its octal representation.
Understand the concept of octal number system (base-8)
Divide the decimal number by 8 and store the remainders to get the octal representation
Handle the edge cases where the decimal number is 0 or 1
Round duration - 30 minutes
Round difficulty - Easy
This round was easy they basically ask about some important topics of computer science as well as related to our position for company.
Virtual memory allows the operating system to use hard disk space as additional RAM when physical memory is full.
Allows running more applications than physical memory can support
Enables efficient memory management by swapping data between RAM and disk
Improves system performance by reducing the need to constantly load and unload programs into physical memory
Helps prevent programs from crashing due to insufficient memory
You are provided with a stack ARR
of size 'N+1'. Your task is to delete the middlemost element so that the size of the resulting stack becomes 'N'.
Recall that a stack is...
Implement a function to delete the middle element from a stack, reducing its size by 1.
Iterate through the stack to find the middle element based on the stack size.
Remove the middle element and shift the remaining elements accordingly to maintain the stack order.
Handle cases where the stack size is even or odd differently to determine the middle element.
Round duration - 30 minutes
Round difficulty - Easy
It was in the morning . Its one to one conversation. Interviewer was good enough. He ask about me and what i know about their company. What were my objectives and many more.
Tip 1 : Practice Aptitude Questions from IndiaBix
Tip 2 : Continue practice on online coding platforms and do participate in coding challenges.
Tip 3 : Keep revising your Computer Science fundamentals(OS, DBMS, Software Engineering principles).
Tip 4 : Also brush-up your aptitude skills.
Tip 1 : Add only what you know properly. don't add extra stuff just to add weight to your resume.
Tip 2 : First page of the resume must in tabular form and it must give complete information about you in very simple manner.
Tip 3 : Use professional Keywords in your resume.
Tip 4 : Highlight your Skills and Achievements. Put only those skills in which you are good like any question can be asked on any particular skill. Like how you will do this in this.
I applied via Naukri.com and was interviewed in May 2024. There were 2 interview rounds.
Implement a counter using closure in JavaScript.
Create a function that returns another function which increments a counter variable.
The counter variable should be defined in the outer function's scope and only accessible to the inner function.
Each time the inner function is called, increment the counter variable and return its value.
Promises are objects representing the eventual completion or failure of an asynchronous operation. promise.all() is a method that takes an array of promises and returns a single promise that resolves when all of the promises have resolved.
Promises are used in JavaScript to handle asynchronous operations.
promise.all() takes an array of promises and returns a single promise that resolves when all promises in the array ha...
I applied via LinkedIn and was interviewed before Feb 2023. There were 2 interview rounds.
- simple basic ios questions
I applied via Campus Placement and was interviewed before Mar 2023. There were 3 interview rounds.
Kadance algorithm and find the middle of the linklist
More on java and Python based coding questions
posted on 31 May 2022
I appeared for an interview in Apr 2022.
Round duration - 75 minutes
Round difficulty - Medium
Test Comprises of 3 coding questions and some MCQs
Round duration - 60 minutes
Round difficulty - Medium
2 coding questions of (1 easy and 1 medium level) on hackerrank code-pair with the Interviewer
Round duration - 60 minutes
Round difficulty - Easy
This Round was based on CS fundamentals and One coding question was there as a Code-pair.
Given a list of integers of size N
, your task is to determine the Next Greater Element (NGE) for every element. The Next Greater Element for an element X
is the firs...
Find the Next Greater Element for each element in a list of integers.
Iterate through the list of integers from right to left.
Use a stack to keep track of elements whose NGE is yet to be found.
Pop elements from the stack until a greater element is found or the stack is empty.
Assign the NGE as the top element of the stack or -1 if the stack is empty.
Tip 1 : Require coding skills to pass the interview.
Tip 2 : Brush up on Java Skills
Tip 3 : Brush up on OOPS
Tip 1 : Keep it to one page
Tip 2 : Mention relevant skills as per the job
posted on 15 Sep 2021
I appeared for an interview in Dec 2020.
Round duration - 90 minutes
Round difficulty - Medium
Total of 8 questions:
4 MCQ(oops and expected output type questions) + other 2 were coding questions, out of which one is some class implementation question.
Given an array ARR
and an integer K
, your task is to count all subarrays whose sum is divisible by the given integer K
.
The first line of input contains an...
Count subarrays with sum divisible by K in an array.
Iterate through the array and keep track of the running sum modulo K.
Use a hashmap to store the frequency of remainders.
For each prefix sum, check how many previous prefix sums have the same remainder.
Return the total count of subarrays with sum divisible by K.
Round duration - 60 minutes
Round difficulty - Easy
This round was with the USA team, the panel consisted of 2 members. It took place at around 9 PM IST. The interviewer's focus was on approach.
You are given an unsorted array ARR
. Your task is to sort it so that it forms a wave-like array.
The first line contains an integer 'T', the number of test cases.
For ea...
Sort an array in a wave-like pattern where each element is greater than or equal to its adjacent elements.
Iterate through the array and swap elements at even indices with their adjacent odd indices to form a wave pattern.
There can be multiple valid wave arrays, so any valid wave array is acceptable.
Ensure the first element is greater than or equal to the second element to start the wave pattern.
Given an integer number num
, your task is to convert 'num' into its corresponding word representation.
The first line of input contains an integer ‘T’ denoting the number o...
Convert a given integer number into its corresponding word representation.
Implement a function that takes an integer as input and returns the word representation of that number.
Break down the number into its individual digits and convert each digit into its word form.
Handle special cases like numbers between 10 and 19, and multiples of 10.
Combine the word forms of individual digits to form the final word representation
Round duration - 40 minutes
Round difficulty - Easy
It was a managerial round. The position of the person taking the interview was of a technical architect. As was informed by the recruiter, previously he was a technical architect at Amazon.
Facebook stores comments in its database using a combination of relational and non-relational databases.
Comments are typically stored in a relational database like MySQL for structured data storage.
For scalability and performance, Facebook may also use a NoSQL database like Cassandra or HBase for storing comments in a denormalized format.
Metadata related to comments such as likes, timestamps, and user information may b...
Tip 1 : Practice the most frequent and most common questions DSA questions asked in companies like Amazon, Microsoft.
Tip 2 : Focus on solving the questions on your own as much as you can.
Tip 3 : Don't waste your time on the number of questions while compromising quality.
Tip 4 : Do mock interviews with your friend if it's been a long since you have given the interview.
Tip 5 : For virtual interviews, always have a backup of data(you may use mobile data if Wi-Fi goes out). While during an interview try to maintain eye contact every now and then.
Tip 6 : Keep your resume short to 1 page and have far/good knowledge of the tech stack you have mentioned
Tip 1 : Keep it short to 1 page
Tip 2 : Prepare it well.
Tip 3 : Focus more on the problem and the solution. Rather than tools used to solve the problem
Leecode medium level question
Leetcode Hard level Question
I applied via Campus Placement and was interviewed in Aug 2024. There were 2 interview rounds.
Computer Fundamentals
Flatten a binary tree by converting it into a linked list in-place.
Use a recursive approach to flatten the binary tree.
Traverse the tree in a pre-order manner and keep track of the previous node.
Set the left child of each node to null and the right child to the next node in the linked list.
Example: Input: 1 -> 2 -> 5 -> 3 -> 4 -> null, Output: 1 -> null -> 2 -> null -> 3 -> null -> 4 -> null -> 5 -> null
I applied via LinkedIn and was interviewed before Mar 2023. There were 3 interview rounds.
DSA medium leetcode questions - easy to solve
DSA medium 2 questions and core questions 1.5 hrs
I prioritize tasks, communicate with stakeholders, and adjust resources as needed to meet deadlines.
Prioritize tasks based on importance and urgency
Regularly communicate with stakeholders to provide updates and address any issues that may impact deadlines
Adjust resources or seek help from team members if necessary to meet deadlines
I applied via Company Website and was interviewed before Oct 2023. There was 1 interview round.
Increasing triple subsequence, rest is easy hashmap
Data Analyst Trainee
46
salaries
| ₹1 L/yr - ₹8.4 L/yr |
Data Analyst Intern
19
salaries
| ₹1 L/yr - ₹7 L/yr |
Data Analyst
14
salaries
| ₹2 L/yr - ₹7 L/yr |
Business Analyst
8
salaries
| ₹2 L/yr - ₹4 L/yr |
Data Science Intern
8
salaries
| ₹1 L/yr - ₹2 L/yr |
MagicPin
HealthKart
Awign Enterprises
Nestaway