Ritambhara Coding and System Design Interviews

@UCbxZ1oFr0h0SVxKwHoJwjvA - 5.8K subscribers

We offer live classes (not pre-recorded videos) to help professionals prepare for the CODING and SYSTEM DESIGN interviews of high-paying IT companies like Google, Facebook, Amazon, Microsoft, etc. We also provide classroom coaching in the Noida area esp. to students with following courses: - Placement Preparation (prepares you for placement test/interview of all the companies from Infosys to Google). - Industrial Training (2 months/ 3 months / 6 months) - GATE exam (for higher studies and PSUs) For details visit: www.ritambhara.in/online-coding-interview-preparat… Or Call: +91-8377803450 Email: [email protected] Give us a call if you want to conduct a workshop in your college on "How to prepare for placements" Buy our books and prepare for coding interviews on your own. www.amazon.com/Kamal-Rawat/e/B0765VFLKD/ref=dp_byl… For detailed discussions on Interview Questions visit: www.ritambhara.in/

Home Videos Live Playlists

Time and Space Complexities Course Introduction

Time and Space Complexities Course Introduction Ritambhara Coding and System Design Interviews

16 views - 1 week ago

All Data Structure & Algorithms along with their use cases and Time & Space Complexities

All Data Structure & Algorithms along with their use cases and Time & Space Complexities Ritambhara Coding and System Design Interviews

29 views - 1 week ago

Practice Questions on Memory Complexity of a Function

Practice Questions on Memory Complexity of a Function Ritambhara Coding and System Design Interviews

25 views - 1 week ago

Memory(Space) Complexity of a Function

Memory(Space) Complexity of a Function Ritambhara Coding and System Design Interviews

10 views - 1 week ago

Final Recurrence Practice Questions

Final Recurrence Practice Questions Ritambhara Coding and System Design Interviews

7 views - 1 week ago

Recurrences T(n) = a.T(n/b) +f(n). where n is divided by a Constant

Recurrences T(n) = a.T(n/b) +f(n). where n is divided by a Constant Ritambhara Coding and System Design Interviews

6 views - 1 week ago

What is Time and Space Complexity

What is Time and Space Complexity Ritambhara Coding and System Design Interviews

16 views - 1 week ago

Asymptotic Notations. Part 2

Asymptotic Notations. Part 2 Ritambhara Coding and System Design Interviews

16 views - 1 week ago

Asymptotic Notations. Part-1

Asymptotic Notations. Part-1 Ritambhara Coding and System Design Interviews

18 views - 1 week ago

Asymptotic Notations. Part 3. Practice Questions

Asymptotic Notations. Part 3. Practice Questions Ritambhara Coding and System Design Interviews

9 views - 1 week ago

Popular Time Complexities and Corresponding Code

Popular Time Complexities and Corresponding Code Ritambhara Coding and System Design Interviews

22 views - 1 week ago

1. Most Executed Statement

1. Most Executed Statement Ritambhara Coding and System Design Interviews

5 views - 1 week ago

2 Using Loops given in the code

2 Using Loops given in the code Ritambhara Coding and System Design Interviews

16 views - 1 week ago

Ways to compute Time Complexity of Code

Ways to compute Time Complexity of Code Ritambhara Coding and System Design Interviews

7 views - 1 week ago

3. Count Number of Elements to Find Time Complexity

3. Count Number of Elements to Find Time Complexity Ritambhara Coding and System Design Interviews

21 views - 1 week ago

4. 5. Finding Time Complexity using Memory Model and Function Call Tree

4. 5. Finding Time Complexity using Memory Model and Function Call Tree Ritambhara Coding and System Design Interviews

37 views - 1 week ago

Recurrences T(n) = a.T(n-b) +f(n). where n is reduced by Constant

Recurrences T(n) = a.T(n-b) +f(n). where n is reduced by Constant Ritambhara Coding and System Design Interviews

9 views - 1 week ago

Array vs Linked List. With detailed implementation of LL

Array vs Linked List. With detailed implementation of LL Ritambhara Coding and System Design Interviews

9 views - 1 week ago

Print the 2 dim array in Spiral Order (LeetCode-54)

Print the 2 dim array in Spiral Order (LeetCode-54) Ritambhara Coding and System Design Interviews

7 views - 2 weeks ago

Given a 2D array, print all elements in diagonal order (Line by Line Diagonal Traversal)

Given a 2D array, print all elements in diagonal order (Line by Line Diagonal Traversal) Ritambhara Coding and System Design Interviews

12 views - 2 weeks ago

Should the School going Students be exposed to technology?

Should the School going Students be exposed to technology? Ritambhara Coding and System Design Interviews

21 views - 4 months ago

Preparing Next-Generation Software Engineers

Preparing Next-Generation Software Engineers Ritambhara Coding and System Design Interviews

224 views - 4 months ago

Importance of Creating Systems In an Institute

Importance of Creating Systems In an Institute Ritambhara Coding and System Design Interviews

154 views - 4 months ago

Poisoned Drums Problem_Logic Building for Coding Interviews

Poisoned Drums Problem_Logic Building for Coding Interviews Ritambhara Coding and System Design Interviews

126 views - 6 months ago

Static vs Non Static local variables in a function (HINDI AUDIO)

Static vs Non Static local variables in a function (HINDI AUDIO) Ritambhara Coding and System Design Interviews

24 views - 6 months ago

Steps in Solving a Coding Interview Problem (HINDI AUDIO)

Steps in Solving a Coding Interview Problem (HINDI AUDIO) Ritambhara Coding and System Design Interviews

180 views - 6 months ago

Concept of Stack Overflow vs Infinite Loop (HINDI_AUDIO)

Concept of Stack Overflow vs Infinite Loop (HINDI_AUDIO) Ritambhara Coding and System Design Interviews

21 views - 6 months ago

Binary Trees Tutorial - Beginner to Advance. Part-1

Binary Trees Tutorial - Beginner to Advance. Part-1 Ritambhara Coding and System Design Interviews

30 views - 6 months ago

AI Generated Code is not Reliable. Review it before using.

AI Generated Code is not Reliable. Review it before using. Ritambhara Coding and System Design Interviews

207 views - 6 months ago

Pre-Placement Talk at the Department of Computer Science, Central University of Himachal Pradesh

Pre-Placement Talk at the Department of Computer Science, Central University of Himachal Pradesh Ritambhara Coding and System Design Interviews

113 views - 1 year ago

House Robber LeetCode 198, Maximum Subsequence Sum of Non-adjacent

House Robber LeetCode 198, Maximum Subsequence Sum of Non-adjacent Ritambhara Coding and System Design Interviews

196 views - 1 year ago

Future of IT education in India

Future of IT education in India Ritambhara Coding and System Design Interviews

662 views - 1 year ago

Last Minute Tip Before The Coding Interview

Last Minute Tip Before The Coding Interview Ritambhara Coding and System Design Interviews

71 views - 1 year ago

How Important is System Design For Students

How Important is System Design For Students Ritambhara Coding and System Design Interviews

66 views - 1 year ago

C++ Operators in detail

C++ Operators in detail Ritambhara Coding and System Design Interviews

179 views - 1 year ago

Operators in C / C++ (Precedence, Associativity and Order or Evaluation)

Operators in C / C++ (Precedence, Associativity and Order or Evaluation) Ritambhara Coding and System Design Interviews

223 views - 1 year ago

If Coding Interview just about DS & ALGO

If Coding Interview just about DS & ALGO Ritambhara Coding and System Design Interviews

548 views - 3 years ago

String Matching (Part1)

String Matching (Part1) Ritambhara Coding and System Design Interviews

576 views - 4 years ago

Coding and System Design Interviews Tips.

Coding and System Design Interviews Tips. Ritambhara Coding and System Design Interviews

25K views - 4 years ago

Minimum cost to reach destination station on a linear track

Minimum cost to reach destination station on a linear track Ritambhara Coding and System Design Interviews

1.2K views - 5 years ago

Find the Build-Order from given dependencies between modules

Find the Build-Order from given dependencies between modules Ritambhara Coding and System Design Interviews

12K views - 5 years ago

Count the Island in a binary Array

Count the Island in a binary Array Ritambhara Coding and System Design Interviews

4.1K views - 5 years ago

Coding problems based on Huffman encoding

Coding problems based on Huffman encoding Ritambhara Coding and System Design Interviews

300 views - 5 years ago

Rotten Oranges: Minimum time required to rot all oranges

Rotten Oranges: Minimum time required to rot all oranges Ritambhara Coding and System Design Interviews

16K views - 5 years ago

Print Permutations of an array with duplicate elements

Print Permutations of an array with duplicate elements Ritambhara Coding and System Design Interviews

15K views - 5 years ago

Object Oriented Programming: Interface vs Implementation

Object Oriented Programming: Interface vs Implementation Ritambhara Coding and System Design Interviews

543 views - 5 years ago

LeetCode: Minimum Number of Refueling Stops

LeetCode: Minimum Number of Refueling Stops Ritambhara Coding and System Design Interviews

3.6K views - 5 years ago

LeetCode: Robot Room Cleaner

LeetCode: Robot Room Cleaner Ritambhara Coding and System Design Interviews

6.8K views - 5 years ago

LeetCode: String To Integer (atoi)

LeetCode: String To Integer (atoi) Ritambhara Coding and System Design Interviews

32K views - 5 years ago

LeetCode: K closest points to origin

LeetCode: K closest points to origin Ritambhara Coding and System Design Interviews

1.2K views - 5 years ago

Insert a value in a Sorted Linked List

Insert a value in a Sorted Linked List Ritambhara Coding and System Design Interviews

6.8K views - 5 years ago

Insert at the end (tail) of a Linked List

Insert at the end (tail) of a Linked List Ritambhara Coding and System Design Interviews

1.8K views - 5 years ago

Inserting at the beginning (head) of a linked list

Inserting at the beginning (head) of a linked list Ritambhara Coding and System Design Interviews

388 views - 5 years ago

Student Feedback on Coding Interview classes and internship program

Student Feedback on Coding Interview classes and internship program Ritambhara Coding and System Design Interviews

363 views - 6 years ago

Problem Solving strategy for Coding Interviews

Problem Solving strategy for Coding Interviews Ritambhara Coding and System Design Interviews

3.2K views - 6 years ago

Print patterns formed by replacing characters of a string with digits

Print patterns formed by replacing characters of a string with digits Ritambhara Coding and System Design Interviews

280 views - 6 years ago

Print Permutations of elements of an array with no duplicates

Print Permutations of elements of an array with no duplicates Ritambhara Coding and System Design Interviews

80K views - 6 years ago

Best way to Remove all white spaces from a string. Linear-Time Solution

Best way to Remove all white spaces from a string. Linear-Time Solution Ritambhara Coding and System Design Interviews

466 views - 6 years ago

Sliding Windows Interview Question. Find min swaps needed to bring all 1s together in a binary array

Sliding Windows Interview Question. Find min swaps needed to bring all 1s together in a binary array Ritambhara Coding and System Design Interviews

1.2K views - 6 years ago

Sliding Windows Question: Maximum sum subarray of size k in an array

Sliding Windows Question: Maximum sum subarray of size k in an array Ritambhara Coding and System Design Interviews

851 views - 6 years ago