interviewing.io - practice your one-on-one interviewing with a peer. It’s good free practice, and as you get better interviewing.io will try to make a recruiting commission off of you by matching you with a real employer. Interview Cake - a lot of interview questions are “progressive”; they start with a simple question and have a lot of follow up questions, allowing the interviewer to fill up the hour they have with you, irrespective of how fast or slow you are to answer their questions. Interview Cake helped Paul get better at that specific interview format. Source: https://www.quora.com/Which-is-the-best-site-for-preparing-for-Google-interviews
http://www.codespaghetti.com/spring-interview-questions/
Basic Level: https://www.w3schools.com/sql/ : Amazing starting point. Know all the basic things needed.
https://www.w3schools.com/sql/sql_quiz.asp: Don't forget to take the quiz.
Check out the amazing reference , may not be the full list, but good enough https://www.w3schools.com/sql/sql_ref_mysql.asp
Good starting point : https://www.hackerrank.com/domains/sql/select
slightly tougher with some good catch points: https://codefights.com/arcade/db
Practise this as well: https://leetcode.com/problemset/database/
my Anki Card.
https://www.youtube.com/channel/UCZLJf_R2sWyUtXSKiKlyvAw
Grokking the System Design Interview: https://www.educative.io/collection/5668639101419520/5649050225344512?authorName=Design%20Gurus
https://www.puncsky.com/blog/2016-02-13-crack-the-system-design-interview
https://github.com/donnemartin/system-design-primer
https://www.youtube.com/watch?v=0s1aVoeF0Gs
http://highscalability.com/all-time-favorites/
https://www.hiredintech.com/classrooms/system-design/lesson/52
https://www.interviewbit.com/courses/system-design/
https://github.com/shashank88/system_design#designques
https://nickcraver.com/blog/2016/02/17/stack-overflow-the-architecture-2016-edition/
How to generate business unique key in distributed environments
https://www.mongodb.com/blog/post/generating-globally-unique-identifiers-for-use-with-mongodb
A comparision between cassandra and mongodb , a good read, the comments are also
https://scalegrid.io/blog/cassandra-vs-mongodb/
Some design questions , we should try
-
Elevator
-
Facebook like Social Network
-
Twitter like Microblogging website
-
ATM Machine
-
Amazon like shopping cart website for general users
-
Blogging website
-
Google docs like online collaboration document
-
Youtube like online video streaming website.
-
JIRA like project management system
-
Quora or Yahoo answers like question answers website
-
Online food delivery like foodpanda
-
Game(human vs human) of chess, sudoku, tic tac toe etc.
CAP Theorem and a great war, Did you understand CAP properly ? Feast your brain https://martin.kleppmann.com/2015/05/11/please-stop-calling-databases-cp-or-ap.html https://arxiv.org/abs/1509.05393 https://research.google.com/pubs/pub45855.html?hl=pl
CAP Theorem in terms of mysql http://messagepassing.blogspot.com/2012/03/cap-theorem-and-mysql-cluster.html
https://dzone.com/articles/do-immutability-really-means
https://betsol.com/2017/06/java-memory-management-for-java-virtual-machine-jvm/
Try making the super class abstract, by doing so we are forcing the client to think there has to be a subclass which needs to used.
https://vaughnvernon.co/?page_id=31
https://community.hortonworks.com/articles/80813/kafka-best-practices-1.html
#Restful
Can you find the closest number that is 2^n ?
Can you find if a number is power of 2^n ?
can you find if a number is power of 3^n or for that matter m^n ?
can you count the number of 1's in a binary representation of a decimal number ?
Flip unset kth bit: https://app.codesignal.com/arcade/code-arcade/corner-of-0s-and-1s/b5z4P2r2CGCtf8HCR
For n = 37 and k = 3, the output should be
killKthBit(n, k) = 33.
3710 = 1001012 ~> 1000012 = 3310.
Array Packing : https://app.codesignal.com/arcade/code-arcade/corner-of-0s-and-1s/KeMqde6oqfF5wBXxf
For a = [24, 85, 0], the output should be arrayPacking(a) = 21784.
An array [24, 85, 0] looks like [00011000, 01010101, 00000000] in binary. After packing these into one number we get 00000000 01010101 00011000 (spaces are placed for convenience), which equals to 21784.
Hackerearth.com
Hackerrank.com
leetcode.com