#multithreading - creating more problems ๐คฃ
Double Tap the picture, if you can understand or relate to it. ๐
#technology #softwareengineer
Stay away from multi-threading if you are not 500% sure ๐
Double Tap the picture, if you can understand or relate to it. ๐
#technology #softwareengineer
Stay away from multi-threading if you are not 500% sure ๐
Most Asked Coding Question || MAANG
Best resources for those who are preparing for coding interviews and looking for some good resources and want to taste the level of questions got asked by top tech companies. Here I am sharing the top 25 most asked questions.
1) Two Sum - https://lnkd.in/dQ9-RjYS
2) Longest Substring Without Repeat - https://lnkd.in/d6qEHbbJ
3) Longest Common Prefix - https://lnkd.in/dxDSaJkM
4) Three Sum - https://lnkd.in/dK8q6qbu
5) Balanced Parentheses - https://lnkd.in/dvbKUe7y
6) Search Rotated Sorted Array - https://lnkd.in/djxEpFxF
7) Trapping Rain Water - https://lnkd.in/dsrAMHeP
8) Row Column Zero - https://lnkd.in/dhwCG-AY
9) Largest Rectangle in Histogram - https://lnkd.in/dQHQcF-5
10) Binary Tree Zigzag Level Order Traversal - https://lnkd.in/df7YeBJj
11) Populating Next Right Pointers in Each Node - https://lnkd.in/dFHh8FTy
12) Word Ladder - https://lnkd.in/dUDaTg_t
13) Palindrome Partitioning - https://lnkd.in/dga2EeBx
14) Clone List with Random Pointer - https://lnkd.in/d6YAzXRV
15) Word Break - II - https://lnkd.in/duEVGJg2
16) LRU Cache - https://lnkd.in/dMsV78ei
17) Sliding Window Maximum - https://lnkd.in/dDSTYAAj
18) Median From Data Stream - https://lnkd.in/dA8mCy-3
19) Longest Increasing Subsequence (LIS) - https://lnkd.in/da-47J_A
20) Super Egg Drops - https://lnkd.in/dAnSimGQ
21) Best Time to Buy and Sell Stock III - https://lnkd.in/dap__SJZ
22) Compare Version Numbers - https://lnkd.in/d_64P2Pf
23) Max Meetings in a Room - https://lnkd.in/deBDaA8p
24) Next Greater Element - https://lnkd.in/dUhU-SUb
25) Maximum k-Substring Vowels - https://lnkd.in/dT9KUJ4i
Content type - #interviewquestionsTags -
#interviews #leetcode #questions #array #sorting #queue #loop #tree #graphs #amazon #sde #interviewpreparation #coding #computerscience #softwareengineer #workforwin
Best resources for those who are preparing for coding interviews and looking for some good resources and want to taste the level of questions got asked by top tech companies. Here I am sharing the top 25 most asked questions.
1) Two Sum - https://lnkd.in/dQ9-RjYS
2) Longest Substring Without Repeat - https://lnkd.in/d6qEHbbJ
3) Longest Common Prefix - https://lnkd.in/dxDSaJkM
4) Three Sum - https://lnkd.in/dK8q6qbu
5) Balanced Parentheses - https://lnkd.in/dvbKUe7y
6) Search Rotated Sorted Array - https://lnkd.in/djxEpFxF
7) Trapping Rain Water - https://lnkd.in/dsrAMHeP
8) Row Column Zero - https://lnkd.in/dhwCG-AY
9) Largest Rectangle in Histogram - https://lnkd.in/dQHQcF-5
10) Binary Tree Zigzag Level Order Traversal - https://lnkd.in/df7YeBJj
11) Populating Next Right Pointers in Each Node - https://lnkd.in/dFHh8FTy
12) Word Ladder - https://lnkd.in/dUDaTg_t
13) Palindrome Partitioning - https://lnkd.in/dga2EeBx
14) Clone List with Random Pointer - https://lnkd.in/d6YAzXRV
15) Word Break - II - https://lnkd.in/duEVGJg2
16) LRU Cache - https://lnkd.in/dMsV78ei
17) Sliding Window Maximum - https://lnkd.in/dDSTYAAj
18) Median From Data Stream - https://lnkd.in/dA8mCy-3
19) Longest Increasing Subsequence (LIS) - https://lnkd.in/da-47J_A
20) Super Egg Drops - https://lnkd.in/dAnSimGQ
21) Best Time to Buy and Sell Stock III - https://lnkd.in/dap__SJZ
22) Compare Version Numbers - https://lnkd.in/d_64P2Pf
23) Max Meetings in a Room - https://lnkd.in/deBDaA8p
24) Next Greater Element - https://lnkd.in/dUhU-SUb
25) Maximum k-Substring Vowels - https://lnkd.in/dT9KUJ4i
Content type - #interviewquestionsTags -
#interviews #leetcode #questions #array #sorting #queue #loop #tree #graphs #amazon #sde #interviewpreparation #coding #computerscience #softwareengineer #workforwin
LeetCode
Two Sum - LeetCode
Two Sum - Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.
You may assume that each input would have exactly one solution, and you may not use the same element twice.
You can returnโฆ
You may assume that each input would have exactly one solution, and you may not use the same element twice.
You can returnโฆ
๐1
Top LeetCode questions asked in Google Interviews for SDE role (PART-1) ๐
๐ Please don't ignore this post, it took a lot of effort & time to research & create this post. Many of us are preparing for the interviews to get placed in top product-based companies and #Leetcode is one of the good platforms to practice the #DSA questions.
๐Here is a list of questions (Part-1) which recently asked by Google during the interviews. The questions and their respective links are in the same order. The content source is the Internet and Leetcode.
โพQUESTIONS :-
- H-Index
- Poor Pigs
- Valid Square
- Decode String
- Text Justification
- Battleships in a Board
- Minimum Time Difference
- Longest Absolute File Path
- Student Attendance Record II
- Evaluate Reverse Polish Notation
- Longest Increasing Path in a Matrix
โพLinks:-
- https://lnkd.in/dVy49_Nr
- https://lnkd.in/daX_YFyX
- https://lnkd.in/dvq8H_2w
- https://lnkd.in/dDpYv6G5
- https://lnkd.in/dYNWn5N3
- https://lnkd.in/d29shXsD
- https://lnkd.in/dGAuhsvh
- https://lnkd.in/dHD-2TVZ
- https://lnkd.in/dbnqgbkA
- https://lnkd.in/dCX4BzSE
- https://lnkd.in/dmEWHdSd
๐ If you find it useful, give it a like and save it. Feel free to comment with your thoughts and queries. Don't forget to save this Post. Also share it with your friends and colleagues out there.๐ญ
tags-
#coding #datastructures #algorithms #google #interview #computerscience #softwareengineer #data #programming
๐ Please don't ignore this post, it took a lot of effort & time to research & create this post. Many of us are preparing for the interviews to get placed in top product-based companies and #Leetcode is one of the good platforms to practice the #DSA questions.
๐Here is a list of questions (Part-1) which recently asked by Google during the interviews. The questions and their respective links are in the same order. The content source is the Internet and Leetcode.
โพQUESTIONS :-
- H-Index
- Poor Pigs
- Valid Square
- Decode String
- Text Justification
- Battleships in a Board
- Minimum Time Difference
- Longest Absolute File Path
- Student Attendance Record II
- Evaluate Reverse Polish Notation
- Longest Increasing Path in a Matrix
โพLinks:-
- https://lnkd.in/dVy49_Nr
- https://lnkd.in/daX_YFyX
- https://lnkd.in/dvq8H_2w
- https://lnkd.in/dDpYv6G5
- https://lnkd.in/dYNWn5N3
- https://lnkd.in/d29shXsD
- https://lnkd.in/dGAuhsvh
- https://lnkd.in/dHD-2TVZ
- https://lnkd.in/dbnqgbkA
- https://lnkd.in/dCX4BzSE
- https://lnkd.in/dmEWHdSd
๐ If you find it useful, give it a like and save it. Feel free to comment with your thoughts and queries. Don't forget to save this Post. Also share it with your friends and colleagues out there.๐ญ
tags-
#coding #datastructures #algorithms #google #interview #computerscience #softwareengineer #data #programming
LinkedIn
LinkedIn: Log In or Sign Up
1 billion members | Manage your professional identity. Build and engage with your professional network. Access knowledge, insights and opportunities.
ALGORITHM YOU SHOULD KNOW for PREPARING SYSTEM DESIGN INTERVIEW ๐ก
๐บREQUIREMENTS :-
KNOW WHEN TO USE
KNOW HOW IT WORKS
โพ1) BLOOM FILTER
It is a data structure designed to tell you, rapidly and memory-efficiently, whether an element is present in a set.
- use case :: Build a Web crawler
โพ2) FRUGAL STREAMING
It uses only one unit of memory per group to compute a quantile for each group.
-use case :: Find the nth percentile of the data stream.
โพ3) GEOHASH/ S2 GEOMETRY
A collection of efficient yet exact mathematical predicates for testing relationships among geometric primitives.
-use case :: Location-based search results with DynamoDb and Geohash.
โพ4) HYPERLOGLOG
It is an algorithm for the count-distinct problem, approximating the number of distinct elements in a multiset.
-use case :: privacy-preserving traffic heat map for the city.
โพ5) LEAKY BUCKET/ TOKEN BUCKET
A mechanism to control the amount and the rate of the traffic sent to the network.
-use case :: Design a scalable rate-limiting algorithm.
โพ6) LOSSY COUNT
It is used to identify elements in a data stream whose frequency count exceeds a user-given threshold.
-use case :: Frequency count over the data streams.
โพ7) OPERATIONAL TRANSFORMATION
It is used for supporting a range of collaboration functionalities in advanced collaborative software systems.
-use case :: Handling editing collision in Google docs.
โพ8) QUADTREE/ RTREE
It is a two-dimensional analog of octrees and is most often used to partition a two-dimensional space by recursively subdividing it into four quadrants or regions.
-use case :: Find nearby interest points
โพ9) RAY CASTING
It is the most basic of many computer graphics rendering algo that uses geometric algo of ray tracing.
-use case :: Using longitude and latitude, return the Country of the point.
โพ10) REVERSE INDEX
It is an index of keywords that stores records of documents that contain keywords in the list.
-use case: Building a complete Tweet index.
โพ11) RSYNC ALGORITHM
Used for reducing the cost of a file transfer by avoiding the transfer of blocks that are already at the destination.
-use case :: Streaming file Sync
โพ12) TRIE ALGORITHM
Trie is an efficient information reTrieval data structure. Using Trie, search complexities can be brought to optimal limit (key length)
-use case :: Autocomplete features using Trie
13) STRING BUFFER
-use case :: Banking transactions because it follows thread synchronisation
13) STRING BUILDER
-use case :: BOOKMYSHOW OR IRCTC ticket booking because it NOT following thread synchronisation
collab credit - windsoon / ansh /Aman
#software #design #google #systemdesign #backend #backenddeveloper #softwareengineer #algorithms
๐บREQUIREMENTS :-
KNOW WHEN TO USE
KNOW HOW IT WORKS
โพ1) BLOOM FILTER
It is a data structure designed to tell you, rapidly and memory-efficiently, whether an element is present in a set.
- use case :: Build a Web crawler
โพ2) FRUGAL STREAMING
It uses only one unit of memory per group to compute a quantile for each group.
-use case :: Find the nth percentile of the data stream.
โพ3) GEOHASH/ S2 GEOMETRY
A collection of efficient yet exact mathematical predicates for testing relationships among geometric primitives.
-use case :: Location-based search results with DynamoDb and Geohash.
โพ4) HYPERLOGLOG
It is an algorithm for the count-distinct problem, approximating the number of distinct elements in a multiset.
-use case :: privacy-preserving traffic heat map for the city.
โพ5) LEAKY BUCKET/ TOKEN BUCKET
A mechanism to control the amount and the rate of the traffic sent to the network.
-use case :: Design a scalable rate-limiting algorithm.
โพ6) LOSSY COUNT
It is used to identify elements in a data stream whose frequency count exceeds a user-given threshold.
-use case :: Frequency count over the data streams.
โพ7) OPERATIONAL TRANSFORMATION
It is used for supporting a range of collaboration functionalities in advanced collaborative software systems.
-use case :: Handling editing collision in Google docs.
โพ8) QUADTREE/ RTREE
It is a two-dimensional analog of octrees and is most often used to partition a two-dimensional space by recursively subdividing it into four quadrants or regions.
-use case :: Find nearby interest points
โพ9) RAY CASTING
It is the most basic of many computer graphics rendering algo that uses geometric algo of ray tracing.
-use case :: Using longitude and latitude, return the Country of the point.
โพ10) REVERSE INDEX
It is an index of keywords that stores records of documents that contain keywords in the list.
-use case: Building a complete Tweet index.
โพ11) RSYNC ALGORITHM
Used for reducing the cost of a file transfer by avoiding the transfer of blocks that are already at the destination.
-use case :: Streaming file Sync
โพ12) TRIE ALGORITHM
Trie is an efficient information reTrieval data structure. Using Trie, search complexities can be brought to optimal limit (key length)
-use case :: Autocomplete features using Trie
13) STRING BUFFER
-use case :: Banking transactions because it follows thread synchronisation
13) STRING BUILDER
-use case :: BOOKMYSHOW OR IRCTC ticket booking because it NOT following thread synchronisation
collab credit - windsoon / ansh /Aman
#software #design #google #systemdesign #backend #backenddeveloper #softwareengineer #algorithms
ALGORITHM YOU SHOULD KNOW for PREPARING SYSTEM DESIGN INTERVIEW ๐ก
๐บREQUIREMENTS :-
KNOW WHEN TO USE
KNOW HOW IT WORKS
โพ1) BLOOM FILTER
It is a data structure designed to tell you, rapidly and memory-efficiently, whether an element is present in a set.
- use case :: Build a Web crawler
โพ2) FRUGAL STREAMING
It uses only one unit of memory per group to compute a quantile for each group.
-use case :: Find the nth percentile of the data stream.
โพ3) GEOHASH/ S2 GEOMETRY
A collection of efficient yet exact mathematical predicates for testing relationships among geometric primitives.
-use case :: Location-based search results with DynamoDb and Geohash.
โพ4) HYPERLOGLOG
It is an algorithm for the count-distinct problem, approximating the number of distinct elements in a multiset.
-use case :: privacy-preserving traffic heat map for the city.
โพ5) LEAKY BUCKET/ TOKEN BUCKET
A mechanism to control the amount and the rate of the traffic sent to the network.
-use case :: Design a scalable rate-limiting algorithm.
โพ6) LOSSY COUNT
It is used to identify elements in a data stream whose frequency count exceeds a user-given threshold.
-use case :: Frequency count over the data streams.
โพ7) OPERATIONAL TRANSFORMATION
It is used for supporting a range of collaboration functionalities in advanced collaborative software systems.
-use case :: Handling editing collision in Google docs.
โพ8) QUADTREE/ RTREE
It is a two-dimensional analog of octrees and is most often used to partition a two-dimensional space by recursively subdividing it into four quadrants or regions.
-use case :: Find nearby interest points
โพ9) RAY CASTING
It is the most basic of many computer graphics rendering algo that uses geometric algo of ray tracing.
-use case :: Using longitude and latitude, return the Country of the point.
โพ10) REVERSE INDEX
It is an index of keywords that stores records of documents that contain keywords in the list.
-use case: Building a complete Tweet index.
โพ11) RSYNC ALGORITHM
Used for reducing the cost of a file transfer by avoiding the transfer of blocks that are already at the destination.
-use case :: Streaming file Sync
โพ12) TRIE ALGORITHM
Trie is an efficient information reTrieval data structure. Using Trie, search complexities can be brought to optimal limit (key length)
-use case :: Autocomplete features using Trie
13) STRING BUFFER
-use case :: Banking transactions because it follows thread synchronisation
13) STRING BUILDER
-use case :: BOOKMYSHOW OR IRCTC ticket booking because it NOT following thread synchronisation
collab credit - windsoon / ansh /Aman
#software #design #google #systemdesign #backend #backenddeveloper #softwareengineer #algorithms
๐บREQUIREMENTS :-
KNOW WHEN TO USE
KNOW HOW IT WORKS
โพ1) BLOOM FILTER
It is a data structure designed to tell you, rapidly and memory-efficiently, whether an element is present in a set.
- use case :: Build a Web crawler
โพ2) FRUGAL STREAMING
It uses only one unit of memory per group to compute a quantile for each group.
-use case :: Find the nth percentile of the data stream.
โพ3) GEOHASH/ S2 GEOMETRY
A collection of efficient yet exact mathematical predicates for testing relationships among geometric primitives.
-use case :: Location-based search results with DynamoDb and Geohash.
โพ4) HYPERLOGLOG
It is an algorithm for the count-distinct problem, approximating the number of distinct elements in a multiset.
-use case :: privacy-preserving traffic heat map for the city.
โพ5) LEAKY BUCKET/ TOKEN BUCKET
A mechanism to control the amount and the rate of the traffic sent to the network.
-use case :: Design a scalable rate-limiting algorithm.
โพ6) LOSSY COUNT
It is used to identify elements in a data stream whose frequency count exceeds a user-given threshold.
-use case :: Frequency count over the data streams.
โพ7) OPERATIONAL TRANSFORMATION
It is used for supporting a range of collaboration functionalities in advanced collaborative software systems.
-use case :: Handling editing collision in Google docs.
โพ8) QUADTREE/ RTREE
It is a two-dimensional analog of octrees and is most often used to partition a two-dimensional space by recursively subdividing it into four quadrants or regions.
-use case :: Find nearby interest points
โพ9) RAY CASTING
It is the most basic of many computer graphics rendering algo that uses geometric algo of ray tracing.
-use case :: Using longitude and latitude, return the Country of the point.
โพ10) REVERSE INDEX
It is an index of keywords that stores records of documents that contain keywords in the list.
-use case: Building a complete Tweet index.
โพ11) RSYNC ALGORITHM
Used for reducing the cost of a file transfer by avoiding the transfer of blocks that are already at the destination.
-use case :: Streaming file Sync
โพ12) TRIE ALGORITHM
Trie is an efficient information reTrieval data structure. Using Trie, search complexities can be brought to optimal limit (key length)
-use case :: Autocomplete features using Trie
13) STRING BUFFER
-use case :: Banking transactions because it follows thread synchronisation
13) STRING BUILDER
-use case :: BOOKMYSHOW OR IRCTC ticket booking because it NOT following thread synchronisation
collab credit - windsoon / ansh /Aman
#software #design #google #systemdesign #backend #backenddeveloper #softwareengineer #algorithms
๐๐ผ๐บ๐ฝ๐น๐ฒ๐๐ฒ ๐ก๐ผ๐๐ฒ๐ ๐ข๐ป ๐ฅ๐๐ฆ๐ง ๐๐ฃ๐ ๐ณ๐ผ๐ฟ ๐๐ป๐๐ฒ๐ฟ๐๐ถ๐ฒ๐ ๐ฃ๐ฟ๐ฒ๐ฝ๐ฎ๐ฟ๐ฎ๐๐ถ๐ผ๐ป.
๐๐ก๐ฒ ๐๐๐๐ ๐๐๐ ๐ข๐ฌ ๐๐ฆ๐ฉ๐จ๐ซ๐ญ๐๐ง๐ญ ๐ญ๐จ ๐๐๐๐ซ๐ง?
๐ ๐๐๐, ๐๐ฃ๐๐ฅ๐ค๐๐ฃ๐ฉ๐จ, ๐๐ค๐จ๐ฉ๐ข๐๐ฃ, ๐พ๐๐๐ฟ, ๐พ๐ช๐ง๐ก, ๐๐๐๐, ๐๐ฉ๐๐ฉ๐ช๐จ ๐พ๐ค๐๐, ๐๐๐ฆ๐ช๐๐จ๐ฉ, ๐๐๐จ๐ฅ๐ค๐ฃ๐จ๐, ๐ผ๐ช๐ฉ๐๐๐ฃ๐ฉ๐๐๐๐ฉ๐๐ค๐ฃ, or something elseโฆ
If youโre familiar with the above word then surely you might have worked on some kinds of APIs (especially those who are experienced developers) in your backend application. Maybe a payment gateway API, Google Maps API, Sending an Email APIs, or any other kind of APIs depending on the type of application and the requirements.
The most popular and common thing you will hear while working on API isโฆ
๐ฅ๐๐ฆ๐ง ๐๐ฃ๐โฆ
What it is? Why is it being used? Why it is the first priority of programmers when it comes to implementing an API? Many questions will pop up in your mind when you will start working on REST API.
So here you will get all the answers.
https://www.linkedin.com/in/aman-raj-6168b616a
#restapi #frontend #backenddeveloper #json #postman #crud #statuscode #databases #sql #nosql #dsa #interviewpreparation #interview #jobs #nodejs #reactjs #python #javascript #java #webdevelopment #developer #softwareengineer #itservices #services #fullstackdeveloper #aws #cloud #authentication #linkedin #content #google #email
๐๐ก๐ฒ ๐๐๐๐ ๐๐๐ ๐ข๐ฌ ๐๐ฆ๐ฉ๐จ๐ซ๐ญ๐๐ง๐ญ ๐ญ๐จ ๐๐๐๐ซ๐ง?
๐ ๐๐๐, ๐๐ฃ๐๐ฅ๐ค๐๐ฃ๐ฉ๐จ, ๐๐ค๐จ๐ฉ๐ข๐๐ฃ, ๐พ๐๐๐ฟ, ๐พ๐ช๐ง๐ก, ๐๐๐๐, ๐๐ฉ๐๐ฉ๐ช๐จ ๐พ๐ค๐๐, ๐๐๐ฆ๐ช๐๐จ๐ฉ, ๐๐๐จ๐ฅ๐ค๐ฃ๐จ๐, ๐ผ๐ช๐ฉ๐๐๐ฃ๐ฉ๐๐๐๐ฉ๐๐ค๐ฃ, or something elseโฆ
If youโre familiar with the above word then surely you might have worked on some kinds of APIs (especially those who are experienced developers) in your backend application. Maybe a payment gateway API, Google Maps API, Sending an Email APIs, or any other kind of APIs depending on the type of application and the requirements.
The most popular and common thing you will hear while working on API isโฆ
๐ฅ๐๐ฆ๐ง ๐๐ฃ๐โฆ
What it is? Why is it being used? Why it is the first priority of programmers when it comes to implementing an API? Many questions will pop up in your mind when you will start working on REST API.
So here you will get all the answers.
https://www.linkedin.com/in/aman-raj-6168b616a
#restapi #frontend #backenddeveloper #json #postman #crud #statuscode #databases #sql #nosql #dsa #interviewpreparation #interview #jobs #nodejs #reactjs #python #javascript #java #webdevelopment #developer #softwareengineer #itservices #services #fullstackdeveloper #aws #cloud #authentication #linkedin #content #google #email
Amazon || ๐๐๐๐ซ๐ฎ๐ข๐ญ๐ฆ๐๐ง๐ญ ๐๐ซ๐จ๐๐๐ฌ๐ฌ ๐
๐จ๐ซ ๐๐๐ 1๐คฉ
๐ด๐๐๐ ๐บ๐๐๐ ๐๐๐ ๐บ๐๐๐๐ !!!!
It's every engineer's dream to get into top product-based companies, some of us called them FAANG or MAANG. Here I am sharing the journey you will go through the interview process from Amazon.
๐๐๐ ๐๐ซ๐๐๐ค๐๐จ๐ฐ๐ง (Source : Internet) :
Base Salary : 19LPA
Bonus : 6.5 LPA(Y1) + 5 LPA (Y2)
RSU : 15.5 LPA
Total Compensation : 46 LPA ๐คฉ
๐๐๐๐ซ๐ฎ๐ข๐ญ๐ฆ๐๐ง๐ญ ๐๐ซ๐จ๐๐๐ฌ๐ฌ:
Amazon conducts 4 rounds to select freshers as SDE (SDE-1) in their organization off campus. The following rounds are conducted:
- Online Coding Round
- 2 Technical Rounds
- Bar Raiser round
๐๐ง๐ฅ๐ข๐ง๐ ๐๐จ๐๐ข๐ง๐ ๐๐จ๐ฎ๐ง๐:
This round is hosted online and the candidates are presented with 2 coding questions, the questions are of intermediate difficulty, mainly from Arrays, strings, and matrices.
To clear this round, one should have a strong understanding of these data structures.
Time given is 70 minutes.
๐๐๐๐ก๐ง๐ข๐๐๐ฅ ๐๐จ๐ฎ๐ง๐ 1:
Technical rounds are face-to-face algorithmic rounds in which candidates are presented with 2-4 questions, all from data structures. The most commonly asked DSs are the matrix, binary tree, BST, and Linked list.
๐๐๐๐ก๐ง๐ข๐๐๐ฅ ๐๐จ๐ฎ๐ง๐ 2:
The same as the previous round, however, the difficulty is increased and more questions from Trees, BST, and Tries are asked. One should have a clear knowledge of tree-based recursion, and the standard questions based on it are a must.
๐๐๐ซ ๐๐๐ข๐ฌ๐๐ซ ๐๐จ๐ฎ๐ง๐:
Amazon has 16 leadership principles and questions are asked on those, and generally, these questions are asked in all the interview round and especially in Bar raiser round along with 1-2 DSA problems.
๐๐ฆ๐ฉ๐จ๐ซ๐ญ๐๐ง๐ญ ๐๐จ๐ข๐ง๐ญ๐ฌ ๐ญ๐จ ๐ซ๐๐ฆ๐๐ฆ๐๐๐ซ :
- Never postpone your interview(That might lead to many gaps in dates because multiple candidates are giving interviews.)
- Take the Bar Raiser round seriously(Always prepare for leadership principle questions, It is the most important round of the process.)
- Always focus on concepts(Never mug up the questions, always try to understand the questions.)
- Be confident about your answers(Never doubt yourself in the interview.)
- Always try explaining your approach before coding(It would be a better practice if you give a brute force approach.)
- Have a good understanding of time complexity(I was also asked TC of every question.)
Follow for more.
Happy Learning !!
Tags -
#interviews #leetcode #questions #array #sorting #queue #loop #tree #graphs #amazon #sde #interviewpreparation #coding #computerscience #softwareengineer #workforwin #intern #internship #amazonindia #learning #softwaredevelopement #opportunity #dsa #faang #interview #amazonian
๐ด๐๐๐ ๐บ๐๐๐ ๐๐๐ ๐บ๐๐๐๐ !!!!
It's every engineer's dream to get into top product-based companies, some of us called them FAANG or MAANG. Here I am sharing the journey you will go through the interview process from Amazon.
๐๐๐ ๐๐ซ๐๐๐ค๐๐จ๐ฐ๐ง (Source : Internet) :
Base Salary : 19LPA
Bonus : 6.5 LPA(Y1) + 5 LPA (Y2)
RSU : 15.5 LPA
Total Compensation : 46 LPA ๐คฉ
๐๐๐๐ซ๐ฎ๐ข๐ญ๐ฆ๐๐ง๐ญ ๐๐ซ๐จ๐๐๐ฌ๐ฌ:
Amazon conducts 4 rounds to select freshers as SDE (SDE-1) in their organization off campus. The following rounds are conducted:
- Online Coding Round
- 2 Technical Rounds
- Bar Raiser round
๐๐ง๐ฅ๐ข๐ง๐ ๐๐จ๐๐ข๐ง๐ ๐๐จ๐ฎ๐ง๐:
This round is hosted online and the candidates are presented with 2 coding questions, the questions are of intermediate difficulty, mainly from Arrays, strings, and matrices.
To clear this round, one should have a strong understanding of these data structures.
Time given is 70 minutes.
๐๐๐๐ก๐ง๐ข๐๐๐ฅ ๐๐จ๐ฎ๐ง๐ 1:
Technical rounds are face-to-face algorithmic rounds in which candidates are presented with 2-4 questions, all from data structures. The most commonly asked DSs are the matrix, binary tree, BST, and Linked list.
๐๐๐๐ก๐ง๐ข๐๐๐ฅ ๐๐จ๐ฎ๐ง๐ 2:
The same as the previous round, however, the difficulty is increased and more questions from Trees, BST, and Tries are asked. One should have a clear knowledge of tree-based recursion, and the standard questions based on it are a must.
๐๐๐ซ ๐๐๐ข๐ฌ๐๐ซ ๐๐จ๐ฎ๐ง๐:
Amazon has 16 leadership principles and questions are asked on those, and generally, these questions are asked in all the interview round and especially in Bar raiser round along with 1-2 DSA problems.
๐๐ฆ๐ฉ๐จ๐ซ๐ญ๐๐ง๐ญ ๐๐จ๐ข๐ง๐ญ๐ฌ ๐ญ๐จ ๐ซ๐๐ฆ๐๐ฆ๐๐๐ซ :
- Never postpone your interview(That might lead to many gaps in dates because multiple candidates are giving interviews.)
- Take the Bar Raiser round seriously(Always prepare for leadership principle questions, It is the most important round of the process.)
- Always focus on concepts(Never mug up the questions, always try to understand the questions.)
- Be confident about your answers(Never doubt yourself in the interview.)
- Always try explaining your approach before coding(It would be a better practice if you give a brute force approach.)
- Have a good understanding of time complexity(I was also asked TC of every question.)
Follow for more.
Happy Learning !!
Tags -
#interviews #leetcode #questions #array #sorting #queue #loop #tree #graphs #amazon #sde #interviewpreparation #coding #computerscience #softwareengineer #workforwin #intern #internship #amazonindia #learning #softwaredevelopement #opportunity #dsa #faang #interview #amazonian
๐1