About Course

Electrical engineering is concerned with the study, design, and application of equipment, devices, and systems which use electricity, electronics, and electromagnetism.

Course Syllabus

Matrices

Introduction, creating matrices in programming.

Problems on Arrays/Matrices :

• Maximum Sub Array Sum using Kadane’s Algorithm
• Sub Sequence/ subsets problems
• Set Matrix zeros in place
• Rotate Matrix elements by 90 degrees
• Find distinct element common to all rows of a matrix (GeeeksForGeeks)
• Find distinct element common to all rows of a matrix (LeetCode)
• print matrix in zig zag fashion (GeeeksForGeeks)
• print matrix in zig zag fashion (LeetCode)

Stack

Introduction to stack, applications of stack, implementation of stack in programming.

Problems on Stacks :

• Implement getMin() in linear time(i.e., O(1)))
• Implement two stacks in a single array
• Find the first greater element on right side for every element ar[i] in a given array
• Check for balanced parentheses in an expression
• Reverse a string of words
• The Stock Span problem

Queue

Introduction to Queue, Types of Queues, applications of Queue, implementation of Queue in programming.

Problems on Queues :

• Implement Queue using Stack
• Design Queue for getMin( ) in 0(1) time complexity.
• Find maximum number in each window of k in an array of size N
• Stamping the sequence

Linked List

Introduction to Linked Lists, Types of Linked List, implementation of Linked List in programming.

Problems on Linked Lists :

• Reverse a singly linked list
• Find the midpoint of a linked list
• Merge the given two sorted linked list in sorted order
• Union and Intersection of two Linked Lists
  • Union of two Linked Lists
  • Intersection of two Linked Lists
• Cloning a singly linked list with next and random pointer
• Rearrange a given linked list in-place. Example:1->2->3->4->5->6 ans:1->6->2->5->3->4
• Add two numbers represented by linked lists into a new Linked List
• Detect and remove loop in Linked List
  • Detect loop in Linked List
  • Remove loop in linked list
• Find Intersection point of two Linked Lists
• Given a linked list, WAF to reverse every k nodes
• Given a pointer to the head of a circular linked list, split the list in two equal sized circular linked lists and return the head of the 2nd circular list
• Flattening a Linked List

Hashing

Introduction to Hashing, Implementation of hash tables

Problems on Hashing :

• Count distinct elements in every window of size k
• Length of the largest subarray with elements that can be arranged in a continuous sequence. (Elements may be repeated)
• Given an array of integers, find the length of the longest subsequence such that elements in the subsequence are consecutive integers, the consecutive numbers can be in any order.
• Find four elements a, b, c and d in an array such that a+b = c+d (all elements are distinct in the array).

Trees

Introduction to trees, tree terminology, implementation of BST.

Problems on Trees :

• Implement Tree Traversals inorder, preorder, post order, level order.
  • Binary tree in-order traversal
  • Binary tree pre-order traversal
  • Binary tree post-order traversal
  • Binary tree level-order traversal
• Find the height of a binary tree
• Convert a binary tree into its mirror tree
• Find maximum non empty path sum in a binary tree
• Check if a given Binary Tree is a Binary Search Tree or not
• Find the minimum time required to pass the information to all nodes in the tree
  • Amount of time for binary tree to be infected
  • Burning Tree
• WAF to find the Least Common Ancestor [LCA] in a Binary Tree
• Given a Binary Tree convert it into Doubly Linked List

Syllabus

• Click here to view