AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
GrowthJockey Sde1 Interview Questions and Answers
GrowthJockey Sde1 Interview Experiences
1 interview found
Anonymous
I applied via Campus Placement
(1 Question)
- Q1. Introduction and mention why you fit for the rolr
Assignment based on UI design
Interview Preparation Tips
Top trending discussions
Interview questions from similar companies
I appeared for an interview in Aug 2017.
Interview Questionnaire
17 Questions
- Q1. -----/ But here the main thing is that handling of corner cases like when there are duplicate tickets and when there is no proper path possible with given tickets
- Q2. -----/
- Q3. N queen problem with problem statement and dry running of code with 4 queens and then writing the code
- Q4. Sub set problem(Check if there exists any sub array with given sum in the array ) . But the thing here is that we have to do it with space complexity of only O( 1 K ) . K is the sum given .
- Q5. What is NP hardness .
- Ans.
NP hardness refers to the difficulty of solving a problem in non-deterministic polynomial time.
NP-hard problems are some of the most difficult problems in computer science.
They cannot be solved in polynomial time by any known algorithm.
Examples include the traveling salesman problem and the knapsack problem.
- Q6. What is the difference between references and pointers
- Q7. What is difference between reference variable and actual reference
- Ans.
A reference variable is a variable that holds the memory address of an object, while an actual reference is the object itself.
A reference variable is declared with a specific type and can only refer to objects of that type.
An actual reference is the object itself, which can be accessed and manipulated using the reference variable.
Changing the value of a reference variable does not affect the original object, but changi...
- Q8. In this round he asked me about previous round questions and their time complexities also . and with every DS and Algo related questions they asked the time complexities
- Q9. Segmentation , virtual memory , paging
- Q10. 0-1 Knapsack problem
- Ans.
The 0-1 Knapsack problem involves maximizing value within a weight limit using items that can either be included or excluded.
Dynamic Programming approach is commonly used to solve this problem.
Each item has a weight and a value; you cannot take fractional items.
Example: If you have items with weights [1, 2, 3] and values [10, 15, 40], and a capacity of 6, the maximum value is 55.
The solution involves creating a table t...
- Q11. What happens when we type an URL
- Ans.
When we type an URL, the browser sends a request to the server hosting the website and retrieves the corresponding webpage.
The browser parses the URL to extract the protocol, domain, and path.
It resolves the domain name to an IP address using DNS.
The browser establishes a TCP connection with the server.
It sends an HTTP request to the server.
The server processes the request and sends back an HTTP response.
The browser re...
- Q12. Implementation of LRU (WIth Production level code)
- Ans.
Implementation of LRU cache using a doubly linked list and a hash map.
LRU (Least Recently Used) cache is a data structure that stores a fixed number of items and evicts the least recently used item when the cache is full.
To implement LRU cache, we can use a doubly linked list to maintain the order of items based on their usage frequency.
We can also use a hash map to store the key-value pairs for quick access and retrie...
- Q13. Given page access sequence and we have to tell final output using different page replacement algorithms like FIFO , LRU etc
- Ans.
Explaining page replacement algorithms like FIFO and LRU using a given page access sequence.
FIFO (First-In-First-Out): Replaces the oldest page in memory.
Example: Access sequence [1, 2, 3, 1, 2, 4] with 3 frames results in [1, 2, 4].
LRU (Least Recently Used): Replaces the page that hasn't been used for the longest time.
Example: Access sequence [1, 2, 3, 1, 2, 4] with 3 frames results in [2, 3, 4].
Optimal: Replaces the ...
- Q14. What is indexing in DBMS How do we maintain it
- Ans.
Indexing in DBMS is a technique to improve query performance by creating a data structure that allows faster data retrieval.
Indexing is used to speed up data retrieval operations in a database.
It involves creating a separate data structure that maps the values of a specific column to their corresponding records.
This data structure is called an index.
Indexes are typically created on columns that are frequently used in s...
- Q15. B trees , B+ trees with examples
- Q16. AVL trees with examples and their balancing
- Q17. Pid ={3,5,0,1} ppid ={5,4,2,2} process id(pid) ppid=parent process id let us say the process that we killed is 2 now we have to print 2,0,1 as 0,1 are child of 2 and suppose that if we have children f...
- Ans.
Given a list of process IDs and their corresponding parent process IDs, print the IDs of all processes that are children of a specific process ID, and recursively kill all their children.
Iterate through the list of process IDs and parent process IDs
Check if the current process ID is the one to be killed
If yes, recursively find and print all its children
If a child has further children, recursively kill them as well
Interview Preparation Tips
Experience: It is a written round .
We are given with 2 coding questions of 10 marks each .There is no negative marking for coding questions
1)Given a string you have to partition the string in such a manner that each part of the partitioned string is a palindrome in itself and you have to count the number of such partition
For eg: given string NITIN
N ITI N
N I T I N
NITIN
So output will be 3.
2)You are given with a large paragraph and N words.
You have to find a min length subparagraph of the paragraph which contain all those N words in any order. Here length of a paragraph is the count of words in the paragraph.
There are 20 MCQ's all are technical questions only majorly from DSA
Tips: Coding it comes from practice . And for aptitude be good at fundamentals like time complexities etc .
Round: Technical Interview
Experience: Some times luck in interview is also important .I was unable to solve the second question initially ,but later with the help of my interviewer I was able to solve it .
Tips: Even if you are not able to solve the question initially don't be panic it will definitely go well
Round: Technical Interview
Experience: There are so many other questions . But sorry to say that I don't remember all of them ,if I remember them at some other time I will again update it here .
This round interviewer was very nice person And he is very helpful in fact .
Tips: Have solid basics at all data structures and algorithms ,Operating Systems
Round: Technical Interview
Experience: This round is entirely about other CS subjects like OS , DBMS,Networking .
Here asked me do you know other CS subjects like compiler design etc .
But as I am from Electronics I told them that I don't know all those subjects
Tips: Be good at other Cs subjects also
Round: Technical Interview
Experience: I solved above question Using DFS .I constructed a Graph using given information . and I did DFS starting from Given process .In the graph I took each process as 1 Node and the corresponding parent child relationship between the process as edges .
Tips: They will give sufficient time for thinking of the solution . So don't worry immediately after seeing the question . First think well you will definitely get it
Skills: Algorithms And DataStructures, Algorithm Analysis, Operating Systems, Basic Knowledge Of DBMS, Networking Basics, Object Oriented Programming (OOP) Basics
College Name: MNIT
Skills evaluated in this interview
It was a part of placement drive, 1st OA than interview. The OA round was super easy I was able to code in minutes.
(1 Question)
- Q1. 2 Questions were asked. 1. Linked List sorting. 2. DP question.
Interview Preparation Tips
Selected
I applied via LinkedIn and was interviewed in Jun 2022. There were 2 interview rounds.
(2 Questions)
- Q1. Tell me about yourself
- Q2. Coding based questions
Interview Preparation Tips
Harshita Manwani
(2 Questions)
- Q1. What is linked list?
- Ans.
A linked list is a linear data structure where elements are stored in nodes with each node pointing to the next node in the sequence.
Consists of nodes connected by pointers
Does not have a fixed size like arrays
Can easily insert or delete elements without shifting other elements
Examples: Singly linked list, Doubly linked list, Circular linked list
- Q2. How to use set in javascript
- Ans.
Sets in JavaScript are used to store unique values of any type.
Create a new set using the Set constructor
Add values to the set using the add() method
Check if a value exists in the set using the has() method
Remove a value from the set using the delete() method
Iterate over the set using the forEach() method
Skills evaluated in this interview
3 Coding question on hackerrank (graph leet code medium)
(5 Questions)
- Q1. Asked two medium question 1. find element in a rotated sorted array 2. and basics of CS
- Q2. Final element in rotated array
- Ans.
Find the final element in a rotated array.
Identify the pivot point where the array was rotated.
Determine if the target element is in the first or second half of the array.
Use binary search to find the target element.
- Q3. Reorder Linked list
- Ans.
Reorder a linked list in place.
Use two pointers to find the middle of the list
Reverse the second half of the list
Merge the two halves of the list
- Q4. Intrsection point in linked list
- Ans.
Finding the intersection point of two linked lists.
Traverse both lists and find their lengths
Move the head of the longer list by the difference in lengths
Traverse both lists simultaneously until they meet at the intersection point
- Q5. Path sum between two tree node
- Ans.
Calculate the sum of all paths between two nodes in a binary tree.
Traverse the tree and keep track of the path and its sum from the root to the current node.
When the target nodes are found, calculate the sum of all paths between them by adding the path sums of their common ancestor.
Recursively traverse the left and right subtrees to find the target nodes.
Use a hash table to store the path sums of each node for efficien...
Skills evaluated in this interview
Selected
I applied via Referral and was interviewed in Jun 2023. There were 5 interview rounds.
2 questions of leetcode medium level
And also has to write the steps of the approaches
(1 Question)
- Q1. Leet code medium of array and dp
- Ans.
Dynamic programming problem involving arrays of strings.
Use dynamic programming to efficiently solve problems by breaking them down into smaller subproblems.
Consider using a 2D array to store intermediate results for optimal substructure.
Examples: Longest Common Subsequence, Word Break, Minimum Path Sum.
(1 Question)
- Q1. Leetcode medium of DP and behavioural questions
(1 Question)
- Q1. Leetcode medium questions and behavioural questions
Interview Preparation Tips
- Dp
- Array
- Recursion
- Behavioural questions
Skills evaluated in this interview
Binary Search Tree Traversal, 20 min, Leetcode
(3 Questions)
- Q1. What is caching? explain in detail.
- Ans.
Caching is the process of storing frequently accessed data in a temporary storage to improve performance.
Caching improves performance by reducing the need to fetch data from the original source.
It involves storing data in a temporary storage, such as memory or disk, closer to the user or application.
Caching can be done at various levels, including browser caching, server-side caching, and database caching.
Examples of c...
- Q2. What are POST requests?
- Ans.
POST requests are a type of HTTP request method used to submit data to a server.
POST requests are used to create or update resources on a server.
They are commonly used in web forms to submit user input data.
POST requests have a request body that contains the data being submitted.
They are different from GET requests, which are used to retrieve data from a server.
POST requests are more secure than GET requests because th...
- Q3. Did explain about that.
Interview Preparation Tips
Skills evaluated in this interview
Selected
I applied via Referral and was interviewed before Mar 2022. There were 4 interview rounds.
(1 Question)
- Q1. - 2 DSA questions Leetcode Medium - 1 Tree based and 1 Queue based. Need to dry run the solutions on their test cases. - Some Leadership principles questions
(1 Question)
- Q1. - 1 Leetcode Hard DSA question - Heap based question. Need to dry run the solutions on the test cases. - Some leadership,principles questions.
(1 Question)
- Q1. - Some Leadership principles questions. - 1 Hard Leetcode DSA question - Linkedlist based. Need to dry run teset cases
Interview Preparation Tips
- DSA
- Leadership Principles
- Trees
- Linkedlist
- Heaps
- queues
- Graph
Prepare for leadership principles questions as well, don't underestimate them.
Leetcode medium problems
(1 Question)
- Q1. Find middle of linkedlist add 2 numbers
- Ans.
To find the middle of a linked list, use two pointers - one moving twice as fast as the other. To add two numbers, traverse both lists simultaneously and add corresponding digits.
Use two pointers to find the middle of the linked list - one moving twice as fast as the other
To add two numbers represented by linked lists, traverse both lists simultaneously and add corresponding digits
If the sum of two digits is greater th...
Interview Preparation Tips
Skills evaluated in this interview
GrowthJockey Interview FAQs
Tell us how to improve this page.
Overall Interview Experience Rating
based on 1 interview experience
Sde1 Interview Questions from Similar Companies
|
Business Analyst
5
salaries
|  ₹1 L/yr - ₹8 L/yr |
|
Project Manager
4
salaries
| ₹5 L/yr - ₹8 L/yr |
|
Data Analyst
4
salaries
| ₹1.8 L/yr - ₹9.5 L/yr |
|
Performance Marketing Manager
4
salaries
| ₹8.5 L/yr - ₹12 L/yr |
|
Software Developer
3
salaries
| ₹9 L/yr - ₹12 L/yr |
TCS
Accenture
Wipro
Cognizant
- Home >
- Interviews >
- GrowthJockey Interview Questions
