Filter interviews by
I applied via Job Fair and was interviewed in Apr 2023. There were 4 interview rounds.
The interviewer being an angry client and the interviewee having to perform objections handling.
I applied via Referral and was interviewed in Oct 2024. There were 2 interview rounds.
Basic DP Backtracking Minimum Path Sum
LLMs are Large Language Models used in natural language processing tasks.
LLMs are advanced models that can generate human-like text based on input data.
They are typically trained on large amounts of text data to learn patterns and relationships.
Examples of LLMs include GPT-3 (Generative Pre-trained Transformer 3) and BERT (Bidirectional Encoder Representations from Transformers).
I applied via Referral and was interviewed in Feb 2024. There were 2 interview rounds.
TikTok interview questions for popular designations
I applied via Company Website and was interviewed in May 2024. There was 1 interview round.
Get interview-ready with Top TikTok Interview Questions
I applied via LinkedIn
Leetcode 1 medium question
Hacker Rank, 5 questions in total. Topics include operating system, dynamic programming, sql, and so on.
The underlying database of MySQL is InnoDB.
InnoDB is the default storage engine for MySQL.
It provides ACID-compliant transactions.
Supports foreign keys for referential integrity.
InnoDB is designed for high performance and scalability.
Computers connect with each other using IP/TCP through a series of protocols and addressing schemes.
IP (Internet Protocol) assigns a unique address to each device on a network.
TCP (Transmission Control Protocol) manages the transmission of data between devices.
Devices communicate by sending packets of data over the network using IP addresses and port numbers.
Routers and switches help route the packets to their destinat...
Word search II is a problem where you have to find all words from a given list in a 2D board of characters.
Use a trie data structure to efficiently search for words in the board.
Implement a backtracking algorithm to explore all possible paths in the board.
Optimize the search by pruning branches that cannot lead to a valid word.
Design a search algorithm to find the top k elements in a dataset.
Use a priority queue to efficiently retrieve the top k elements.
Implement a max heap to keep track of the top k elements.
Consider using quickselect algorithm for optimal performance.
Optimize the search algorithm for time complexity O(n log k).
Tiny URL design involves creating a shorter version of a long URL for easier sharing and tracking.
Use a hashing algorithm to generate a unique short code for each long URL
Store the mapping of short code to long URL in a database
Redirect users from short URL to original URL when accessed
Two Sum, Leetcode 41, if you've done it before it's easy
Leetcode 93, restore IP address
Top trending discussions
Interview experience
Data Analyst
4
salaries
| ₹6.8 L/yr - ₹9.5 L/yr |
Accounts Manager
4
salaries
| ₹13 L/yr - ₹14 L/yr |
SME
4
salaries
| ₹3.5 L/yr - ₹9 L/yr |
Content Moderator
4
salaries
| ₹3 L/yr - ₹5 L/yr |
Payroll Manager
3
salaries
| ₹22 L/yr - ₹30 L/yr |
Snapchat
YouTube