i
Netcore Cloud Private Limited
Filter interviews by
Clear (1)
I applied via Campus Placement and was interviewed in May 2021. There was 1 interview round.
Top trending discussions
There are 2 sections one is Output guess and Another one is Quantitative
I didn't attend 2nd round..i was eliminated in 1st round
20 questions of aptitude
Hard
Very hard
Algorithms for manipulating arrays and strings in coding
Use sorting algorithms like quicksort and mergesort for arrays
Use string manipulation functions like substring and replace for strings
Use dynamic programming for optimizing solutions to array and string problems
Designing a large scale Ad Server
Use distributed systems for scalability
Implement caching for faster ad delivery
Ensure high availability and fault tolerance
Use real-time bidding for efficient ad placement
Implement fraud detection mechanisms
Ensure compliance with privacy regulations
I applied via Campus Placement
I am an avid traveler and have visited over 20 countries
I love experiencing new cultures and trying new foods
I have backpacked through Europe and Asia
I have volunteered in orphanages in Cambodia and Nepal
Mobile advertising platform
Adtech
Mobile marketing
App monetization
Maximum sub sequence sum in an array
Use Kadane's algorithm
Initialize max_so_far and max_ending_here to 0
Iterate through the array and update max_ending_here and max_so_far
Return max_so_far
Endianness refers to the byte order of a system. It determines how multi-byte data types are stored in memory.
Little-endian systems store the least significant byte first, while big-endian systems store the most significant byte first.
Endianness can affect the way data is transmitted between systems.
To determine the endianness of a system, you can use the byte order mark (BOM) or write a test program that checks the by...
Sort an array of 0's and 1's only.
Use two pointers, one at the beginning and one at the end of the array.
Swap 0's from the beginning with 1's from the end until the pointers meet.
Alternatively, use a counting sort algorithm to count the number of 0's and 1's and then reconstruct the array.
Heaps are data structures used to efficiently find the maximum or minimum element in a collection.
Max heap: parent nodes are always greater than or equal to child nodes
Min heap: parent nodes are always smaller than or equal to child nodes
Heaps are commonly used in priority queues and sorting algorithms
Heap operations include insert, delete, and extract max/min
Example: An array [3, 8, 2, 5, 1, 4, 6] can be represented a
Find 3 numbers in an array where a+b=c.
Loop through the array and check for all possible combinations of a and b.
Use a hash table to store the values of a and b, and check if c is present in the hash table.
Sort the array and use two pointers to find a and b, and then check if their sum equals c.
posted on 7 Sep 2015
I applied via Referral
3 DSA questions on array and strings 1 easy, 2 medium level
Create django backend project for book store
Null is absence of value while object is a collection of properties and methods.
Null is a primitive value while object is a complex data type.
Null is used to indicate absence of value while object is used to represent real-world entities.
Null cannot have properties or methods while object can have both.
Example of null: let x = null; Example of object: let person = { name: 'John', age: 30 };
based on 6 reviews
Rating in categories
Senior Software Engineer
71
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
69
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Manager
64
salaries
| ₹0 L/yr - ₹0 L/yr |
Customer Success Manager
41
salaries
| ₹0 L/yr - ₹0 L/yr |
Manager Enterprise Sales
21
salaries
| ₹0 L/yr - ₹0 L/yr |
WebEngage
CleverTap
MoEngage
Vizury