i
Tracxn
Filter interviews by
I applied via Company Website and was interviewed in Apr 2022. There were 2 interview rounds.
Fionacci series
#include
#include
int main()
{
int n1=0,n2=1,n3,i,number;
printf("Enter the number of elements:");
scanf("%d",&number);
printf("\n%d %d",n1,n2);//printing 0 and 1
for(i=2;i
n3=n1+n2;
printf(" %d",n3);
n1=n2;
n2=n3;
}
return 0;
}
Output:
Enter the number of elements:15
0 1 1 2 3 5 8 13 21 34 55 89 144 233 377
Fibonacci Series using recursion in C
Let's see the fibonacci series program in c using recursion.
Top trending discussions
I appeared for an interview in Oct 2022.
Assignment round of the assignment data entry form filling writing of the which of using will
I applied via Campus Placement and was interviewed in Jun 2021. There was 1 interview round.
My dream is to create innovative software solutions that positively impact people's lives and drive technological advancement.
Building User-Centric Applications: I aspire to develop applications that prioritize user experience, like a health tracking app that motivates users to lead healthier lives.
Contributing to Open Source: I dream of contributing to open-source projects, collaborating with developers worldwide to c...
I appeared for an interview in Oct 2020.
Round duration - 90 minutes
Round difficulty - Medium
The test was conducted in the evening from 5:00 pm to 6:30 pm. Because of the covid situation, all the students attempted the test from their homes. But it was a webcam-based test to avoid any kind of cheating.
There were 3 coding problems to be done in 90 minutes.
After resume based shortlisting, 70 candidates were selected to appear for the test out of which 30 were shortlisted for interviews.
Determine if the third string contains all the characters from both the first and second strings in any order. If so, return "YES"; otherwise, return "NO".
Line ...
Check if the third string contains all characters from the first and second strings in any order.
Create a frequency map for characters in the first and second strings.
Check if all characters in the third string are present in the frequency map.
Ensure the count of characters in the third string matches the count in the frequency map.
Return 'YES' if all conditions are met, otherwise return 'NO'.
You are given a connected undirected unweighted graph comprising 'N' nodes and 'M' edges. In this graph, each pair of connected nodes is linked by exactly one undirected e...
Find the length of the shortest path visiting all nodes in a connected undirected unweighted graph.
Use Breadth First Search (BFS) to find the shortest path that visits all nodes at least once.
Maintain a bitmask to keep track of visited nodes and their states.
Consider all possible permutations of nodes to find the shortest path length.
Stark Industry is planning to organize meetings for various departments in preparation for Stark Expo. Due to limited rooms in Stark Tower, the goal is to alloca...
Round duration - 50 minutes
Round difficulty - Medium
This round started at 9 am and went till 4 pm.
Out of 70 students that appeared in online coding test, 30 were shortlisted for the first round (this round) of interviews.
In this round, everyone was asked one moderate level coding question. The interviewer provided the link to an IDE, where I wrote my code.
The interview started with the introduction being followed by 1 coding problem. In the end, the interviewer asked me if I wanted to ask any questions. To which I asked him my feedback so that I can improve my wear areas.
Of the 30 candidates, 17 were selected for the final interview round.
Given an array arr
containing 'N' distinct integers, your task is to generate all possible non-empty subsets of this array.
Note: While the elements within each subset should ...
Generate all possible non-empty subsets of an array of distinct integers.
Use recursion to generate all subsets by including or excluding each element in the array.
Maintain a current subset and add it to the result when reaching the end of the array.
Ensure elements within each subset are in increasing order.
Handle the input and output format as specified in the question.
Round duration - 50 minutes
Round difficulty - Easy
This was a technical + HR round. Started in the evening at 4:30 pm, this round went till 9:30 pm.
17 students were shortlisted for this final round of interview.
This interview was also virtual and involved both technical and HR-related questions. The interview started with an introduction and then questions based on my resume were asked.
Out of 17 candidates, 8 candidates got a full-time offer from Urban Company.
You are provided with a 2D matrix containing only the integers 0 or 1. The matrix has dimensions N x M, and each row is sorted in non-decreasing order. Your...
Find the row with the maximum number of 1's in a sorted 2D matrix.
Iterate through each row of the matrix and count the number of 1's in each row.
Keep track of the row index with the maximum number of 1's seen so far.
Return the index of the row with the maximum number of 1's.
If multiple rows have the same number of 1's, return the row with the smallest index.
Tip 1 : Coding Problems are asked from DSA, so a good practice of standard problems is a must. Revisit these problems before the interview to ace and crack the interview.
Tip 2 : To tackle the conceptual questions, you need to have thorough knowledge about the concepts, so to prepare for OS and DBMS, read one standard book.
Tip 3 : Have proper and clear knowledge about your project. Basic but tricky questions are asked based on the internship experience and the projects you have done.
Tip 1 : The best way to ace an interview is to take command of your interview in your hands. And this is done by having a balanced resume. Projects give direction to the interview and increase the probability of selection. So add at least 2 projects.
Tip 2 : Urban Company seeks team players and not just good coders. So add your achievements outside the academics to get shortlisted.
I appeared for an interview in Oct 2020.
Round duration - 75 minutes
Round difficulty - Medium
The test had 3 questions which had to solved in 75 minutes.The test was of medium difficulty.
Stark Industry is planning to organize meetings for various departments in preparation for Stark Expo. Due to limited rooms in Stark Tower, the goal is to alloca...
You are provided with an integer X
and are tasked with identifying an integer Y
such that the bitwise XOR operation between X
and Y
yields the maximum possible value. The condition is t...
Find an integer Y such that XOR operation with X yields maximum value within given constraints.
Iterate from the most significant bit to find the highest bit that can be toggled to maximize XOR value.
To maximize XOR value, toggle the highest bit of X to 0 and all lower bits to 1.
Ensure the final Y does not exceed (2^61) - 1.
Example: For X = 3, the highest bit to toggle is at position 61, so Y = 2305843009213693950.
Examp...
You are provided with a non-decreasing array and an integer K. Your task is to remove exactly K elements from this array so that the maximum differenc...
Remove K elements from a non-decreasing array to minimize the maximum difference between adjacent elements.
Sort the array in non-decreasing order.
Iterate through the array and calculate the difference between adjacent elements.
Remove elements to minimize the maximum difference.
Return the minimized maximum difference.
Round duration - 60 minutes
Round difficulty - Easy
The interview was taken by SDE2 and she was very friendly. All the questions asked were related to DS and algo. The first 10 minutes were used for introductions and the last 5 minutes were reserved for any questions that I have. Always try to ask meaningful questions at the end of the interview.
Given a sorted array ARR
and a number X
, your task is to determine the count of occurrences of X
within ARR
.
X
is not found in the array, return...Count occurrences of a number in a sorted array efficiently.
Use binary search to find the first and last occurrence of the target number in the array.
Calculate the count of occurrences by subtracting the indices of the last and first occurrences.
Handle cases where the target number is not found in the array.
Time complexity: O(log(N)), Space complexity: O(1).
You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:
Given a linked list where each node has two pointers: one pointing to the next node and another which can point randomly to any node in the list or ...
Round duration - 60 minutes
Round difficulty - Medium
The focus of this round was mainly on my projects and internships. It was taken by a Senior SDE and it more of a technical interaction. I was asked in-depth about my projects and most of the questions asked around OS/DBMS were based on my projects.
The interviewer wanted to judge whether I have core knowledge about subjects like OS and DBMS and also about the projects that I had done.
Round duration - 60 minutes
Round difficulty - Easy
It was the culture fit round taken by the Director of Engineering.
Tip 1 : Learn the concepts, not the solutions.
Tip 2 : You should have deep knowledge about the projects mentioned in your resume.
Tip 1 : Resume should be only 1 page.
Tip 2 : Try to tell a story through your resume. For eg - always mention the impact or scale of your projects/internship.
I appeared for an interview before Sep 2020.
Round duration - 60 Minutes
Round difficulty - Easy
A thief is planning to rob a store and can carry a maximum weight of 'W' in his knapsack. The store contains 'N' items where the ith item has a weight of 'wi' and a value of...
Yes, the 0/1 Knapsack problem can be solved using dynamic programming with a space complexity of not more than O(W).
Use a 1D array to store the maximum value that can be stolen for each weight capacity from 0 to W.
Iterate through each item and update the array based on whether including the item would increase the total value.
The final value in the array at index W will be the maximum value that can be stolen.
Given an array or list of integers 'ARR', identify the second largest element in 'ARR'.
If a second largest element does not exist, return -1.
ARR = [2,...
Round duration - 60 Minutes
Round difficulty - Easy
System Design Round
Design a scalable system for Twitter with key components and architecture.
Use microservices architecture for scalability and fault isolation.
Key components include user service, tweet service, timeline service, and notification service.
Use a distributed database like Cassandra for storing tweets and user data.
Implement a message queue like Kafka for handling real-time updates and notifications.
Use a caching layer like ...
Round duration - 30 Minutes
Round difficulty - Easy
It is just a formality
Tip 1 : System Design
Tip 2 : Practice questions from leetcode
Tip 3 : Have some projects.
Tip 1 : Mention what you know
Tip 2 : Good previous work to showcase
Sorting of an array and aptitude
posted on 9 Nov 2024
I applied via LinkedIn and was interviewed in May 2024. There were 3 interview rounds.
Event loop is a mechanism in programming that allows for asynchronous execution of code by continuously checking for and handling events.
Event loop is commonly used in JavaScript to handle asynchronous operations like setTimeout, setInterval, and AJAX requests.
It works by continuously checking the event queue for any pending events, executing them one by one, and then moving on to the next event.
Event loop helps in pre...
The order of output is fs, process, setTimeout, setInterval, promise.
fs module is synchronous and will output first
process is next in line
setTimeout will be executed after process
setInterval will be executed after setTimeout
promise will be executed last
JavaScript is an interpreted language.
JavaScript is an interpreted language, meaning it is executed line by line at runtime.
There is no separate compilation step in JavaScript like in languages that use compilers.
Examples of interpreted languages include Python, Ruby, and PHP.
Output comparison of for loops using var, let, and bind in JavaScript.
Using var: variable is function-scoped, may lead to unexpected behavior in loops.
Using let: variable is block-scoped, recommended for loop iterations.
Using bind: creates a new function with a specified 'this' value and initial arguments.
Choosing a database involves evaluating data structure, scalability, consistency, and specific use cases.
Understand data structure: Use SQL for structured data (e.g., PostgreSQL) and NoSQL for unstructured data (e.g., MongoDB).
Consider scalability: Choose databases like Cassandra for horizontal scaling in large applications.
Evaluate consistency needs: Use strong consistency databases like MySQL for critical transaction...
I work on coding, debugging, testing, and collaborating with team members. Tech stack decisions are based on project requirements, scalability, performance, and team expertise.
Daily tasks include coding, debugging, testing, and collaborating with team members
Tech stack decisions are based on project requirements, scalability, performance, and team expertise
Consider factors like language compatibility, libraries/framewo...
Design a scalable, real-time document sharing app like Google Docs.
Use websockets for real-time collaboration
Implement version control to track changes
Utilize a distributed database for scalability
Include user authentication and access control
Support offline editing with automatic sync
Utilize cloud storage for scalability, implement image compression techniques, and regularly update image processing libraries.
Utilize cloud storage for scalability
Implement image compression techniques
Regularly update image processing libraries
Implement strategies like versioning, sharding, and caching to manage high I/O and reduce conflicts on the same document.
Use versioning to track changes and allow concurrent edits without conflicts. For example, implement optimistic locking.
Implement sharding to distribute the load across multiple servers, reducing the I/O on a single document.
Utilize caching mechanisms to store frequently accessed data in memory, mini...
posted on 4 Feb 2024
I applied via Job Fair
Create a controller, service, and repository to save user details using Spring Data JPA.
Create a UserController class with appropriate mappings for saving user details.
Create a UserService class with a method to save user details.
Create a UserRepository interface that extends JpaRepository to handle database operations.
Implement the saveUserDetails method in the UserService class to call the save method of the UserRepo...
I applied via Recruitment Consulltant and was interviewed in Feb 2024. There were 2 interview rounds.
First round was coding test in online mode which was quite easy.
based on 1 review
Rating in categories
Information Executive
254
salaries
| ₹1.5 L/yr - ₹4 L/yr |
Research Analyst
127
salaries
| ₹2 L/yr - ₹6 L/yr |
Business Development Manager
84
salaries
| ₹3.7 L/yr - ₹8 L/yr |
Associate Vice President
75
salaries
| ₹13.6 L/yr - ₹25 L/yr |
Senior Business Development Manager
72
salaries
| ₹4.9 L/yr - ₹9.6 L/yr |
Udaan
Swiggy
BlackBuck
Ninjacart