Currently pursuing Btech in Computer Science from NIT Durgapur. Interested in Competitive Programming, Data Structures and Web Development.

Shashank Shekhar

In this course, you will learn tricks and solutions to essential questions asked in coding interviews. We will try to over as many topics as possible in the course. A few problems from each course will be discussed with examples and C++ code. This course is primarily for students who have begun preparing for coding interviews. We are sure by the end of this course, you will be a better programmer and also have great hold of some very important topics.

Ace your job interview with interview questions, resume format, resume samples, GD topics & aptitude test by experts. Learn about a CV & cover letter for private & government jobs.

Campus Placements

English

Competitive Programming

CS & IT

Technical Interview

Interview Preparation & GD

Personal and Skill Development

Develop your coding skills, learn a new language or prepare for campus placements and job interviews, you can do it all with these awesome courses.

In this lesson, we will learn a very common yet important algorithm known as Kadane's Algorithm which is used to solve the Largest Sum Contiguous Sub-array problem. This is a problem based on Arrays. Watch the video to understand how this works.

Kadane's Algorithm: Largest Sum Contiguous Subarray

In this lesson, we will solve the Finding Duplicate Elements problem. Our challenge is to do it without any extra space. This is a problem based on Arrays. We shall learn how.

Finding Duplicate Numbers in Constant Space Complexity

In this lesson, we will learn how to solve the Finding Triplet Problem. This is a problem based on Arrays. We will find an efficient solution contrary to the naive approach. We shall learn how.

Triplet of Numbers Summimg to a Value

In this lesson, we will learn about Comparison based Sorting. We will use this concept to solve the Arrange numbers to form the largest number problem. This is a problem based on Arrays. Stay tuned to understand the concept.

Arrange Numbers to Form Largest Number

In this lesson, we will solve the Maximum j-i such that arr[j]>arr[i] problem. We will learn how we can pre compute and bring forth an efficient solution. This is a problem based on Arrays. Watch and learn

Maximum j-i Such That arr [j] > arr [I]

This lesson is an introductory lesson to the modifications of Binary Search. We will learn how we can modify binary search to find first and last occurence of numbers present multiple times in a container. This lesson is based on Binary Search. Watch the video to understand how this works.

Modifying Binary Search

In this lesson, we shall learn about Rotated Sorted Array. We shall dive in and understand how to find the pivot of rotated sorted array in logarithmic time complexity. This lesson is based on Binary Search. Watch the video to understand how this works.

Searching in Rotated Arrays - I

This is a continuation of the previous lesson. We will see how the concept works and also write code for the same. This lesson is based on Binary Search. Watch the video to understand how this works.

Searching in Rotated Arrays - II

#Gate Ranker # Mtech from JEC Jabalpur. use code " MACHINE20" to attend my Classes. I don't teach "I simply explain the topic."

Ravendra Yadav

In this very new course we are discussing about some basic facts of electrical engineering which are being asked in exams and interviews.

(Hindi) Electrical Engineering Interview Basic Questions

UG KLUian | ECE student | aspirant to teach | love programming

Srija Kalyanam

This course covers bubble sorting, how to perform linear search in an array and find the number, use of %i in scanf(), memory functions like malloc(), calloc(), LCM of two numbers and GCD of two numbers, many simple and easy theoretical questions are explained clearly and programs are also explained by taking suitable examples.

Learning C - Frequently Asked Questions (Part 2)

Mentored 81,000+ Students | My Multiple Students secured AIR Below 100 in GATE | Joined top IISc, IITs & NITs | Joined PSUs | 5+ Years Exp.

Sweta Kumari

This course covers top 10 difference between interview questions from DBMS with Tricks for GATE aspirants and also beneficial for technical interview.

(Hindi) Top 10 'Difference between' Interview Questions from DBMS with Tricks

Sourav Maity

All about CSS advance matter and above the topics covered by me in CSS basics. First clearly go through the CSS basics course and then go for the advance version. Topics covered are Texts, Fonts, Align, Position, Lists, Tables, Navigation Bar. From this course, one would be able to make your website more attractive and do various activities with it. This course would help you in your regular classes too and make your command strong over CSS.

Learn CSS in Advanced Level

I have done my bachelors in Computer Science and Engineering. I have done several software programming courses like core java , Advanced jav

Rani Bandare

This course contains java language  related basic terms like data types, literals, identifier with example so that you can get proper idea.

(Hindi) Java Programming Basic Knowledge : CS and IT

BTech civil, 
practical and theoretical lessons of civil engineering.
General intelligence and general mathematics.

Sagar Sharma

In this course we will discuss about the most frequently asked technical civil engineering questions.

Lessons

8 lessons • 1h 7m

Invalid Date

NaN

Kadane's Algorithm: Largest Sum Contiguous Subarray

Invalid Date

NaN

Finding Duplicate Numbers in Constant Space Complexity

Invalid Date

NaN

Triplet of Numbers Summimg to a Value

Invalid Date

NaN

Arrange Numbers to Form Largest Number

Invalid Date

NaN

Maximum j-i Such That arr [j] > arr [I]

Invalid Date

NaN

Modifying Binary Search

Invalid Date

NaN

Searching in Rotated Arrays - I

Invalid Date

NaN

Searching in Rotated Arrays - II