Filter interviews by
Design a web crawler to fetch and index web pages
Start by defining the scope of the crawler (e.g. which websites to crawl)
Implement a system to fetch web pages using HTTP requests
Parse the HTML content to extract relevant information (e.g. links, text)
Store the extracted data in a database or index for later retrieval
Implement a scheduling mechanism to prioritize and manage the crawling process
I appeared for an interview in Mar 2022.
Round duration - 60 Minutes
Round difficulty - Easy
LLD Round (but with machine coding sort of expectations in whatever that can be done in 60 mins)
Design a snake game
Use a 2D array to represent the game board
Keep track of the snake's position and direction
Handle user input to change the snake's direction
Update the snake's position and check for collisions with walls or itself
Add food to the board and handle eating it to grow the snake
Keep track of the score and display it to the player
Round duration - 60 Minutes
Round difficulty - Easy
DSA
Given an array of N
non-empty words and an integer K
, return the K
most frequent words sorted by their frequency from highest to lowest.
N = 6, K...
Given an array of words and an integer k, return the k most frequent words sorted by frequency.
Use a hashmap to count the frequency of each word
Use a priority queue to keep track of the k most frequent words
Sort the priority queue based on frequency and lexicographical order
Round duration - 60 Minutes
Round difficulty - Easy
Round duration - 60 Minutes
Round difficulty - Easy
Managerial Round (Some questions on projects and general situation based questions)
Round duration - 45 minutes
Round difficulty - Easy
Values round
Tip 1 : Practised topic wise leetcode questions from basics
Tip 2 : Watched so many system design mock interviews
Tip 3 : Did mock interviews with friends for DSA and System design rounds.
Tip 1 : Single page resume.
Tip 2 : Get it proof read by friends and professionals and take feedback.
Top trending discussions
I appeared for an interview before Mar 2021.
Round duration - 60 minutes
Round difficulty - Medium
Technical Interview round with questions on DSA.
Design a data structure for a Least Recently Used (LRU) cache that supports the following operations:
1. get(key)
- Return the value of the key if it exists in the cache; otherw...
Design a Least Recently Used (LRU) cache data structure that supports get and put operations with capacity constraint.
Use a combination of hashmap and doubly linked list to implement the LRU cache.
Keep track of the least recently used item and evict it when the cache reaches its capacity.
Update the position of an item in the cache when it is accessed or updated.
Handle both get and put operations efficiently to maintain...
Your task is to determine the minimum number of platforms required at a railway station so that no train has to wait.
Given two arrays:
AT
- represent...The task is to determine the minimum number of platforms required at a railway station so that no train has to wait.
Sort the arrival and departure times arrays in ascending order.
Initialize two pointers, one for arrival and one for departure.
Increment the platform count when a train arrives and decrement when it departs.
Keep track of the maximum platform count needed.
Return the maximum platform count as the minimum num...
Round duration - 45 minutes
Round difficulty - Medium
Technical Interview round with DSA based questions.
You are given a Singly Linked List of integers. Your task is to reverse the Linked List by changing the links between nodes.
The first line of input contai...
Reverse a given singly linked list by changing the links between nodes.
Iterate through the linked list and reverse the links between nodes
Use three pointers to keep track of the current, previous, and next nodes
Update the links between nodes to reverse the list
Return the head of the reversed linked list
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
I applied via Approached by Company and was interviewed before Jun 2021. There were 2 interview rounds.
Frameworks provide structure and pre-built components for software development, but can also limit flexibility and require learning curve.
Advantage: Provides structure and pre-built components for faster development
Advantage: Can improve code quality and maintainability
Disadvantage: Can limit flexibility and customization
Disadvantage: Requires learning curve and potential dependency issues
Example: ReactJS provides a fr...
Oops stands for Object-Oriented Programming. It is a programming paradigm that uses objects to represent real-world entities.
Advantages: code reusability, modularity, encapsulation, inheritance, polymorphism
Disadvantages: complexity, steep learning curve, performance overhead
Example: creating a class 'Car' with properties like 'make', 'model', and 'year', and methods like 'start_engine' and 'stop_engine'
I applied via Company Website and was interviewed before Oct 2019. There were 4 interview rounds.
Design a traffic signal system
Identify the number of lanes and intersections
Determine the traffic flow and peak hours
Choose appropriate sensors and controllers
Implement a synchronization algorithm
Consider emergency vehicle prioritization
Include pedestrian crossing signals
Ensure compliance with local regulations
Hashmap is a data structure that stores key-value pairs and provides constant time complexity for insertion, deletion, and retrieval.
Hashmap uses hashing function to map keys to indices in an array
Collisions can occur when multiple keys map to the same index, which can be resolved using separate chaining or open addressing
Java implementation: HashMap<String, Integer> map = new HashMap<>();
Printing patterns using code
Identify the pattern to be printed
Use loops to print the pattern
Adjust the loop variables to control the pattern
Use conditional statements to modify the pattern
Examples: printing stars, triangles, squares, etc.
Common point in linked list refers to the node where two or more linked lists intersect.
The common point can be found by traversing both linked lists and comparing the nodes.
The common point can also be found by using two pointers, one for each linked list, and moving them until they meet at the common point.
Examples include finding the intersection point of two linked lists or finding the loop in a linked list.
I appeared for an interview before Sep 2020.
Round duration - 120 Minutes
Round difficulty - Easy
The round was conducted in day around 3PM.
Given an array ARR
consisting of 'N' positive integers, determine if it is possible to partition the array into two subsets such that the sum of the elements in both sub...
The problem is to determine if it is possible to partition an array into two subsets with equal sum.
Use dynamic programming to solve this problem efficiently.
Create a 2D array to store the results of subproblems.
Check if the sum of the array is even before attempting to partition it.
Iterate through the array and update the 2D array based on the sum of subsets.
Return true if a subset with half the sum is found, false ot...
Round duration - 30 Minutes
Round difficulty - Easy
The interview was preponed and was conducted at 9AM.
The interviewer was friendly and I had saw him earlier at pre-placement talk.
Given a string STR
, your task is to remove spaces from STR
and convert it to Pascal case format. The function should return the modified STR
.
In Pascal case, words are con...
Convert a given string to Pascal case format by removing spaces and capitalizing the first letter of each word.
Iterate through each character in the string
If the character is a space, skip it
If the character is not a space and the previous character is a space or it is the first character, capitalize it
SQL query to retrieve the Nth highest salary from a database
Use the ORDER BY clause to sort salaries in descending order
Use the LIMIT clause to retrieve the Nth highest salary
Consider handling cases where there might be ties for the Nth highest salary
Round duration - 30 Minutes
Round difficulty - Easy
This round was conducted 15mins after 1st round.
You are given a singly Linked List with 'N' nodes containing integer data and an integer 'K'. Your task is to delete the Kth node from the end of this Lin...
Remove the Kth node from the end of a singly linked list.
Traverse the list to find the length 'N'.
Calculate the position of the node to be removed from the beginning as 'N - K + 1'.
Remove the node at the calculated position.
Handle edge cases like removing the head or tail of the list.
Update the pointers accordingly after removal.
Tip 1 : Do Competitive Coding
Tip 2 : Learn at least 1 framework
Tip 3 : Build interest in computers
Tip 1 : Be well informed of everything you mention in your resume
Tip 2 : Mention competitive coding achivements in your resume(if any)
I applied via LinkedIn and was interviewed in May 2021. There were 4 interview rounds.
I applied via LinkedIn and was interviewed in Apr 2021. There were 4 interview rounds.
based on 1 interview experience
Software Engineer
262
salaries
| ₹32.1 L/yr - ₹57.4 L/yr |
Senior Software Engineer
178
salaries
| ₹42 L/yr - ₹77.7 L/yr |
Software Developer
99
salaries
| ₹33.5 L/yr - ₹57.5 L/yr |
Senior Data Engineer
90
salaries
| ₹23.9 L/yr - ₹61.5 L/yr |
Sde1
83
salaries
| ₹45.6 L/yr - ₹84.2 L/yr |
Salesforce
Amazon
Oracle