i
SpaceBasic
Filter interviews by
Top trending discussions
The function checks if a string is a substring of another string.
Use the built-in string methods like 'indexOf' or 'includes' to check for substring.
If the language supports regular expressions, you can also use them to find substrings.
Consider the case sensitivity of the strings when comparing.
Code to multiply two matrices of dimension M*N and N*K.
Create a result matrix of dimension M*K.
Iterate through each row of the first matrix.
For each row, iterate through each column of the second matrix.
For each element in the row of the first matrix, multiply it with the corresponding element in the column of the second matrix.
Sum up the products and store the result in the corresponding position of the result matrix.
...
SQL query to perform matrix multiplication using two tables with row, col, and value columns.
Use JOIN operation to combine the two tables based on matching row and col values.
Use GROUP BY clause to group the result by row and col values.
Use SUM function to calculate the dot product of corresponding row and col values.
Use INSERT INTO statement to insert the result into a new table.
Prototype in JavaScript is an object that is associated with every function and object by default.
Prototype is used to add properties and methods to an object.
It allows objects to inherit properties and methods from other objects.
Modifying the prototype of a function affects all instances of that function.
Prototypes can be used to create new objects based on existing objects.
The prototype chain allows for property and
Classes in JavaScript are written using the class keyword.
Use the class keyword followed by the class name to define a class.
Use the constructor method to initialize class properties.
Add methods to the class using the class prototype.
Use the new keyword to create an instance of the class.
The number of different ways to climb a ladder of N steps by taking 1 or 2 steps at a time.
This is a classic problem that can be solved using dynamic programming.
The number of ways to climb N steps is equal to the sum of the number of ways to climb N-1 steps and N-2 steps.
The base cases are when N is 0 or 1, where there is only 1 way to climb the ladder.
For example, for N=4, there are 5 different ways: [1, 1, 1, 1], [1
Print a square matrix in spiral order
Start by defining the boundaries of the matrix
Iterate through the matrix in a spiral pattern, printing each element
Adjust the boundaries after each iteration to move inward
Repeat until all elements are printed
Retrieve the second highest marks obtained by each student from a table with student name, subject, and marks.
Use the RANK() function to assign a rank to each row based on the marks in descending order.
Filter the result to only include rows with rank 2 for each student.
Group the result by student name to get the second highest marks for each student.
The .live() method attaches an event handler to the current and future elements, while .delegate() attaches an event handler to a parent element.
The .live() method is deprecated in newer versions of jQuery.
The .delegate() method is preferred over .live() for performance reasons.
Both methods are used to handle events for dynamically added elements.
Example: $(document).live('click', 'button', function() { ... });
Example:...
Chaining in jQuery allows multiple methods to be called on a single element in a single line of code.
Chaining simplifies code and improves readability.
Each method in the chain operates on the result of the previous method.
The chain ends with a method that does not return a jQuery object.
Example: $('div').addClass('highlight').fadeOut();
A callback function is a function that is passed as an argument to another function and is executed later.
Callback functions are commonly used in event-driven programming.
They allow asynchronous execution of code.
Callback functions can be used to handle responses from APIs or user interactions.
They can be anonymous functions or named functions.
Example: setTimeout(function() { console.log('Hello!'); }, 1000);
The .bind() function in jQuery is used to attach an event handler function to one or more elements.
It allows you to specify the event type and the function to be executed when the event occurs.
The .bind() function can be used to bind multiple events to the same element.
It can also be used to pass additional data to the event handler function.
The .bind() function is deprecated in jQuery version 3.0 and above. It is reco
The angle between the hour and minute hands of a clock can be calculated using a formula.
The hour hand moves 30 degrees per hour and 0.5 degrees per minute.
The minute hand moves 6 degrees per minute.
Calculate the angle between the two hands using the formula: |30H - 11M/2|, where H is the hour and M is the minute.
Yes, it is possible to create a slideshow without using JavaScript.
Use CSS animations and transitions to create the slideshow.
Use HTML and CSS to structure and style the slideshow.
Utilize keyframe animations to create the slide transitions.
Use radio buttons or checkboxes to control the slideshow navigation.
Apply the :target pseudo-class to create a simple slideshow without JavaScript.
The men can take turns riding the scooter, allowing them to reach point B faster.
The men can form a queue and take turns riding the scooter.
The person riding the scooter can drop it off at a certain point and the next person can pick it up.
The scooter can be passed along the line of men until everyone reaches point B.
I was interviewed before Apr 2021.
Round duration - 90 minutes
Round difficulty - Medium
This round had 3 coding questions of Medium to Hard level of difficulty.
Given an integer N
representing the number of pairs of parentheses, find all the possible combinations of balanced parentheses using the given number of pairs.
Generate all possible combinations of balanced parentheses for a given number of pairs.
Use recursion to generate all possible combinations of balanced parentheses.
Keep track of the number of open and close parentheses used in each combination.
Return the valid combinations as an array of strings.
You are given a long type array/list ARR
of size N
, representing an elevation map. The value ARR[i]
denotes the elevation of the ith
bar. Your task is to determine th...
Calculate the total amount of rainwater that can be trapped between given elevations in an array.
Iterate through the array and calculate the maximum height on the left and right of each bar.
Calculate the amount of water that can be trapped at each bar by taking the minimum of the maximum heights on the left and right.
Sum up the trapped water at each bar to get the total trapped water for the entire array.
You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:
Find the minimum time required to rot all fresh oranges adjacent to rotten oranges.
Create a queue to store the coordinates of rotten oranges and perform BFS to rot adjacent fresh oranges.
Track the time taken to rot all fresh oranges and return -1 if not all fresh oranges can be rotten.
Update the grid with the new state of oranges after each second.
Handle edge cases such as empty grid or no fresh oranges present.
Example...
Round duration - 60 Minutes
Round difficulty - Medium
This was a standard DS/Algo round where I was given 2 questions to solve under 60 minutes. I was able to come up with the optimal approach for both the questions and then at the end of the interview I was also asked the famous Die Hard Water Puzzle.
Design a queue data structure following the FIFO (First In First Out) principle using only stack instances.
Your task is to complete predefined functions t...
Implement a queue using stacks following FIFO principle.
Use two stacks to simulate a queue.
For enQueue operation, push elements onto stack1.
For deQueue operation, if stack2 is empty, pop all elements from stack1 and push onto stack2, then pop from stack2.
For peek operation, if stack2 is empty, pop all elements from stack1 and push onto stack2, then return top of stack2.
For isEmpty operation, check if both stack1 and st...
You are provided with 'N' intervals, each containing two integers denoting the start time and end time of the interval.
Your task is to merge all overlapping intervals a...
Merge overlapping intervals and return sorted list of merged intervals by start time.
Sort the intervals based on start time.
Iterate through intervals and merge overlapping ones.
Return the merged intervals in sorted order.
Round duration - 60 Minutes
Round difficulty - Medium
This round had 2 coding questions - first one related to Binary Tree and the second one was a simple question from Bit Manipulation. This was followed by some questions from OOPS.
You are given a Binary Tree, and you need to determine the length of the diameter of the tree.
The diameter of a binary tree is the length of the longest path betwe...
The task is to find the diameter of a binary tree, which is the length of the longest path between any two end nodes in the tree.
Traverse the tree to find the longest path between two nodes.
Keep track of the maximum diameter found during traversal.
The diameter may not necessarily pass through the root node.
Consider both left and right subtrees while calculating the diameter.
Example: For input 1 2 3 4 -1 5 6 -1 7 -1 -1
Determine if it is possible to reorder the digits of a given integer 'N' such that the resulting number is a power of two. The leading digit must not be zero.
The fir...
The problem involves determining if it is possible to reorder the digits of a given integer to form a power of 2.
Iterate through all possible permutations of the digits of the given integer.
Check if any of the permutations form a power of 2.
Return 1 if a valid permutation is found, else return 0.
Advantages of OOP include code reusability, modularity, and easier maintenance.
Code reusability: Objects can be reused in different parts of the program, reducing redundancy.
Modularity: OOP allows for breaking down complex problems into smaller, more manageable parts.
Easier maintenance: Changes to one part of the codebase do not necessarily affect other parts, making maintenance easier.
Encapsulation: Data hiding and ab...
Access specifiers define the level of access to class members in Object-Oriented Programming.
Access specifiers include public, private, protected, and default
Public members are accessible from outside the class
Private members are only accessible within the class
Protected members are accessible within the class and its subclasses
Default access is when no access specifier is specified
Round duration - 30 Minutes
Round difficulty - Easy
This was my last round and I hoped it to go good just like the other rounds. The interviewer was very straight to point
and professional. The interview lasted for 30 minutes.
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.
I was interviewed before Feb 2021.
Round duration - 90 minutes
Round difficulty - Medium
Questions on aptitude, English, logical reasoning, C/C++ and 5 coding ques. (only pseudo code).
Bob and his wife are in the famous 'Arcade' mall in the city of Berland. This mall has a unique way of moving between shops using trampolines. Each shop is laid out in a st...
Find the minimum number of trampoline jumps Bob needs to make to reach the final shop, or return -1 if it's impossible.
Use Breadth First Search (BFS) algorithm to find the minimum number of jumps required.
Keep track of the visited shops to avoid revisiting them.
If a shop has an Arr value of 0, it is impossible to reach the final shop.
Return -1 if the final shop cannot be reached.
Given two strings, S
and X
, your task is to find the smallest substring in S
that contains all the characters present in X
.
S = "abdd", X = "bd"
Find the smallest substring in S that contains all characters in X.
Use a sliding window approach to find the smallest window in S containing all characters of X.
Maintain a hashmap to keep track of characters in X and their frequencies in the current window.
Slide the window to the right, updating the hashmap and shrinking the window until all characters in X are present.
Return the smallest window found.
Example: S = 'abd
You need to determine all possible paths for a rat starting at position (0, 0) in a square maze to reach its destination at (N-1, N-1). The maze is represented as an N*N ma...
Find all possible paths for a rat in a maze from start to destination.
Use backtracking to explore all possible paths in the maze.
Keep track of visited cells to avoid revisiting them.
Return paths in alphabetical order as a list of strings.
Round duration - 60 minutes
Round difficulty - Easy
Questions based on OOPS were asked in this round.
A virtual function is a function in a base class that is declared using the keyword 'virtual' and can be overridden by a function with the same signature in a derived class.
Virtual functions allow for dynamic polymorphism in C++
They are used in inheritance to achieve runtime polymorphism
Virtual functions are declared in a base class and can be overridden in derived classes
They are called based on the type of object bei...
Types of polymorphism in OOP include compile-time (method overloading) and runtime (method overriding) polymorphism.
Compile-time polymorphism is achieved through method overloading, where multiple methods have the same name but different parameters.
Runtime polymorphism is achieved through method overriding, where a subclass provides a specific implementation of a method that is already defined in its superclass.
Polymor...
Deep copy creates a new object and recursively copies all nested objects, while shallow copy creates a new object and copies only the references to nested objects.
Deep copy creates a new object and copies all nested objects, while shallow copy creates a new object and copies only the references to nested objects.
In deep copy, changes made to the original object do not affect the copied object, while in shallow copy, ch...
Round duration - 30 minutes
Round difficulty - Easy
HR round with typical behavioral problems.
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.
I am a dedicated professional with experience in management. I want to work in Oyo for its innovative approach to hospitality. Life in Bangalore is vibrant and diverse.
I have a strong background in management and leadership roles
I am attracted to Oyo for its innovative technology-driven approach to hospitality
Bangalore offers a vibrant cultural scene with diverse food options and entertainment
The city is known for its
posted on 27 Jan 2017
I was interviewed in Dec 2016.
I applied via Campus Placement
I applied via Campus Placement
Queue can be implemented using two stacks by maintaining the order of elements in the stacks.
Create two stacks, let's call them stack1 and stack2
When an element is enqueued, push it to stack1
When an element is dequeued, pop all elements from stack1 and push them to stack2
Pop the top element from stack2 and return it as the dequeued element
If stack2 is empty, repeat step 3
To get the front element of the queue, peek the
Left join returns all records from left table and matching records from right table. Full outer join returns all records from both tables.
Left join is used to combine two tables based on a common column.
In left join, all records from the left table are returned along with matching records from the right table.
If there is no match in the right table, NULL values are returned.
Example: SELECT * FROM table1 LEFT JOIN table...
Magic functions are special methods in PHP that start with __. Autoloading is a way to automatically load classes.
Magic functions are used to handle certain events in PHP, such as object creation or property access.
Autoloading allows PHP to automatically load classes when they are needed, without requiring manual includes.
Magic functions can be used in conjunction with autoloading to dynamically load classes or handle
Given three sorted arrays, find common elements.
Create three pointers to traverse each array
Compare the elements at the pointers and move the pointer of the smallest element
If all pointers point to the same element, add it to the result and move all pointers
Repeat until any pointer reaches the end of its array
Check if a number is a power of 2 or not.
A power of 2 has only one bit set in its binary representation.
Use bitwise AND operator to check if the number is a power of 2.
If n is a power of 2, then n & (n-1) will be 0.
based on 2 interviews
Interview experience
based on 7 reviews
Rating in categories
Software Developer
6
salaries
| ₹0 L/yr - ₹0 L/yr |
QA Engineer
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Front end Developer
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Business Development Manager
3
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
3
salaries
| ₹0 L/yr - ₹0 L/yr |
Oyo Rooms
Treebo Hotels
FabHotels
Yatra