Filter interviews by
Top trending discussions
I applied via Referral and was interviewed before Oct 2022. There were 3 interview rounds.
50 questions in 12mins
I applied via Company Website and was interviewed in Dec 2021. There were 4 interview rounds.
Code to find frequency of characters in a given string
Use a hash table to store character frequencies
Iterate through the string and update the hash table accordingly
Print the hash table to display the character frequencies
Code to reverse a linked list
Create three pointers: prev, curr, and next
Initialize prev to null and curr to head
Loop through the list and set next to curr's next node
Set curr's next node to prev
Move prev and curr one node ahead
Return prev as the new head
Code to reverse linked list in size of K
Create a function that takes head of linked list and size K as input
Traverse the linked list in groups of K nodes
Reverse each group of K nodes using iterative or recursive approach
Connect the reversed groups to form the final linked list
Return the new head of the reversed linked list
posted on 24 Jun 2023
Given an simple gaming questions to be developed in JS
Given another UI design in image to be developed
I applied via Referral and was interviewed in Sep 2023. There was 1 interview round.
Merge two sorted linked lists into a single sorted linked list
Create a new linked list to store the merged result
Iterate through both input linked lists and compare nodes to determine the order in which they should be merged
Update the next pointers of the nodes in the new linked list accordingly
posted on 27 Jan 2017
I appeared for an interview in Dec 2016.
I applied via Naukri.com and was interviewed in May 2021. There were 4 interview rounds.
Quick sort is a divide and conquer algorithm that sorts the array by selecting a pivot element and partitioning the other elements around it. Merge sort is also a divide and conquer algorithm that divides the array into two halves, sorts them separately and then merges them.
Quick sort has an average time complexity of O(n log n) while merge sort has a time complexity of O(n log n) in all cases.
Quick sort is an in-place...
System design for Naukri.com platform
Identify user requirements and design the system architecture accordingly
Use scalable and reliable technologies for high traffic handling
Implement features like job search, job posting, resume upload, etc.
Ensure data security and privacy of users
Integrate with third-party services like payment gateways, social media platforms, etc.
Highest sum of contiguous subarray in an array
Use Kadane's algorithm to find the maximum sum subarray
Initialize max_so_far and max_ending_here to 0
Loop through the array and update max_ending_here and max_so_far
Return max_so_far as the highest subset sum subarray
I applied via Naukri.com and was interviewed in May 2021. There were 3 interview rounds.
Add two linked lists and return the sum as a linked list.
Traverse both linked lists and add the corresponding nodes.
Handle carry over while adding nodes.
Create a new linked list to store the sum and return it.
Quick sort is faster but unstable, while merge sort is slower but stable.
Quick sort uses a pivot element to divide the array into two parts and recursively sorts them.
Merge sort divides the array into two halves, sorts them separately, and then merges them.
Quick sort has an average time complexity of O(n log n), while merge sort has a time complexity of O(n log n) in all cases.
Quick sort is not stable, meaning that the...
I applied via Campus Placement and was interviewed in Jun 2021. There were 3 interview rounds.
based on 1 interview
Interview experience
Software Engineer
7
salaries
| ₹10 L/yr - ₹20 L/yr |
Front end Developer
5
salaries
| ₹10 L/yr - ₹14 L/yr |
Backend Developer
3
salaries
| ₹10 L/yr - ₹10 L/yr |
Software Development Engineer
3
salaries
| ₹9 L/yr - ₹18.7 L/yr |
Product Engineer
3
salaries
| ₹15 L/yr - ₹19 L/yr |
Cogoport
Arzooo.com
KrazyBee
Treebo Hotels