Cracking the Coding Interviews

Course Content 112 lectures26:15:17

12:27

08:41

12:23

11:16

11:4

12:31

18:5

15:14

12:20

08:59

10:47

04:8

05:35

Given an integer x, find square root of x without sqrt() function ~~~~Asked in : Accolite, Qualcomm

09:52

12:26

20:19

15:39

- -MORE- -

15:8

15:15

21:26

Design a video sharing service like Youtube. User can upload,search and view the videos

20:30

Design an online movie ticket booking system like : bookmyshow.com ~~~~Asked in : Amazon,Uber

19:33

Design a ride sharing system like Uber

12:16

13:39

19:36

21:1

13:32

Design a parking lot System using object-oriented principles ~~~~Asked in : Cisco, Flipkart, Oracle

11:54

23:6

Design a photo-sharing service like Instagram ~~Asked in : Google, Microsoft, Facebook

22:22

Design a file hosting service like Dropbox or Google Drive ~~~~ Asked in : NetApp, Cisco

20:19

Design custom implementation hashmap, how hashmap works internally in Java

18:15

29:58

13:33

11:6

17:37

12:4

- -MORE- -

13:55

16:18

14:35

19:5

12:15

18:14

11:58

17:14

11:42

15:9

16:9

20:19

- -MORE- -

07:40

11:8

13:38

11:50

10:9

13:5

09:27

17:45

10:58

13:52

15:41

20:39

07:47

08:15

- -MORE- -

12:20

13:12

20:35

13:30

07:14

Given an integer x and a positive number n, write a efficient algorithm to computes x^n

13:27

- -MORE- -

11:58

Given a binary tree, WAP to Connect all the nodes in same level of that binary tree

13:11

06:35

17:15

11:8

Given a binary tree, print boundary nodes of the binary tree Anti-Clockwise starting from the root

16:50

18:24

Given postorder traversal of a binary search tree, construct the binary search tree

12:49

08:46

06:5

12:11

13:29

18:0

Given two n-ary trees, the task is to check if they are mirror of each other or not

18:29

- -MORE- -

11:34

13:48

21:12

13:25

14:45

20:11

09:11

Given k sorted array, write an efficient algorithm to merge them into one sorted array

30:3

- -MORE- -

13:35

16:48

Design a data structure which support push()/pop()/findminimum() operation in O(1) time

08:18

Given a binary matrix, find the maximum size rectangle binary-sub-matrix with all 1’s

22:36

- -MORE- -

12:18

11:1

17:31

Given a linked list, sort it using merge sort algorithm

10:43

12:19

- -MORE- -

**Useful Links**

What our students have to say