Filter interviews by
The 2 Sum problem involves finding two numbers in an array that add up to a specific target sum.
Use a hash map to store numbers and their indices for quick lookup.
Iterate through the array, checking if the complement (target - current number) exists in the map.
Example: For nums = [2, 7, 11, 15] and target = 9, return indices [0, 1] since 2 + 7 = 9.
Time complexity is O(n) due to single pass through the array.
Calculate the number of hotel bookings from a given dataset of hotels and their booking details.
Identify the data structure: Ensure the dataset contains booking information, such as hotel ID, customer ID, and booking dates.
Count unique bookings: Use a method to count unique entries based on hotel ID and booking dates to avoid duplicates.
Example: If hotel A has 3 bookings on different dates and hotel B has 2 bookin...
SQL joins combine rows from two or more tables based on related columns, essential for relational database queries.
INNER JOIN: Returns records with matching values in both tables. Example: SELECT * FROM A INNER JOIN B ON A.id = B.a_id;
LEFT JOIN: Returns all records from the left table and matched records from the right table. Example: SELECT * FROM A LEFT JOIN B ON A.id = B.a_id;
RIGHT JOIN: Returns all records fro...
Determine if a continuous subarray sums to a multiple of k.
A continuous subarray is defined as a sequence of elements from the array.
The sum of the subarray must be a multiple of k (i.e., sum % k == 0).
Example: For nums = [23, 2, 4, 6, 7] and k = 6, the subarray [2, 4] sums to 6, which is a multiple of 6.
Use a hashmap to store the cumulative sum and its index to check for previous occurrences.
If the same cumulativ...
Dynamic programming approach to solve the stair climbing problem efficiently.
Define the problem: Given n stairs, find the number of ways to reach the top.
Base cases: If n = 0, return 1; if n = 1, return 1.
Recurrence relation: ways(n) = ways(n-1) + ways(n-2).
Use an array to store results of subproblems to avoid recomputation.
Example: For n = 4, ways(4) = ways(3) + ways(2) = 3 + 2 = 5.
Determine the best time to buy and sell stock to maximize profit from given price data.
Identify the lowest price to buy before a higher price to sell.
Track price changes over time to find optimal buy/sell points.
Example: Prices = [7, 1, 5, 3, 6, 4]; Buy at 1, sell at 6 for max profit of 5.
Consider edge cases: prices always decreasing means no profit can be made.
Implement various operations on a linked list and solve related problems like reversing a linked list or detecting a cycle.
Understand the basic structure of a linked list with nodes containing data and a reference to the next node.
For insertion, update the pointers of the nodes accordingly to maintain the sequence.
For deletion, adjust the pointers to skip the node to be deleted.
To reverse a linked list, iterate th...
Longest common subsequence is the longest sequence of characters that appear in the same order in two or more strings.
Use dynamic programming to solve this problem efficiently.
Create a 2D array to store the lengths of longest common subsequences of substrings.
Traverse the array to find the longest common subsequence.
Implement various operations on a linked list and solve related problems like reversing a linked list or detecting a cycle.
Understand the basic structure of a linked list with nodes containing data and a reference to the next node.
For insertion, update the pointers of the nodes accordingly to maintain the sequence.
For deletion, adjust the pointers to skip the node to be deleted.
To reverse a linked list, iterate through...
Calculate the number of hotel bookings from a given dataset of hotels and their booking details.
Identify the data structure: Ensure the dataset contains booking information, such as hotel ID, customer ID, and booking dates.
Count unique bookings: Use a method to count unique entries based on hotel ID and booking dates to avoid duplicates.
Example: If hotel A has 3 bookings on different dates and hotel B has 2 bookings, t...
SQL joins combine rows from two or more tables based on related columns, essential for relational database queries.
INNER JOIN: Returns records with matching values in both tables. Example: SELECT * FROM A INNER JOIN B ON A.id = B.a_id;
LEFT JOIN: Returns all records from the left table and matched records from the right table. Example: SELECT * FROM A LEFT JOIN B ON A.id = B.a_id;
RIGHT JOIN: Returns all records from the...
I applied via Campus Placement and was interviewed in Apr 2024. There were 2 interview rounds.
He will be asking you about the logic you used to solve the OA questions. So prepare well.
He then asked questions from my resume and asked me to code and explain cycle in a linked list. I easily did the coding part using brute force and optimized approach but then he asked my to give proof that why tortoise and hare algo will work here. I explained him the mathematical proof.
Determine if a continuous subarray sums to a multiple of k.
A continuous subarray is defined as a sequence of elements from the array.
The sum of the subarray must be a multiple of k (i.e., sum % k == 0).
Example: For nums = [23, 2, 4, 6, 7] and k = 6, the subarray [2, 4] sums to 6, which is a multiple of 6.
Use a hashmap to store the cumulative sum and its index to check for previous occurrences.
If the same cumulative sum...
posted on 7 Oct 2023
Easy basic dsa questions
Longest common subsequence is the longest sequence of characters that appear in the same order in two or more strings.
Use dynamic programming to solve this problem efficiently.
Create a 2D array to store the lengths of longest common subsequences of substrings.
Traverse the array to find the longest common subsequence.
Top trending discussions
I applied via Referral and was interviewed in Feb 2024. There were 2 interview rounds.
SEO stands for Search Engine Optimization. It is the process of optimizing a website to improve its visibility on search engines.
SEO involves optimizing website content, meta tags, and backlinks to improve search engine rankings.
Keywords play a crucial role in SEO, as they help search engines understand the content of a website.
Quality content, mobile optimization, and user experience are also important factors in SEO.
...
SEO checklist includes keyword research, on-page optimization, link building, and tracking results.
Perform keyword research to identify relevant keywords for your website
Optimize on-page elements such as title tags, meta descriptions, and headings
Build high-quality backlinks from reputable websites
Track and analyze SEO performance using tools like Google Analytics
I applied via Referral and was interviewed before Sep 2021. There were 2 interview rounds.
I applied via LinkedIn and was interviewed in Jul 2020. There was 1 interview round.
RLSA campaigns are a type of Google Ads campaign that allows advertisers to target previous website visitors with customized ads when they search on Google.
RLSA stands for Remarketing Lists for Search Ads.
It allows advertisers to adjust bids, create tailored ads, and target specific keywords for users who have previously visited their website.
RLSA campaigns can help increase conversion rates and ROI by targeting users ...
I applied via Referral and was interviewed before Sep 2023. There were 2 interview rounds.
SEO helps businesses improve their online visibility, attract more organic traffic, and increase brand awareness.
SEO helps businesses rank higher in search engine results, leading to increased organic traffic.
It helps improve website usability and user experience, leading to higher conversion rates.
SEO can help businesses build brand credibility and trust among consumers.
It allows businesses to target specific keywords...
Off page SEO involves external factors like backlinks, on page SEO focuses on optimizing content and technical SEO deals with website structure and performance.
Off page SEO includes building backlinks from other websites to improve search engine rankings.
On page SEO involves optimizing content, meta tags, and headings for better visibility on search engines.
Technical SEO focuses on improving website structure, speed, a...
Salary expectations are based on industry standards, experience, and skills.
Research industry standards for SEO Executive salaries
Consider your level of experience and skills
Factor in the location of the job and cost of living
Be prepared to negotiate based on the job responsibilities and benefits package
I applied via Referral and was interviewed in Mar 2024. There were 2 interview rounds.
I handle SEO projects by conducting keyword research, optimizing website content, building backlinks, and analyzing performance metrics.
Conduct thorough keyword research to identify relevant terms and phrases
Optimize website content by incorporating keywords naturally and improving meta tags
Build quality backlinks from reputable websites to improve search engine rankings
Analyze performance metrics such as organic traff...
I manage SEO growth by conducting keyword research, optimizing website content, building backlinks, and tracking performance metrics.
Conduct thorough keyword research to identify high-traffic keywords relevant to the business
Optimize website content by incorporating target keywords naturally and strategically
Build quality backlinks from reputable websites to improve domain authority and search engine rankings
Track perf...
based on 6 interview experiences
Difficulty level
Duration
6-8 Yrs
Not Disclosed
7-10 Yrs
Not Disclosed
Software Engineer
7
salaries
| ₹14 L/yr - ₹23 L/yr |
Data Analyst
4
salaries
| ₹3.7 L/yr - ₹8.6 L/yr |
Web Developer
4
salaries
| ₹1.2 L/yr - ₹3 L/yr |
Territory Manager
4
salaries
| ₹3.5 L/yr - ₹4.5 L/yr |
Business Head
4
salaries
| ₹30.5 L/yr - ₹48 L/yr |
CallOne Consultants
Viska
Conversion Perk
The Digital Serve