i
ZIGRAM
Filter interviews by
Clear (1)
I was interviewed in Jan 2021.
Round duration - 120 minutes
Round difficulty - Hard
This round was very difficult. I never do these much difficulty level of coding questions. But i give my best, and just do every questions by using step by step process.
Given an integer 'N', print an hourglass pattern based on the value of 'N'.
The first and only line of input contains an integer, denoting the value of N.
Print an hourglass pattern based on the given integer 'N'.
Read the integer 'N' as input
Print the top half of the hourglass pattern with decreasing numbers
Print the bottom half of the hourglass pattern with increasing numbers
Handle the constraints for 'N' values between 1 and 50
Given an undirected and disconnected graph G(V, E) where V vertices are numbered from 0 to V-1, and E represents edges, your task is to output the BFS traversal starting from the ...
BFS traversal in a disconnected graph starting from vertex 0.
Use BFS algorithm to traverse the graph starting from vertex 0.
Explore neighbor nodes first before moving to the next level neighbors.
Consider bidirectional edges in an undirected graph.
Output the BFS traversal sequence for each test case in a separate line.
Ensure the BFS path starts from vertex 0 and print connected nodes in numerical sort order.
You are given a stack. Your task is to sort the elements within the stack in ascending order using only push and pop operations. You are allowed to use one additional stack ...
Sort a given stack in ascending order using only push and pop operations with the help of an additional stack.
Use one additional stack to assist in sorting the elements.
Pop elements from the input stack and push them onto the auxiliary stack in sorted order.
Keep track of the current minimum element to maintain ascending order.
Pop elements from the auxiliary stack back to the input stack to get the sorted order.
Round duration - 90 minutes
Round difficulty - Easy
This round is also coding round in this round we have a small video call interaction too, in which hr ask few questions to only those whose coding question is correct.
You are given a palindrome number represented as a string S
. Your task is to find the largest palindrome number that is strictly less than S
.
T...
Find the largest palindrome number strictly less than a given palindrome number.
Iterate from the middle towards the start of the number and decrement the digits to create the largest palindrome less than the given number.
Handle cases where the number is all '9's by changing the middle digit to '9' and decrementing the rest of the digits.
If the number has an odd length, simply mirror the first half to create the largest
You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:
Find minimum time to rot all fresh oranges adjacent to rotten oranges in a grid.
Use Breadth First Search (BFS) to simulate the rotting process.
Track the time taken to rot all fresh oranges.
Return -1 if all fresh oranges cannot be rotten.
Handle edge cases like empty grid or no fresh oranges.
Tip 1 : Relax and don't stress. Practice
Tip 2 : Build Resume according to Job Description , but don't lie.
Tip 3 : Have good projects and knowledge regarding important subjects related to interviews
Tip 1 : Include only genuine information, never lie in resume , it will impact to bad impression.
Tip 2 : Skills relevant to Job Description
Tip 3 : Resume should not be more than 2 pages
Tip 4 : Have some projects and internship on your resume because it will give good impression
Top trending discussions
posted on 21 Mar 2015
I was interviewed before Aug 2016.
I was interviewed in Apr 2017.
I am a software developer with a passion for coding and problem-solving. My family is supportive and has always encouraged my career in tech.
Experienced software developer
Passionate about coding and problem-solving
Supportive family that encourages my career in tech
I was interviewed before Mar 2021.
Round duration - 60 minutes
Round difficulty - Easy
This was an easy round which went really smooth.
Calculate the Nth term in the Fibonacci sequence, where the sequence is defined as follows: F(n) = F(n-1) + F(n-2)
, with initial conditions F(1) = F(2) = 1
.
Calculate the Nth Fibonacci number efficiently using dynamic programming.
Use dynamic programming to store previously calculated Fibonacci numbers to avoid redundant calculations.
Start with base cases F(1) and F(2) as 1, then iteratively calculate F(n) using F(n-1) and F(n-2).
Ensure the input N is within the constraints 1 <= N <= 10000.
Example: For N = 5, the 5th Fibonacci number is 5 (1, 1, 2, 3, 5).
Given a positive integer N
, your task is to determine and return all prime numbers less than or equal to N
.
N = 10
2 3 5 7
N = 20
Implement a function to return all prime numbers less than or equal to a given positive integer N.
Create a function that takes a positive integer N as input
Iterate from 2 to N and check if each number is prime
Use a helper function to determine if a number is prime
Return an array of all prime numbers less than or equal to N
A merge join in SQL is a method of combining two sorted datasets by matching corresponding rows based on a specified condition.
Merge join is used when joining two large datasets that are already sorted.
It is more efficient than other join methods like nested loop join or hash join for sorted datasets.
The join condition must be an equality condition.
Example: SELECT * FROM table1 INNER JOIN table2 ON table1.id = table2.i
Round duration - 30 minutes
Round difficulty - Easy
The round went excellent. I really enjoyed it. Just be confident about whatever you answer
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 Mar 2021.
Round duration - 60 minutes
Round difficulty - Easy
This round went well. Interview depends on your basic knowledge of C/C++.
Given two sparse matrices MAT1
and MAT2
of integers with dimensions 'N' x 'M' and 'M' x 'P' respectively, the goal is to determine the resulting matrix produced by their multipl...
Implement a function to multiply two sparse matrices and return the resulting matrix.
Create a function that takes two sparse matrices as input and returns the resulting matrix after multiplication
Iterate through the non-zero elements of the matrices to perform the multiplication efficiently
Handle the edge cases such as empty matrices or matrices with all zero elements
Ensure the dimensions of the matrices are compatible
Tanmay and Rohit are best buddies. Tanmay gives Rohit a challenge involving an array of N natural numbers. The task is to perform and answer a series of queries on the ...
Count the number of even or odd numbers in a range of an array based on given queries.
Create an array to store the input numbers.
Iterate through the queries and update or count even/odd numbers based on the query type.
Output the count of even or odd numbers for each query of type 1 or 2.
Round duration - 30 minutes
Round difficulty - Easy
Typical HR round with 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 was interviewed in Jul 2017.
I was interviewed in Apr 2017.
Firmware is a type of software that is embedded in hardware devices to control their functionality.
Firmware is a combination of hardware and software.
It is used to control the behavior of hardware devices.
Firmware is typically stored in non-volatile memory, such as ROM or flash memory.
Examples of devices that use firmware include routers, printers, and digital cameras.
I am a passionate software developer with experience in building web applications and solving complex problems.
Experienced in programming languages such as Java, JavaScript, and Python
Familiar with front-end technologies like HTML, CSS, and React
Strong problem-solving skills and ability to work in a team environment
Previous projects include developing a customer management system for a small business
I applied via Campus Placement
I applied via Campus Placement
based on 2 reviews
Rating in categories
Research Analyst
184
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Analyst
149
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Research Analyst
72
salaries
| ₹0 L/yr - ₹0 L/yr |
Analyst
71
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate
20
salaries
| ₹0 L/yr - ₹0 L/yr |
TCS
Infosys
Wipro
HCLTech