CEO @NAG CORP, Harvard Strategic Management, Google EX-Intern, Stanford SVIA

Rakesh Naga Chinta

This course on top 10 ways to crack the interviews we explain the important points of graphs that used to make good in interviews.

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

Adobe, Amazon Top 10 Algorithms in Interview Questions

General Preparation

General Tips & Guidelines

Resume Building and General Tips

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.

General Preparation


Introduction of new algorithms asked in top interview questions
That these algorithms based on graphs of dynamic programing, linked lists, sorting ALGORITHMS etc..

Dynamic Programming Floyd Warshall Algorithm

Depth First Traversal (or Search) for a graph is similar to Depth First Traversal of a tree. The only catch here is, unlike trees, graphs may contain cycles, so we may come to the same node again. To avoid processing a node more than once, we use a boolean visited array.

Depth First Search or DFS for a Graph

Method 2 linked list

How to detect loop using Floyd's cycle detection algorithm

This solution requires modifications to basic linked list data structure. Have a visited flag with each node. Traverse the first linked list and keep marking visited nodes. Now traverse second linked list, If you see a visited node again then there is an intersection point, return the intersecting node. This solution works in O(m+n) but requires additional information with each node. A variation of this solution that doesn’t require modification to basic data structure can be implemented using hash. Traverse the first linked list and store the addresses of visited nodes in a hash. Now traverse the second linked list and if you see an address that already exists in hash then return the intersecting node.

Method 2 Linked List (make visited nodes)

Breadth First Traversal (or Search) for a graph is similar to Breadth First Traversal of a tree (See method 2 of this post). The only catch here is, unlike trees, graphs may contain cycles, so we may come to the same node again. To avoid processing a node more than once, we use a boolean visited array. For simplicity, it is assumed that all vertices are reachable from the starting vertex.

Breadth First Search or BFS for a Graph

Given a dictionary, a method to do lookup in dictionary and a M x N board where every cell has one character. Find all possible words that can be formed by a sequence of adjacent characters. Note that we can move to any of 8 adjacent characters, but a word should not have multiple instances of same cell.

Boggle (Find all possible words in a Board of Characters)

Kruskal's algorithm is a minimum-spanning-tree algorithm which finds an edge of the least possible weight that connects any two trees in the forest. It is a greedy algorithm in graph theory as it finds a minimum spanning tree for a connected weighted graph adding increasing cost arcs at each step.

Given a connected and undirected graph, aspanning tree of that graph is a subgraph that is a tree and connects all the vertices together.  A single graph can have many different spanning trees.  A minimum spanning tree (MST) or minimum weight spanning tree for a weighted, connected and undirected graph is a spanning tree with weight less than or equal to the weight of every other spanning tree. The weight of a spanning tree is the sum of weights given to each edge of the spanning tree.

Kruskal's Minimum Spanning Tree Algorithm

A simple solution is to traverse the linked list until you find the node you want to delete. But this solution requires pointer to the head node which contradicts the problem statement.

Fast solution is to copy the data from the next node to the node to be deleted and delete the next node.

Given a singly Linked List and a position, delete a Linked List node at the given position

A disjoint-set data structure is a data structure that keeps track of a set of elements partitioned into a number of disjoint (non-overlapping) subsets.  A union-find algorithm is an algorithm that performs two useful operations on such a data structure:

Find: Determine which subset a particular element is in. This can be used for determining if two elements are in the same subset.

Union: Join two subsets into a single subset.

Disjoint set or (union - find) Algorithm of a Graph

An edge in an undirected connected graph is a bridge iff removing it disconnects the graph. For a disconnected undirected graph, definition is similar, a bridge is an edge removing which increases number of disconnected components.

Finding Bridges in a graph intro to the Algorithm

Creative writer || B.E. || Information Technology || Cognizant, Infosys & Wipro Selected || Passionate to render skills 

Princy Lalawat

This course will help you in cracking the interview and getting a job in the corporate world.The transition from College to a Corporate environment is a big adjustment for many graduates. Expectations and responsibilities in the workplace are very different than those in College. There are unspoken nuances and social norms that many graduates are completely unaware of and adjusting to a professional environment can be extremely challenging as also traumatic to a few.

Campus Recruitment Drive: A Basic Guide

HR Professional with 10 years of corporate and consultancy experience.

Indrani Samba

This course discusses some Frequently asked Interview Questions such as Tell me about yourself and so on.

FAQs - Interview Questions

Software Engineer at Capgemini,GATE qualified 2020 & 2021, B.Tech(IT) at IIEST,Shibpur , Interview trainer and educator

Shreyasi Karak

This course is a guide to perform well in a telephonic interview or skype interview. It also covers how to crack a GD round with flying colors. This course will help an aspirant to tackle telephonic interview, skype interview and group discussions. It is a must watch course for those who are sitting for placements and interviews.

Learn to Tackle Telephonic, Skype interview and Group Discussion

I HAVE DONE B.TECH FROM IIMT COLLEGE.
I AM TEACHER.
I LOVE TEACHING.
I LOVE TO SHARE MY CONCERN TO ALL STUDENTS WHO WILLING TO GET KNOWLEDGE

Avishek Kumar

In this course, the educator is discussing  Custom Project for Campus Placement (Benefit for Engineering Students)

(Hindi) Custom Project for Campus Placement

Hey Guys it's Rahul Singh here with great vision and imagination for competitive exams like CTET/UPTET/DSSSB/TEACHING VACANCIES/ SSC /UPSSSC

Rahul Singh

This video is for CIPET students which will help them to enhance their performance in their campus placement interview , here we will discuss important points and important question which are mostly asked by the interview panel for DPT/DPMT/PGPPT/STC

Lessons

10 lessons • 1h 21m

Invalid Date

NaN

Top 10 Algorithms in Interview Questions: Introduction

Invalid Date

NaN

Dynamic Programming Floyd Warshall Algorithm

Invalid Date

NaN

Depth First Search or DFS for a Graph

Invalid Date

NaN

Method 2 Linked List (make visited nodes)

Invalid Date

NaN

Breadth First Search or BFS for a Graph

Invalid Date

NaN

Boggle (Find all possible words in a Board of Characters)

Invalid Date

NaN

Kruskal's Minimum Spanning Tree Algorithm

Invalid Date

NaN

Given a singly Linked List and a position, delete a Linked List node at the given position

Invalid Date

NaN

Disjoint set or (union - find) Algorithm of a Graph

Invalid Date

NaN

Finding Bridges in a graph intro to the Algorithm