Filter interviews by
I applied via Company Website and was interviewed in Dec 2022. There were 6 interview rounds.
Live test for driver in interview
This case is very important for me
Driver assigned to company asimshazad
I don't have any idea about this
Top trending discussions
I applied via Walk-in and was interviewed in Feb 2020. There were 3 interview rounds.
I applied via Naukri.com and was interviewed in Sep 2019. There were 4 interview rounds.
To increase business, focus on customer satisfaction, expand marketing efforts, and offer promotions.
Improve customer service to increase customer satisfaction and loyalty
Expand marketing efforts through social media, email marketing, and targeted advertising
Offer promotions such as discounts, referral programs, and loyalty rewards
Analyze market trends and adjust business strategies accordingly
Collaborate with other bu...
I appeared for an interview before Apr 2021.
Round duration - 45 minutes
Round difficulty - Easy
This was a test where 2 coding questions were to be solved in 45 minutes.
Given a column title as it appears in an Excel sheet, your task is to return its corresponding column number.
S = "AB"
28
The seq...
Determine if two given strings, str1
and str2
, are permutations of each other.
Two strings are permutations of each other if the characters of one string can be re...
Check if two strings are permutations of each other.
Create character frequency maps for both strings.
Compare the frequency maps to check if they are permutations.
Handle edge cases like empty strings or strings of different lengths.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Insert a new node after a given node in a linked list without needing the head pointer.
To insert a node, create a new node with the desired value.
Set the new node's next pointer to the current node's next pointer.
Update the current node's next pointer to point to the new node.
This operation runs in O(1) time since we only manipulate pointers.
Example: If current node is 'A' and we want to insert 'B', after insertion, 'A...
QuickSort is a sorting algorithm that uses divide and conquer approach.
Choose a pivot element from the array
Partition the array into two sub-arrays, one with elements less than the pivot and one with elements greater than the pivot
Recursively apply the above steps to the sub-arrays
Combine the sorted sub-arrays to get the final sorted array
Code for Fibonacci Series using Recursion, Iteration and Dynamic Programming
Recursion: Define a function that calls itself with the previous two numbers in the series as arguments
Iteration: Use a loop to calculate the series by adding the previous two numbers in each iteration
Dynamic Programming: Store the previous two numbers in variables and use them to calculate the next number in the series
Implementing a Queue using Stacks
Use two stacks to implement a queue
Push elements onto the first stack
When dequeuing, pop all elements from the first stack and push onto the second stack
Pop the top element from the second stack to dequeue
If the second stack is empty, pop all elements from the first stack and push onto the second stack
OCR uses algorithms to recognize and convert text from images into machine-readable format.
Image Preprocessing: Enhances image quality (e.g., binarization, noise reduction).
Character Segmentation: Identifies and separates individual characters from the text.
Feature Extraction: Analyzes shapes and patterns of characters (e.g., edges, curves).
Classification: Uses machine learning models to match extracted features with k...
Counting Sort is a sorting algorithm that sorts elements by counting the number of occurrences of each unique element.
Count the occurrences of each element in the array
Calculate the cumulative sum of the counts
Place each element in the sorted array based on its count and cumulative sum
Time complexity is O(n+k) where n is the number of elements and k is the range of input
Example: Sort an array of strings based on their ...
Chrome uses an algorithm to predict and suggest words based on user input.
Chrome's algorithm uses a combination of user history, bookmarks, and popular searches to predict and suggest words.
The algorithm also takes into account the frequency and recency of the user's input.
Chrome's suggestion feature is powered by Google's Autocomplete API, which uses machine learning to predict and suggest words.
The suggestions are di...
I applied via Internshala and was interviewed in May 2019. There was 1 interview round.
I'm a dedicated student with a passion for technology and problem-solving, eager to learn and contribute in a dynamic internship role.
Currently pursuing a degree in Computer Science, focusing on software development.
Completed a project on developing a mobile app that helps users track their fitness goals.
Interned at a tech startup where I assisted in debugging and improving existing software.
Active member of the univer...
I applied via LinkedIn and was interviewed before May 2020. There was 1 interview round.
I applied via Recruitment Consultant and was interviewed in Jun 2020. There was 1 interview round.
I applied via LinkedIn and was interviewed before Nov 2020. There was 1 interview round.
I applied via Referral and was interviewed before Aug 2020. There was 1 interview round.
AstroTalk
Meesho
Oyo Rooms
Esyasoft