https://www.youtube.com/@agoalofalife/videos (ru)
https://github.com/peterlamar/python-cp-cheatsheet
https://habr.com/ru/companies/ruvds/articles/908884/
https://join.zerotomastery.io/free-week/
I am getting 10+ calls weekly (in 2025!!!) directly from recruiters after using these two tricks.
➤ 𝗧𝗿𝗶𝗰𝗸𝘀 𝘁𝗼 𝗚𝗲𝘁 𝗺𝗼𝗿𝗲 𝗜𝗻𝘁𝗲𝗿𝘃𝗶𝗲𝘄 𝗖𝗮𝗹𝗹𝘀 𝗼𝗻 𝗟𝗶𝗻𝗸𝗲𝗱𝗜𝗻:
- Go to the LinkedIn search bar at the top.
- Type a query using the format: {job role} AND ("hiring" OR "requirement")
- Example: Software Developer hiring (according to the designation)
- Hit enter.
- Select the Posts filter from the result page.
- Sort it by Latest.
Now, you will see job requirements that have been posted recently.
These are opportunities that are NOT listed as formal job postings and often go unnoticed.
But with this method, you can tap into hidden opportunities and connect with recruiters directly.
➤ 𝗡𝗮𝘂𝗸𝗿𝗶 𝗧𝗿𝗶𝗰𝗸𝘀 𝗧𝗵𝗮𝘁 𝗪𝗼𝗿𝗸 𝗶𝗻 𝟮𝟬𝟮𝟱:
- Create multiple Naukri profiles targeting different locations.
- Use a different phone number and email address for each account.
- Update your job profile every morning.
- Include all relevant keywords for your job role in your resume.
- Add those same keywords in the resume headline section.
- Set your notice period to 15 days or less.
- Use 6-7 bullet points to describe your projects.
- Follow a similar bullet-point format for the Employment section.
- Add your LinkedIn profile link.
- Include all job locations in the Preferred Work Location field.
- Add any relevant certifications you have.
- Replace career gaps with freelance work in your resume.
➤ 𝗞𝗲𝘆 𝗣𝗼𝗶𝗻𝘁𝘀 𝘁𝗼 𝗥𝗲𝗺𝗲𝗺𝗯𝗲𝗿 𝗶𝗻 𝗯𝗼𝘁𝗵:
- Apply for as many job openings as possible every day.
- Review job descriptions to identify important keywords.
- Example for a Software Engineer: keywords like Java, Javascript, Kafka.
- Reach out directly to HR managers via LinkedIn messages or emails.
Try these hacks, and you'll significantly increase your chances of getting better interview calls.
Kickresume Kickresume helps you create a resume and an AI-generated cover letter for international job applications. 📎 https://lnkd.in/gqd5WxVF
Job Hunt This tool uses AI to help you apply for jobs faster. It also has a resume builder for creating an AI-generated resume. 📎 https://www.job-hunt.org/
Wellfound Wellfound connects startups with job seekers, listing 130,000 tech jobs from 27,000 companies. 📎 https://wellfound.com/
Remotive Remotive offers access to remote job opportunities from trustworthy tech companies. 📎 https://remotive.com/
JS Remotely This site lists jobs for JavaScript, React, Vue, Node.js, and Angular. 📎 https://jsremotely.com/
Remote OK Find remote jobs and work from anywhere. 📎 https://remoteok.com/
Working Nomads This platform is for digital nomads looking for remote job opportunities. 📎 https://lnkd.in/giHGeCCw
Upwork Trusted by Microsoft, GoDaddy, and more. Freelance projects for all skills. 📎 https://www.upwork.com/
https://www.algoexpert.io/systems/product
https://llego.dev/tags/technical-coding-interview/
https://www.linkedin.com/my-items/saved-posts/
https://vurt.org/articles/twelve-rules/
https://blog.chay.dev/things-that-make-your-application-stand-out/
https://github.com/alex/what-happens-when when you press button on keyboard
https://walkccc.me/LeetCode/ Solutions
https://github.com/ruppysuppy/Daily-Coding-Problem-Solutions
https://dxmahata.gitbooks.io/leetcode-python-solutions/content/
https://github.com/ChenglongChen/LeetCode-3/tree/master/Python
https://www.algoexpert.io/ I bought it!
https://github.com/ruppysuppy/Daily-Coding-Problem-Solutions/blob/master/Solutions/020.py
16 problem solving patterns that will help you learn DSA faster:
https://leetcode.com/discuss/post/1688903/Solved-all-two-pointers-problems-in-100-days/
https://medium.com/leetcode-patterns/leetcode-pattern-3-backtracking-5d9e5a03dc26
https://leetcode.com/discuss/study-guide/458695/Dynamic-Programming-Patterns
https://leetcode.com/discuss/study-guide/1437879/Dynamic-Programming-Patterns
https://leetcode.com/discuss/study-guide/2001789/Collections-of-Important-String-questions-Pattern
https://hackernoon.com/14-patterns-to-ace-any-coding-interview-question-c5bb3357f6ed
roadmap for campus placements in 2025 https://lnkd.in/eevgakTB
one-stop resource guide on Topmate: → https://lnkd.in/eYHSjbys
https://habr.com/ru/articles/840116/ How internet works
https://www.youtube.com/watch?v=_keHRxzx7as Глеб Михайлов Новые задачи на LeetCode | Ща порешаем! #99
https://www.youtube.com/watch?v=JtMuXmmDl9s Саша Лукин
https://www.youtube.com/watch?v=csCtjoDmByA Squares of a Sorted Array.
Google Advanced Data Analytics Professional Certificate | Coursera
Microsoft Certified: Power BI Data Analyst Associate - Certifications | Microsoft Learn
AWS Certified Machine Learning - Specialty Certification | AWS Certification | AWS (amazon.com)
Microsoft Certified: Azure Data Scientist Associate
https://habr.com/ru/articles/817031/ https://habr.com/ru/articles/817029/ Как найти работу мечты в США 1 https://habr.com/ru/articles/817031/ Как найти работу мечты в США 2
https://relational.ai/careers/ JOB
https://habr.com/ru/articles/794556/
https://habr.com/ru/articles/797837/
Competitive coding: leetcode.com, geeksforgeeks.org
https://uproger.com/bolshaya-shpargalka-po-algoritmam-s-sobesedovanij/
Mock interviews, salary negotiation consulting: interviewing.io, interviewkickstart.com
https://news.ycombinator.com/item?id=37111256
https://cloudirregular.substack.com/p/the-greatest-resume-ive-ever-seen
https://news.ycombinator.com/item?id=36901303
https://allaboutalgorithms.com/finding-closest-points-faster-than-o-n%C2%B2-ea5d005bc911
https://www.techbeamers.com/python-tricky-coding-exercises/#google_vignette
https://leetsolve.com/48-rotate-image
https://www.guru99.com/longest-common-subsequence.html
https://python.plainenglish.io/median-from-data-stream-8323faee348
https://medium.com/@tudorache.a.bogdan/day-5-arrays-median-of-two-sorted-arrays-17c9349e21ca
https://medium.com/@hazemu/finding-the-median-of-2-sorted-arrays-in-logarithmic-time-1d3f2ecbeb46 Median of 2 sorted arrays
https://habr.com/ru/company/otus/blog/565988/ Median in the stream
https://emre.me/coding-patterns/two-heaps/
we want to know the smallest element in one part and the biggest element in the other part.
Two Heaps pattern uses two Heap data structure to solve these problems;
a Min Heap to find the smallest element and a Max Heap to find the biggest element.
Design a data structure that supports the following two operations:
void addNum(int num) - Add a integer number from the data stream to the data structure.
double findMedian() - Return the median of all elements so far.
https://faun.pub/intervals-coding-pattern-efa438dede8a
https://emre.me/coding-patterns/merge-intervals/ . Merge intervals
https://faun.pub/priority-queue-using-heapq-9d8fccc49d51
https://habr.com/ru/articles/901190/ "Largest Square Submatrix of all 1's"
https://blog.devgenius.io/array-coding-pattern-prefix-sum-a83d313c7e5a
Longest common prefix: https://python.plainenglish.io/longest-common-prefix-2d237c52e11d
Matrix in python: https://blog.devgenius.io/working-with-matrix-in-python-cheatsheet-2654835d9dc7
Yandex interview: https://www.youtube.com/watch?v=0yxjWwoZtLw
https://www.youtube.com/watch?v=zU-LndSG5RE
https://www.youtube.com/watch?v=krDfPEYVVvk
Algorithms: https://github.com/heineman
https://www.youtube.com/@Power_Couple/videos
FAANG interview questions
https://media.licdn.com/dms/document/media/D4D1FAQH_q662e7ciYg/feedshare-document-pdf-analyzed/0/1686549764622?e=1687392000&v=beta&t=t3ZlZ6w4CMjYMfIDEg8DKA15ecgVSqrX5XNwo2pcBd0
https://www.youtube.com/watch?v=rPp46idEvnM Hash table from Lukin (ru)
https://habr.com/ru/articles/756394/
https://habr.com/ru/articles/743514/
All permutations of string https://www.techbeamers.com/permutation-of-a-string-in-python/
https://gaultier.github.io/blog/kahns_algorithm.html
https://github.com/youssefHosni/Data-Science-Interview-Questions-Answers
https://habr.com/ru/articles/729944/
https://github.com/nkwade/nkwade-lc-solutions
https://github.com/klaus19/LeetcodeinPython
https://stepik.org/course/217 Алгоритмы: теория и практика. Методы
https://stepik.org/course/1547 Алгоритмы: теория и практика. Структуры данных
https://stepik.org/course/102772 Ace Your Next Coding Interview by Learning Algorithms
https://stepik.org/lesson/41233/step/1?unit=19817
https://stepik.org/course/126012/promo Interview prep (russian)
https://www.linkedin.com/feed/update/urn:li:activity:7001201153686269952/
https://alignedclarity.substack.com/p/streamline-your-resume-and-increase
https://grow.google/certificates/interview-warmup/
https://github.com/prabhupant/python-ds
https://habr.com/ru/company/getmatch/blog/678742/
https://habr.com/ru/post/684756/ binary search
https://habr.com/ru/post/679008/ process big file
Вы стоите на поверхности Земли. Затем вы начинаете идти: проходите один километр на юг, один на запад и один на север. В итоге вы оказываетесь в начальной точке. Где вы стоите? https://habr.com/ru/post/678254/
https://florian.github.io//xor-trick/ XOR trick
https://www.youtube.com/watch?v=Peq4GCPNC5c&t=1s . 10 common interview questions - solved
https://habr.com/ru/post/661577/ Обход графа в ширину (BFS) и глубину (DFS)
https://www.youtube.com/watch?v=JtMuXmmDl9s
https://towardsdatascience.com/how-to-find-all-solutions-to-the-subset-sum-problem-597f77677e45
https://habr.com/ru/post/653617/ Алгоритм поиска самой длинной подстроки-палиндрома
https://habr.com/ru/post/646319/ amazon interview
https://malisper.me/an-algorithm-for-passing-programming-interviews/
https://news.ycombinator.com/item?id=29775023
https://github.com/NIteshx2/AdvancedSQL_Interview Advanced SQL
https://www.youtube.com/watch?v=fAAZixBzIAI . Binary Tree
https://www.facebookcareers.com/DE-prep-onsite/
https://www.youtube.com/watch?v=SgaN-4po_cA How I Got a Job at DeepMind as a Research Engineer
https://github.com/prius/learning
https://github.com/prabhupant/python-ds
https://habr.com/ru/company/otus/blog/599309/
https://www.amazon.com/Algorithm-Design-Manual-Computer-Science-dp-3030542556/dp/3030542556 The Algorithm Design Manual by Skiena
https://www.algorithm-archive.org/
https://www.educative.io/path/ace-python-coding-interview
https://habr.com/ru/post/587348/
https://mlengineer.io/how-i-prepare-for-amazon-applied-scientist-l5-2020-30e080cb5dbe
https://towardsdatascience.com/how-i-doubled-my-salary-in-4-months-e8c5b2b9f5bc
https://mlengineer.io/how-i-failed-amazon-interview-mle-9def3c91b886
https://github.com/yangshun/tech-interview-handbook
https://www.youtube.com/watch?v=tWVWeAqZ0WU . Graph Algo
https://github.com/kdn251/interviews
https://cp-algorithms.com/index.html
https://habr.com/ru/company/geekfactor/blog/585352/ 7 платформ для подготовки к техническому интервью
https://www.youtube.com/watch?v=3QA4Yg4leGQ&list=RDCMUCNc-Wa_ZNBAGzFkYbAHw9eg&start_radio=1 Longest increasing path (Python Interview)
https://liuzhenglaichn.gitbook.io/algorithm/
https://towardsdatascience.com/intro-to-data-structures-2615eadc343d
https://www.java67.com/2018/05/top-75-programming-interview-questions-answers.html
https://www.youtube.com/watch?v=vs4aFU3DiXY interview for ML
https://www.pankajtanwar.in/coding-diary
https://www.java67.com/2018/04/21-string-programming-and-coding-interview-questions-answers.html
https://www.educative.io/courses/grokking-the-coding-interview?affiliate_id=5073518643380224
https://www.interviewbit.com/coding-interview-questions/
https://github.com/thundergolfer/interview-with-python/tree/master/solutions/python
https://www.dailycodingproblem.com/subscribe?email=mlubinsky%40hotmail.com
https://stratos.seas.harvard.edu/files/stratos/files/periodictabledatastructures.pdf
https://www.bitdegree.org/user/course/data-structures-and-algorithms
https://www.devglan.com/datastructure/print-path-from-root-to-node-binary-tree
https://www.techiedelight.com/print-all-paths-from-root-to-leaf-nodes-binary-tree/
There are a total of n courses you have to take, labeled from 0 to n - 1.
Some courses may have prerequisites, for example to take course 0 you have to first take course 1, which is expressed as a pair: [0, 1]
Given the total number of courses and a list of prerequisite pairs, is it possible for you to finish all courses?
The aim of topological sort is to provide a partial ordering among the vertices of the graph such that if there is an edge from U to V then U <= V, which means, U comes before V in the ordering.
Source: Any node that has no incoming edge and has only outgoing edges is called a source.
Sink: Any node that has only incoming edges and no outgoing edge is called a sink.
Topological ordering starts with one of the sources and ends at one of the sinks.
A topological ordering is possible only when the graph has no directed cycles, i.e. if the graph is a Directed Acyclic Graph (DAG). If the graph has a cycle, some vertices will have cyclic dependencies which makes it impossible to find a linear ordering among vertices.
To find the topological sort of a graph we can traverse the graph in a Breadth First Search (BFS) way.
a. Initialization
We will store the graph in Adjacency Lists, which means each parent vertex will have a list containing all of its children. We will do this using a Hash Table where the key will be the parent vertex number and the value will be a List containing children vertices.
To find the sources, we will keep a Hash Table to count the in-degrees (count of incoming edges of each vertex). Any vertex with 0 in-degree will be a source.
b. Build the graph and find in-degrees of all vertices
We will build the graph from the input and populate the in-degrees Hash Table.
c. Find all sources
All vertices with 0 in-degrees will be our sources and we will store them in a Queue.
d. Sort
For each source:
Add it to the sorted list.
Get all of its children from the graph.
Decrement the in-degree of each child by 1.
If a child’s in-degree becomes 0, add it to the sources Queue.
Repeat these steps, until the source Queue is empty.
```python
from collections import deque
from typing import List
class Solution:
def canFinish(self, numCourses: int, prerequisites: List[List[int]]) -> bool:
sorted_list = []
if numCourses <= 0:
return False
# a. Initialization
graph = {i: [] for i in range(numCourses)} # adjacency list graph
in_degree = {i: 0 for i in range(numCourses)} # count of incoming edges
# b. Build the graph
for prerequisite in prerequisites:
parent, child = prerequisite[0], prerequisite[1]
graph[parent].append(child) # put the child into it's parent's list
in_degree[child] += 1
# c. Find all sources
sources = deque()
for key in in_degree:
if in_degree[key] == 0:
sources.append(key)
# d. Sort
while sources:
vertex = sources.popleft()
sorted_list.append(vertex)
for child in graph[vertex]: # get the node's children to decrement their in-degrees
in_degree[child] -= 1
if in_degree[child] == 0:
sources.append(child)
# if sorted_list does not contain all the courses, there is a cyclic dependency between courses
# scheduling is not possible if there is a cyclic dependency
return len(sorted_list) == numCourses
Time Complexity: O(V + E) where V is the total number of courses and E is the total number of prerequisites.
Space Complexity: O(V + E) since we are storing all of the prerequisites for each course in an adjacency list.
How to use this rubric: https://3dtrends.substack.com/p/the-coding-interview-pt-1-inspect
Prepping for an interview in big tech and need some guidance? Join the discord: https://discord.gg/NgJXgkbgd6
https://www.coursera.org/in-progress
https://www.udemy.com/course/master-the-coding-interview-big-tech-faang-interviews/. Udemy
https://www.udemy.com/course/leetcode-in-python-50-algorithms-coding-interview-questions/
https://github.com/BitPunchZ/Leetcode-in-python-50-Algorithms-Coding-Interview-Questions/
https://www.udemy.com/course/master-the-coding-interview-big-tech-faang-interviews
https://www.udemy.com/11-essential-coding-interview-questions/?couponCode=AMAZON2
https://github.com/lilianweng/LeetcodePython
https://github.com/programmercave0/Algo-Data-Structure/blob/master/README.md
https://yangshun.github.io/tech-interview-handbook/
https://github.com/mission-peace/interview/tree/master/src/com/interview
https://github.com/donnemartin/interactive-coding-challenges
https://github.com/alexhagiopol/cracking-the-coding-interview
https://github.com/charulagrl/data-structures-and-algorithms
https://github.com/thundergolfer/interview-with-python/tree/master/solutions/python
https://github.com/anubhavshrimal/Data_Structures_Algorithms_In_Python
https://github.com/bt3gl/Python-and-Algorithms-and-Data-Structures/
https://github.com/BitPunchZ/Leetcode-in-python-50-Algorithms-Coding-Interview-Questions/
https://github.com/StBogdan/CTCI_python Cracking code interview
https://github.com/StBogdan/PythonWork
https://github.com/parineeth/tbboci-3rd-edition-python
https://github.com/alexeygrigorev/data-science-interviews
https://github.com/labuladong/fucking-algorithm/tree/english. Leetcode guide
https://github.com/30-seconds/30-seconds-of-python-code
https://github.com/TheAlgorithms/Python
https://github.com/devAmoghS/Practice-Problems
https://github.com/tayllan/awesome-algorithms
https://github.com/karan/Projects
http://www.cmsmagazine.ru/library/items/programming/80-problems-with-it-interviews/
https://habr.com/ru/company/skillfactory/blog/582450/
https://habr.com/ru/company/skillfactory/blog/539058/
https://habr.com/ru/company/ruvds/blog/515258/. Algorithms
https://habr.com/ru/company/skillfactory/blog/538536/ interview
https://medium.com/swlh/my-preparation-journey-for-google-interviews-f41e2dc3cdf9 interview
https://habr.com/ru/post/539166/ Algo
https://habr.com/ru/post/535216/ interview
https://habr.com/ru/post/550088/ interview
https://stackoverflow.com/questions/41515081/algorithm-find-all-permutations-of-string-a-in-string-b
https://paddy3118.blogspot.com/2021/02/longest-common-substring-investigation.html. longest common substr
find the longest palindrome subsequence of a string optimally
https://alkeshghorpade.me/post/leetcode-longest-substring-without-repeating-characters
https://johnlekberg.com/blog/2020-08-01-task-order.html . topological sort
https://medium.com/javascript-in-plain-english/facebook-coding-interview-questions-9e40bdbbec35
https://akshayr.me/blog/articles/python-dictionaries
https://medium.com/better-programming/cracking-the-amazon-interview-cf6a6c5f954a
https://blog.pragmaticengineer.com/data-structures-and-algorithms-i-actually-used-day-to-day/
https://www.youtube.com/watch?v=2yWf3TrJ6Xs&feature=youtu.be
https://habr.com/ru/post/499394/
https://www.youtube.com/channel/UCZCFT11CWBi3MHNlGf019nw/videos
https://www.algoexpert.io/systems/product
https://medium.com/@andreimargeloiu/how-to-prepare-for-competitive-programming-396d557e0c12
https://medium.com/swlh/binary-search-cheat-sheet-for-coding-interviews-9c5425af357e
https://habr.com/ru/post/503602/
https://crunchskills.com/binary-tree-interview-questions-and-practice-problems/
https://crunchskills.com/google-interview-questions-for-software-engineering-roles/
https://medium.com/dev-genius/15-binary-tree-coding-problems-from-faang-interview-2ba1ec67d077
https://medium.com/@srajaninnov/find-the-diameter-of-a-binary-tree-efc45b9129a7
https://habr.com/ru/company/spice/blog/478250/ Выпуск#27: ITренировка — актуальные вопросы и задачи от ведущих компаний
https://habr.com/ru/company/spice/blog/479320/ Выпуск#28: ITренировка — актуальные вопросы и задачи от ведущих компаний
https://data-flair.training/blogs/python-programming-interview-questions/
https://data-flair.training/blogs/top-python-interview-questions-answer/
https://news.ycombinator.com/item?id=20897510
https://medium.com/@alexgolec/google-interview-problems-ratio-finder-d7aa8bf201e3
https://habr.com/ru/post/467371/ Разбор задачи с собеседования Google: поиск соотношения
https://www.youtube.com/watch?v=xYBKMV92YrM LeetCode 05 - Longest Palindromic Substring in Python
https://web.stanford.edu/class/cs9/
https://algodaily.com/challenges
https://news.ycombinator.com/item?id=20729252
https://habr.com/ru/company/skillbox/blog/462979/
https://www.youtube.com/watch?v=EuPSibuIKIg Google Coding Interview With A Competitive Programmer
https://www.youtube.com/channel/UCaYQbIciTyBFMTRE2Zp81tw
https://www.youtube.com/watch?v=2H_2UGsRmLE&list=PLuVT2Ug8ISOXYhtc-mSeAnJYMbI3WKY5o&index=5&t=0s
https://www.youtube.com/watch?v=jM2dhDPYMQM. Sliding window
https://malisper.me/an-algorithm-for-passing-programming-interviews/
https://news.ycombinator.com/item?id=25658098
https://doisinkidney.com/posts/2019-06-04-solving-puzzles-without-your-brain.html
https://tproger.ru/articles/problems/
https://www.pythonpool.com/knapsack-problem-python/
https://www.pythonforbeginners.com/queue/queue-in-python
https://www.youtube.com/watch?v=Dx5eiQdv4k8 Find 2 closest points on plain
https://kalkicode.com/data-structure/1500-most-common-data-structures-and-algorithms-solutions
https://news.ycombinator.com/item?id=25519718 Interview advice that got me offers
https://www.youtube.com/watch?v=kbx7xpSKBaI climbing stairs
https://www.pythonforbeginners.com/data-structures
https://mccme.ru/shen/progbook/7edition.pdf
https://habr.com/ru/post/576558/
https://habr.com/ru/post/579410/ interview for ML
https://www.jeffcarp.com/posts/2018-how-to-solve-every-software-engineering-interview-question/
https://habr.com/ru/post/457042/ . Tree traversal using 2 threads (Java)
https://en.wikipedia.org/wiki/Lowest_common_ancestor https://sites.google.com/site/mytechnicalcollection/algorithms/trees/lca-of-binary-tree https://stackoverflow.com/questions/1484473/how-to-find-the-lowest-common-ancestor-of-two-nodes-in-any-binary-tree
https://www.youtube.com/channel/UCcAWgbpROQrPok18E6UozWw/videos
https://www.facebook.com/tusharroy25/
https://blog.finxter.com/python-interview-questions/
https://stackoverflow.com/questions/11897088/diameter-of-binary-tree-better-design
http://www.interviewdruid.com/
https://www.amazon.com/dp/1983861189
https://www.algoexpert.io/product
https://www.quora.com/How-do-I-learn-algorithms-2
https://moultano.wordpress.com/2018/11/08/minhashing-3kbzhsxyg4467-6/
https://realpython.com/python-hash-table/
https://stackabuse.com/graph-data-structure-interview-questions/
http://www.java67.com/2018/05/top-75-programming-interview-questions-answers.html
Hard Interview Questions in FAANG - 4 | Live Problem Solving | Interview Cracking Series
https://www.youtube.com/watch?v=8Uk2e7cCuyw Hard Interview Questions in FAANG - 4 | Live Problem Solving | Interview Cracking Series
https://www.businessinsider.fr/us/microsoft-new-developer-interview-process-2018-12
https://stackabuse.com/programming-interview-questions/
https://bradfieldcs.com/algos/
http://rachitiitr.blogspot.com/
https://www.youtube.com/watch?v=4NIb9l3imAo
https://python.plainenglish.io/union-find-data-structure-in-python-8e55369e2a4f
https://www.geeksforgeeks.org/union-find/ union-find (disjoint-set)
https://habr.com/ru/post/104772/ создать быструю структуру, которая поддерживает следующие операции:
MakeSet(X) — внести в структуру новый элемент X, создать для него множество размера 1 из самого себя. Find(X) — возвратить идентификатор множества, которому принадлежит элемент X. В качестве идентификатора мы будем выбирать один элемент из этого множества — представителя множества. Гарантируется, что для одного и того же множества представитель будет возвращаться один и тот же, иначе невозможно будет работать со структурой: не будет корректной даже проверка принадлежности двух элементов одному множеству if (Find(X) == Find(Y)).
Unite(X, Y) — объединить два множества, в которых лежат элементы X и Y, в одно новое.
http://iolivia.me/posts/4-bloom-filter-part-3/ Bloom filter
https://eddmann.com/posts/depth-first-search-and-breadth-first-search-in-python/
http://www.java67.com/2018/05/top-75-programming-interview-questions-answers.html
http://www.algorithmsilluminated.org/
https://able.bio/daqo/landing-a-software-engineering-job-at-facebook--78k4a0s
https://habr.com/ru/company/digital-ecosystems/blog/473018/ Facebook
https://habr.com/ru/company/edison/blog/481304/
http://blog.amynguyen.net/?p=853
https://news.ycombinator.com/item?id=18236396 . Favorite algos
https://aryaboudaie.com/interviews/python/technical/2017/11/06/python-for-interviews.html
https://algoexpert.io/rachit Use "rachit" as coupon code to get 30% off
http://quiz.geeksforgeeks.org/amazons-most-frequently-asked-interview-questions-set-2/
https://www.geeksforgeeks.org/amazons-asked-interview-questions/
https://habr.com/ru/post/112222/ heap
https://medium.com/educative/3-month-coding-interview-bootcamp-904422926ce8
https://habr.com/ru/post/437702/ Разбор задачи с собеседования в Google: синонимичные запросы
https://www.byte-by-byte.com/google-interview/
https://courses.csail.mit.edu/iap/interview/materials.php
https://www.advancedalgorithms.com/ru. Advanced algo (ru)
https://m.stopa.io/10-offers-100-days-the-journey-16a0407b8d95 interview https://habr.com/ru/post/454264/ . Inteview
https://hackernoon.com/20-string-coding-interview-questions-for-programmers-6b6735b6d31c
https://medium.com/@fahimulhaq/14-patterns-to-ace-any-coding-interview-question-c5bb3357f6ed
https://www.solutionfactory.in/posts/Floyd-Cycle-Detection-Algorithm-in-Java Cycle detection
https://docs.google.com/spreadsheets/d/1GOO4s1NcxCR8a44F0XnsErz5rYDxNbHAHznu4pJMRkw/edit#gid=0
https://www.youtube.com/watch?v=9clnwaqOU2E string algo
https://www.globalsoftwaresupport.com/most-common-programming-interview-questions-in-2019/
https://habr.com/ru/post/442352/ Бинарные деревья поиска
https://www.youtube.com/watch?v=lpO_arK69vg LCA
https://www.youtube.com/watch?v=bBPHpH8aKjw look fo links here!
https://news.ycombinator.com/item?id=18374938
https://habr.com/company/google/blog/425279/
https://www.youtube.com/watch?v=5o-kdjv7FD0
https://interviewing.io/recordings
https://habr.com/post/419725/ Non-symmetric dime simulation
http://www.cmsmagazine.ru/library/items/programming/80-problems-with-it-interviews/
https://saru.science/tech/2017/01/18/judy-arrays.html Judy array
https://www.reddit.com/r/cpp/comments/9afpq7/whats_your_favorite_data_structure/
https://discuss.codechef.com/questions/48877/data-structures-and-algorithms
https://www.youtube.com/watch?v=1CxyVdA_654 Running mediam in stream
https://www.youtube.com/watch?v=IHsX70r-fIQ Max sub-sequence in string
https://stackoverflow.com/questions/3260653/algorithm-to-find-top-10-search-terms/3260905#3260905
https://blog.datopia.io/2018/11/03/hitchhiker-tree/
http://yucoding.blogspot.com/2017/01/leetcode-question-range-sum-query.html
http://massivealgorithms.blogspot.com/
http://algorithms.tutorialhorizon.com/
https://habr.com/ru/post/261159/
https://habr.com/ru/post/449616/
https://habr.com/ru/post/450594/
http://www.oranlooney.com/post/fibonacci/
https://news.ycombinator.com/item?id=19216356
https://www.reddit.com/r/programming/comments/d1tgmy/computing_fibonacci_numbers_in_olog_n_using/ Computing Fibonacci Numbers In O(log n) using matrices and eigenvalues
https://habr.com/ru/articles/794556/
https://interviewing.io/blog/how-to-negotiate-with-meta
https://news.ycombinator.com/item?id=39526316
https://www.youtube.com/watch?v=2kv2LrKu-1c&list=PLqiTu7XWQ7jRy8AygDJL5ugVvVgYE05Kj Kazahstan programmers
https://www.youtube.com/watch?v=gbgiFVFhGkc
Majority element https://github.com/NaughtyConstrictor/From-Majority-to-Frequent-Elements-Boyer-Moore-and-Misra-Gries
Path to Senior Engineer Handbook by Jordan Cutler https://lnkd.in/exkJCxVi
Tech interview handbook by Yangshun Tay https://lnkd.in/e7EjsJNF
You don't know JavaScript by Kyle Simpson https://lnkd.in/eua7KvPC
Papers we love https://lnkd.in/eGcbN9RR
System design primer https://lnkd.in/eFyMhK6Z
Developer roadmap https://lnkd.in/e9MuB_Yg
Freecodecamp https://lnkd.in/e_4pA8xV
Free programming books https://lnkd.in/eXAzAJ3M
Web development for beginners by Microsoft https://lnkd.in/evM43KHy
https://engineering.fb.com/2023/06/27/developer-tools/meta-developer-tools-open-source/
https://www.youtube.com/watch?v=GLTR39VIAdc Datas Structures and Algo
✅ 𝐂𝐨𝐝𝐢𝐧𝐠 𝐈𝐧𝐭𝐞𝐫𝐯𝐢𝐞𝐰 👉 Solve LeetCode medium-level problems (at least more than 250+ covering different topics) 👉 I have created an xlsx on top/important 500 leetCode questions (https://lnkd.in/dWn73jXd) and a video on How to Crack The Coding Interview (https://lnkd.in/dsn4cipq) 👉 Clement Mihailescu's https://www.algoexpert.io/ 200 handpicked questions (In case you want to prepare fast and only good questions) 👉 I watched my DSA playlist to revise concepts at 2x speed (https://lnkd.in/dJfS9FkD) 👉 Grokking the Coding Interview (https://lnkd.in/dfKHYUQK) - It has covered various coding problems segregated based on coding patterns.
✅ 𝐋𝐨𝐰-𝐋𝐞𝐯𝐞𝐥 𝐃𝐞𝐬𝐢𝐠𝐧 𝐈𝐧𝐭𝐞𝐫𝐯𝐢𝐞𝐰 👉 Grokking the Object Oriented Design Interview (https://lnkd.in/deuAXR-U) - A very detailed & step-by-step approach to various OOD case studies 👉 Try practicing drawing UML diagrams on Diagrams.net
✅ 𝐀𝐏𝐈 𝐃𝐞𝐬𝐢𝐠𝐧 𝐈𝐧𝐭𝐞𝐫𝐯𝐢𝐞𝐰 👉 Best Practices (https://lnkd.in/d_x39xkK), Implementation (https://lnkd.in/d5fhXZJ7), & Guidelines (https://lnkd.in/dr397Hy2) of API Design 👉 Look for use cases like - Stripe (https://lnkd.in/dsM7PpJt) & Twitter (https://lnkd.in/dxiMu8wr) API Documentation 👉 Follow https://lnkd.in/dA5AUaz3#/ to understand how APIs should be designed
✅ 𝐃𝐚𝐭𝐚𝐛𝐚𝐬𝐞 𝐃𝐞𝐬𝐢𝐠𝐧 𝐈𝐧𝐭𝐞𝐫𝐯𝐢𝐞𝐰 👉 Grokking the Object Oriented Design Interview (https://lnkd.in/deuAXR-U) - Take the case studies and try to apply Object to Relational Mapping strategy 👉 Try practicing drawing relational schema on https://drawsql.app
✅ 𝐁𝐞𝐡𝐚𝐯𝐢𝐨𝐫𝐚𝐥 𝐈𝐧𝐭𝐞𝐫𝐯𝐢𝐞𝐰 👉 Watch Jeff H Sipe, Interview / Negotiation Consultant YouTube channel for behavioral questions (https://lnkd.in/d6rgxbnr) 👉 https://lnkd.in/dXBfNNK9
✅ 𝐈𝐦𝐩𝐨𝐫𝐭𝐚𝐧𝐭 𝐃𝐒𝐀 𝐭𝐨𝐩𝐢𝐜𝐬 Array, Binary Search, Sliding Window, Matrix, Two Pointer, Intervals, Hash Map, String, DP, Trees, Graph, Stack, Queue, Heap
✅ 𝐂𝐫𝐚𝐜𝐤𝐢𝐧𝐠 𝐭𝐡𝐞 𝐆𝐀𝐌𝐀𝐌 𝐓𝐞𝐜𝐡𝐧𝐢𝐜𝐚𝐥 𝐈𝐧𝐭𝐞𝐫𝐯𝐢𝐞𝐰𝐬 - For all the preparation resources, strategies, tips, and roadmap that I followed, you can buy my ebook at - https://lnkd.in/d9xe8yfJ
https://medium.com/@rohitverma_87831/my-interview-experience-at-google-afc1080df175
https://www.youtube.com/watch?v=68fDjQGgAxA
https://www.youtube.com/watch?v=YnxUdAO7TAo
https://www.youtube.com/watch?v=dK76rXBQ_IA Very good channel