i
Index Exchange
Filter interviews by
I applied via LinkedIn and was interviewed before May 2023. There were 3 interview rounds.
1. Was asked to write code to develop a simple API and then unit test it.
2. To write a function that continuously monitors data from Kafka and performs quality validations on it.
Distributed systems design techniques involve strategies for ensuring scalability, fault tolerance, and consistency in a network of interconnected nodes.
Use of replication for fault tolerance and load balancing
Partitioning data to improve performance and scalability
Consensus algorithms like Paxos or Raft for ensuring consistency
Message passing protocols like gRPC or Kafka for communication between nodes
REST API design, Scalability, DB scalability, query improvements.
Top trending discussions
Leetcode easy-medium
Cyber security is the practice of protecting systems, networks, and data from digital attacks.
Cyber security involves implementing measures to prevent unauthorized access, data breaches, and other cyber threats.
It includes technologies, processes, and practices designed to protect networks, devices, programs, and data from attack, damage, or unauthorized access.
Examples of cyber security measures include firewalls, ant...
Types of encryption include symmetric encryption, asymmetric encryption, and hashing.
Symmetric encryption: Uses the same key for both encryption and decryption, examples include AES and DES.
Asymmetric encryption: Uses a pair of public and private keys for encryption and decryption, examples include RSA and ECC.
Hashing: Converts data into a fixed-size string of bytes, examples include MD5 and SHA.
I applied via Job Portal
It was a virtual coding round with coding questions on Java fundamentals, Array, LinkedList
Questions on java fundamentals, some code snippets, Array
DSA - Linked List, Trees
I applied via Referral and was interviewed in Oct 2022. There were 4 interview rounds.
Printing the right view of a tree using recursion and level order traversal.
Recursively traverse the right subtree first and then the left subtree.
For level order traversal, use a queue to store nodes at each level.
Print the rightmost node at each level.
Example: For tree 1-2-3-4-5, the right view is 1-2-4-5.
Polymorphism is a key feature of OOP in C#. Extension methods allow adding new functionality to existing types.
Polymorphism allows objects of different classes to be treated as if they are of the same type.
Extension methods are static methods that can be called as if they were instance methods of the extended type.
Polymorphism and extension methods can be used together to add new behavior to existing types without modi
Angular is a framework for building web applications using TypeScript, which is a superset of JavaScript.
Angular provides a structure for building web applications using components, services, and modules.
TypeScript is a statically typed language that provides better tooling and error checking than JavaScript.
Services in Angular are used for sharing data and functionality across components.
Components in Angular are the ...
posted on 28 Oct 2022
I applied via Naukri.com and was interviewed before Oct 2021. There were 2 interview rounds.
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
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.
I applied via campus placement at Indian Institute of Technology (IIT), Kharagpur
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
based on 1 interview
Interview experience
based on 1 review
Rating in categories
R.R. Donnelley
Denave
Smollan Group
ChannelPlay