Object Oriented Programming

GATE

Data Structures

Data Structures in Python

Power BI

Data Science

Django

Data Structure and Algorithm

Python

Recursion

Arrays

Searching

Sorting

String

Linked List

Data Structures in C

Maths

Strings

C++ Tricks

System Design

Theory of Computation

Computer Organization and Architecture

Operating System

Engineering Mathematics

Database

Digital Logic

Computer Networks

GATE 2022

Java

GeeksforGeeks School

Hashing

Competitive Programming

Problem of the Day

School

HTML

Javascript

Bootstrap

Web Development

Android

Microsoft Office

Machine Learning

Resume Builder

Miscellaneous

Gblog

TechTips

React

Advanced JavaScript

DSA Self Paced

CS-subjects

Data Structures and Algorithms

Operating Systems

C Language

DBMS

Basics of CPP

Data Structures ( Basics )

Object Oriented Design

Dynamic Programming

Data Interpretation and Logical Reasoning

Algorithms

Core Java

RESTful APIs

Spring Basics

CPP-Tricks

Basics of Java

Aptitude

GATE YT

Flutter

Application Development

Blockchain

GFG SDE Sheet

SDE Sheet

Deep Learning

Go Programming

Placement

C++ Programs

Data Visualisation

DevOps

Docker

Queue

Matrix

Trie

Stack

Graph

Tree

Magic Numbers

Divide and Conquer

React Native

React JS

Interview-Questions

Advanced Java

cloud-computing

income tax

Artificial Intelligence

Programming Languages

Computer Graphics

Cyber Security

Project Management

For more details, please go through - <a href="https://www.geeksforgeeks.org/dsa/write-a-c-program-to-print-all-permutations-of-a-given-string/">Permutations of given String</a>

Printing all Permutations.

In this video, we will discuss three methods to check if a singly linked list is a palindrome. The first approach uses a stack, where we push each node’s data onto the stack and then compare the nodes with the popped elements in the second traversal. This method runs in O(n) time and uses O(n) space due to the stack. The second approach employs recursion to compare nodes from the left and right, moving start forward and recursively checking the rest. This also runs in O(n) time but uses O(n) space for the recursion stack.The third approach is the most efficient, utilizing an iterative method with two pointers: slow and fast. The fast pointer moves twice as fast as the slow pointer, allowing the slow pointer to reach the middle of the list. We then reverse the second half of the list and compare it with the first half. This method runs in O(n) time and uses O(1) space, making it optimal. Watch the video to learn the details of each approach and see how they work to check if a linked list is a palindrome. For more details, please go through - <a href="https://www.geeksforgeeks.org/function-to-check-if-a-singly-linked-list-is-palindrome/">Palindrome Linked List</a>

Palindrome Linked Lists

Insert In BST (Python)

For more details, please go through - <a href="https://www.geeksforgeeks.org/dsa/deletion-in-binary-search-tree/">Deletion in Binary Search Tree (BST)</a>

Deletion in BST.

AAAIn this video, we explore the process of serializing and deserializing a binary tree, which allows us to store and later restore a tree structure. Serialization is the process of converting the tree into an array, while deserialization reconstructs the tree from that array. We cover two approaches for serialization: using preorder traversal and using level order traversal. Both methods ensure that the tree structure is preserved, with the latter being more suitable for complete trees. We also explain the time and space complexities of each approach.The first approach uses preorder traversal to serialize the tree, where each node’s value is recorded, and a marker (-1) is used for null nodes. The second approach employs level order traversal, which processes nodes level by level, making it suitable for complete binary trees. The deserialization process for both methods involves reconstructing the tree from the array, creating nodes where necessary, and linking them back together. Finally, we discuss potential optimizations for more efficient storage, such as using a single bit for leaf nodes to minimize markers. For more details, please go through - <a href="https://www.geeksforgeeks.org/serialize-deserialize-binary-tree/">Serialize and Deserialize a Binary Tree</a>

Serialize and Deserialize Binary Tree

In this video, we explore how to find the Lowest Common Ancestor (LCA) in a Binary Search Tree (BST). The LCA of two nodes is the lowest node that has both nodes as descendants, with the added condition that the node itself can be a descendant of itself. We present two approaches: the recursive method and the iterative method. In the recursive approach, we check if both nodes are smaller or greater than the current node, recursively traversing left or right subtrees until the LCA is found. If one node is smaller and the other is larger, the current node is the LCA.The iterative method improves upon the recursive approach by eliminating the need for recursion, optimizing space complexity to O(1). We traverse the BST iteratively, checking the values of n1 and n2 at each node. If both n1 and n2 are smaller than the current node, we move left; if both are greater, we move right. Once we find a node where one value is smaller and the other is larger, that node is the LCA. This method maintains the efficiency of the recursive approach while using constant space. For more details, lease go through -<a href="https://www.geeksforgeeks.org/lowest-common-ancestor-in-a-binary-search-tree/">LCA in BST – Lowest Common Ancestor in Binary Search Tree</a>

LCA in BST – Lowest Common Ancestor in Binary Search Tree

In this video, we explore how to check if a given binary tree is a Binary Search Tree (BST) or not. A Binary Search Tree (BST) is a binary tree where the left subtree's nodes are smaller than the root, and the right subtree's nodes are greater, with the added condition that both subtrees must also be BSTs. We discuss three different approaches to solving this problem: using a specified range of minimum and maximum values, using inorder traversal, and using Morris Traversal. Each method ensures that the binary tree satisfies the properties of a BST, allowing you to verify if the tree is a BST or not.The first approach uses a recursive helper function, isBSTUtil(), which checks whether a subtree is a BST within a given range. The second approach leverages inorder traversal, checking if the values of the nodes are sorted in ascending order. Finally, the third approach uses Morris Traversal, which eliminates the need for extra space while performing the check. This method temporarily alters the tree structure to create threads, helping maintain the BST properties while traversing the tree efficiently. For more details, please go through - <a href="https://www.geeksforgeeks.org/a-program-to-check-if-a-binary-tree-is-bst-or-not/">Check if a Binary Tree is BST or not</a>

Check if a Binary Tree is BST or not

Morris Traversal is an efficient method for performing an inorder traversal of a binary tree without using recursion or a stack. The key idea behind Morris Traversal is to use threaded binary trees, which create temporary links (or "threads") to the inorder successors of nodes, allowing traversal without additional space. The process involves traversing the tree and making changes to the tree's structure temporarily, which are reverted after the traversal is complete.The algorithm works by setting the current node as the root and iterating through the tree. If a node does not have a left child, the node's value is printed and the traversal moves to the right child. If a node has a left child, the inorder predecessor is found (the rightmost node in the left subtree). If the right child of the predecessor points back to the current node, the changes made to the tree structure are undone, and the current node’s data is printed before moving to the right child. This process ensures that no extra space is used, and the tree is restored to its original form at the end. The time complexity of this approach is O(n), where n is the number of nodes in the tree, and the space complexity is O(1), as no extra data structures are used. For more details, please go through - <a href="https://www.geeksforgeeks.org/inorder-tree-traversal-without-recursion-and-without-stack/">Morris traversal for Inorder</a>

Morris traversal for Inorder

The diameter of a binary tree is the length of the longest path between any two nodes in the tree, measured in terms of the number of edges. There are two main approaches to calculate the diameter of a binary tree: the naive approach using top-down recursion and the more efficient bottom-up approach.In the naive approach, the diameter is calculated by recursively determining the height of the left and right subtrees for each node. For each node, the sum of the heights of its left and right subtrees is calculated, and the maximum of these sums is compared to the current maximum diameter. This process results in O(n^2) time complexity as the height is computed separately for each node. On the other hand, the bottom-up recursive approach optimizes this by calculating the height and diameter in the same recursive call. For each node, it computes the height of its subtrees and updates the diameter by checking if the sum of the left and right subtree heights exceeds the current maximum. This approach improves the time complexity to O(n), where n is the number of nodes in the tree, with auxiliary space complexity of O(h), where h is the height of the tree. For more details, please go through - <a href="http://geeksforgeeks.org/diameter-of-a-binary-tree/">Diameter of a Binary Tree</a>

Diameter of a Binary Tree.

Level Order Traversal, also known as Breadth First Search (BFS), is a technique to traverse all nodes in a binary tree level by level. This approach ensures that nodes at the same level are visited before those at the next level. The traversal can be implemented in two main ways: using recursion with a stack or iteratively with a queue.In the recursive approach, a helper function is used to traverse the tree, passing the current node and its level. Nodes at the same level are grouped together in a result array, where the index corresponds to the level of the node. On the other hand, the iterative approach uses a queue to process the nodes level by level. Starting from the root, the left and right children of each node are enqueued for processing. This method maintains a First-In-First-Out (FIFO) order, ensuring that all nodes at the current level are processed before moving to the next level. Both approaches have a time and space complexity of O(n), where n is the number of nodes in the tree. For more details, please go through - <a href="https://www.geeksforgeeks.org/level-order-tree-traversal/">Level Order Traversal (Breadth First Search or BFS) of Binary Tree</a>

Level Order Traversal.

In this video, we explore multiple approaches to flattening a linked list of linked lists, where each sub-linked list is sorted. The first method is a simple yet inefficient approach, where we collect all the node values into an array, sort the array, and then create a new linked list by iterating through the sorted array. This method has a time complexity of O(n * m * log(n * m)) and uses O(n * m) space, making it less efficient for large lists.The second approach uses recursion to merge two sorted linked lists at a time, similar to how we merge lists in merge sort. This results in a time complexity of O(n * n * m), where n is the number of main linked list nodes and m is the size of a single sub-linked list. The third approach optimizes the process by using a Min Heap (priority queue). By always extracting the minimum element from the heap, it ensures that nodes are flattened in sorted order efficiently. This method has a time complexity of O(n * m * log(n)) and uses O(n) space, making it the most efficient. Watch the video to dive deeper into these methods and see them in action! For more details, please go through - <a href="https://www.geeksforgeeks.org/flattening-a-linked-list/">Flattening a Linked List</a>

Flattening a Linked List.

In this video, we will discuss several approaches to merge K sorted linked lists into a single sorted list. The first method is a simple approach where we merge the lists one by one. Starting with an empty result list, we merge each linked list into the result using the standard merge algorithm for two sorted lists. This approach has a time complexity of O(n * k * k), where n is the length of each list and k is the number of lists, and uses O(1) space.The second approach improves this by selecting the smallest node from all the current head nodes and adding it to the result list. By doing this iteratively, we eventually merge all the lists. This method also has a time complexity of O(n * k * k) and uses O(1) space. The third approach, using a min heap, is more efficient for unevenly sized lists. It reduces the time complexity to O(n * k * log k) by efficiently finding the minimum element across all lists. Lastly, the divide and conquer approach splits the lists into two halves recursively, merging them pair by pair, which is similar to merge sort. This method works best when the lists are of equal size and has a time complexity of O(n * k * log k). Watch the video to learn the details of these approaches and how to merge K sorted linked lists efficiently. For more details, please go through - <a href="https://www.geeksforgeeks.org/merge-k-sorted-linked-lists/">Merge K sorted linked lists</a>

Merge K sorted linked list

For more details, Please go through - <a href="https://www.geeksforgeeks.org/maths/integral-calculus/">Integral Calculus</a>

Integral Calculus

For more details, Please go through - <a href="https://www.geeksforgeeks.org/maths/greatest-common-divisor-gcd/">Greatest Common Divisor - GCD</a>

Unlocking the Power of GCD

For more details, please go through - <a href="https://www.geeksforgeeks.org/maths/lcm-least-common-multiple/">LCM - Least Common Multiple</a>

Understanding LCM

For more details, please go through - <a href="https://www.geeksforgeeks.org/maths/what-is-mean/">Mean in Statistics</a>

Understanding Mean in Statistics

For more details, please go through - <a href="https://www.geeksforgeeks.org/maths/median/">Median in Statistics</a>

Understanding Median in Statistics

For more details, please go through - <a href="https://www.geeksforgeeks.org/maths/what-is-mode/">Mode in Statistics</a>

Understanding Mode in Statistics

For more details, please go through - <a href="https://www.geeksforgeeks.org/maths/sets/">Sets in Maths</a>

Understanding Sets in Mathematics

For more details, please go through - <a href="https://www.geeksforgeeks.org/maths/types-of-sets/">Types Of Sets</a>

Mastering Types of Sets in Mathematics

For more details, please go through - <a href="https://www.geeksforgeeks.org/maths/subsets/">Subsets</a>

Understanding Subsets in Set Theory

For more details, please go through - <a href="https://www.geeksforgeeks.org/maths/cardinality-of-a-set/">Cardinality of a Set</a>

Understanding Cardinality of a Set

For more details, please go through - <a href="https://www.geeksforgeeks.org/maths/finite-sets/">Finite Sets</a>

Finite Sets

For more details, please go through - <a href="https://www.geeksforgeeks.org/python/python-ways-to-remove-duplicates-from-list/">Remove Duplicates from a List in Python</a>

Remove Duplicates from a List in Python

For more details, please go through - <a href="https://www.geeksforgeeks.org/python/iterate-over-a-list-in-python/">Iterate over a list in Python</a>

Iterate over a list in Python.

For more details, please go through - <a href="https://www.geeksforgeeks.org/python/command-line-arguments-in-python/">Command Line Arguments in Python</a>

Command Line Arguments in Python.

For more details, please go through : <a href="https://www.geeksforgeeks.org/python/counters-in-python-set-1/">Python Collections Counter</a>

Python Collections Counter

For more details, please go through - <a href="https://www.geeksforgeeks.org/python/enumerate-in-python/">Enumerate() in Python</a>

Enumerate() in Python

Automated trading with Python is an efficient way to analyze market data and make trading decisions. By using libraries like yfinance, Pandas, NumPy, and Matplotlib, traders can fetch historical stock data, calculate technical indicators such as Simple Moving Averages (SMA), and visualize stock trends. This method helps in creating a basic but effective trading strategy, where past stock prices and key calculations inform buying and selling decisions. Before deploying it in real trading, the strategy is tested using historical data to validate its effectiveness.The Python-based trading strategy focuses on analyzing price movements using SMA crossovers, where buy and sell signals are generated based on short-term and long-term trends. The approach simulates trades and calculates daily and cumulative returns to evaluate the performance of the strategy. Visualizing stock price movements, SMA lines, and cumulative returns allows traders to understand market behavior and assess the strategy's success in comparison to a buy-and-hold approach. This process helps build a foundation for automated trading systems that can work independently with minimal human intervention. For more details, please go through - <a href="https://www.geeksforgeeks.org/automated-trading-using-python/">Automated Trading using Python</a>

Automated Trading using Python

This video provides a comprehensive overview of the Support Vector Machine (SVM) algorithm, a powerful tool in machine learning. Gain a deep understanding of how SVM works, its principles, and its applications in classification and regression tasks.

Support Vector Regression Intuition

<h2>Generators in Python</h2>In this video, we will explore generators in Python. Generators provide a convenient way to implement iterators with a concise syntax, allowing you to create sequences of values on the fly. This tutorial is perfect for students, professionals, or anyone interested in enhancing their Python programming skills.<h3>Why Learn About Generators in Python?</h3>Understanding generators in Python helps to:<ul><li>Write more efficient and readable code.</li><li>Handle large datasets without consuming a lot of memory.</li><li>Improve your ability to work with sequences and iterative data processing.</li></ul><h3>Key Concepts</h3>1. Generators:<ul><li>Special types of iterators that allow you to iterate through a sequence of values. They are defined using functions and the yield statement.</li></ul>2. yield Statement:<ul><li>Unlike return, which exits a function and passes a value back to the caller, yield produces a value and suspends the function's state, allowing it to resume from where it left off.</li></ul>3. Memory Efficiency:<ul><li>Generators generate items one at a time and only when required, which is more memory-efficient than holding the entire sequence in memory.</li></ul><h3>Steps to Create and Use Generators in Python</h3>1. Define a Generator Function:<ul><li>Use the def keyword to define a function and use yield instead of return to generate values.</li></ul>2. Iterate Over Generator:<ul><li>Use a for loop or the next() function to retrieve values from the generator.</li></ul>3. Practical Applications:<ul><li>Use generators for processing large datasets, infinite sequences, and stream processing.</li></ul><h3>Practical Applications</h3>Large Datasets:<ul><li>Process large datasets efficiently without loading the entire dataset into memory.</li></ul>Infinite Sequences:<ul><li>Generate infinite sequences of values, such as numbers, where traditional lists would be impractical.</li></ul>Stream Processing:<ul><li>Handle real-time data streams effectively using generators.</li></ul><h2>Additional Resources</h2>For more detailed information and a comprehensive guide on generators in Python, check out the full article on GeeksforGeeks: <a href="https://www.geeksforgeeks.org/generators-in-python/">https://www.geeksforgeeks.org/generators-in-python/</a>. This article provides in-depth explanations, examples, and further readings to help you master this topic.By the end of this video, you’ll have a solid understanding of generators in Python, enhancing your ability to write efficient and readable code for iterative data processing.Read the full article for more details: <a href="https://www.geeksforgeeks.org/generators-in-python/">https://www.geeksforgeeks.org/generators-in-python/</a>.Thank you for watching!

Generators in Python

This Python Tkinter application demonstrates how to switch between multiple page frames. It creates three pages: StartPage, Page1, and Page2, each with buttons for navigation. The tkinterApp class initializes these frames and manages navigation using the show_frame function. Each page frame has buttons to switch between pages, making it ideal for multi-page GUI applications. This structure can be expanded for more complex projects with added features and functionality. For more details, check the full article <a href="https://www.geeksforgeeks.org/tkinter-application-to-switch-between-different-page-frames/">here</a>.

Tkinter Application to Switch Between Different Page Frames

In Python, an abstract class is a class that cannot be instantiated and serves as a blueprint for other classes. The abc module allows defining Abstract Base Classes (ABCs) and abstract methods that must be implemented by subclasses. Abstract methods are declared with the @abstractmethod decorator and do not contain an implementation. Subclasses are required to provide specific implementations for these abstract methods. This ensures consistency while allowing flexibility for specific behavior in subclasses. For more details, check the full article <a href="https://www.geeksforgeeks.org/abstract-classes-in-python/">here</a>.

Abstract Classes in Python

Implement a Movie Recommender System using Python and Pandas to suggest movies based on user preferences. Explore collaborative filtering, which analyzes user behavior and decisions, and content-based filtering, which recommends items based on discrete characteristics. This video provides steps to develop a basic recommendation system focusing on movie similarity. Download required files and learn to process a TSV file.&nbsp; For more detail information, read the full article <a href="https://www.geeksforgeeks.org/python-implementation-of-movie-recommender-system/">here</a>.

Python | Implementation of Movie Recommender System

Fine-tune the BERT model for sentiment analysis by adding custom neural layers while freezing pre-trained layers. This video covers loading datasets, tokenizing text, setting padding, and defining a classification architecture to classify sentences as positive or negative.&nbsp; For more detailed information, read the full article <a href="https://www.geeksforgeeks.org/fine-tuning-bert-model-for-sentiment-analysis/">here</a>.

Fine-tuning BERT model for Sentiment Analysis

Input: str = “PAYPALISHIRING”, N = 3 Output: PAHNAPLSIIGYIRInput: str = “ABCDEFGH”, N = 2 Output: ACEGBDFH Explanation: The input string can be written in Zig-Zag fashion in 2 rows as follows: A &nbsp; C &nbsp; &nbsp;E &nbsp; G &nbsp; &nbsp; &nbsp; B &nbsp; D &nbsp; F &nbsp; H Hence, upon reading the above pattern row-wise, the output string is “ACEGBDFH”Print Concatenation of Zig-Zag String in ‘n’ Rows : <a href="https://www.geeksforgeeks.org/concatenation-of-zig-zag-string-in-n-rows/">https://www.geeksforgeeks.org/concatenation-of-zig-zag-string-in-n-rows/</a>

Print Concatenation of Zig-Zag String in ‘n’ Rows

One obvious approach to solve this problem would be to sort the input string and then traverse through the sorted string to find the character which is occurring maximum number of times. Let us see if we can improve on this. So we will use a technique called ‘Hashing’. In this, when we traverse through the string, we would hash each character into an array of ASCII characters.&nbsp; &nbsp;Input string = “test” 1: Construct character count array from the input string. &nbsp;count['e'] = 1 &nbsp;count['s'] = 1 &nbsp;count['t'] = 22: Return the index of maximum value in count array (returns ‘t’).Return maximum occurring character in an input string: <a href="https://www.geeksforgeeks.org/return-maximum-occurring-character-in-the-input-string/">https://www.geeksforgeeks.org/return-maximum-occurring-character-in-the-input-string/</a>

Return maximum occurring character in an input string

A permutation also called an “arrangement number” or “order,” is a rearrangement of the elements of an ordered list S into a one-to-one correspondence with S itself. A string of length n has n! permutation.O(n*n!) Note that there are n! permutations and it requires O(n) time to print a permutation.Write a program to print all permutations of a given string: <a href="https://www.geeksforgeeks.org/write-a-c-program-to-print-all-permutations-of-a-given-string/">https://www.geeksforgeeks.org/write-a-c-program-to-print-all-permutations-of-a-given-string/</a>

Write a program to print all permutations of a given string

Given a text txt[0..n-1] and a pattern pat[0..m-1], write a function search(char pat[], char txt[]) that prints all occurrences of pat[] in txt[]. You may assume that n &gt; m.&nbsp; Examples:Input: &nbsp;txt[] = "THIS IS A TEST TEXT" &nbsp; &nbsp; &nbsp; &nbsp;pat[] = "TEST"Output: Pattern found at index 10Input: &nbsp;txt[] = &nbsp;"AABAACAADAABAABA" &nbsp; &nbsp; &nbsp; &nbsp;pat[] = &nbsp;"AABA"Output: Pattern found at index 0&nbsp; &nbsp; &nbsp; &nbsp;Pattern found at index 9 &nbsp; &nbsp; &nbsp; &nbsp;Pattern found at index 12Naive Algorithm for Pattern Searching:<a href="https://www.geeksforgeeks.org/naive-algorithm-for-pattern-searching/">https://www.geeksforgeeks.org/naive-algorithm-for-pattern-searching/</a>

Naive Algorithm for Pattern Searching

Given two strings where first string may contain wild card characters and second string is a normal string. Write a function that returns true if the two strings match. The following are allowed wild card characters in first string.* --&gt; Matches with 0 or more instances of any character or set of characters. ? --&gt; Matches with any one character. For example, “g*ks” matches with “geeks” match. And string “ge?ks*” matches with “geeksforgeeks” (note ‘*’ at the end of first string). But “g*k” doesn’t match with “gee” as character ‘k’ is not present in second string.String matching where one string contains wildcard characters: <a href="https://www.geeksforgeeks.org/wildcard-character-matching/">https://www.geeksforgeeks.org/wildcard-character-matching/</a>

String matching where one string contains wildcard characters

Given three strings A, B and C. Write a function that checks whether C is an interleaving of A and B. C is said to be interleaving A and B, if it contains all and only characters of A and B and order of all characters in individual strings is preserved.Example:Input: strings: "XXXXZY", "XXY", "XXZ" Output: XXXXZY is interleaved of XXY and XXZ The string XXXXZY can be made by&nbsp; interleaving XXY and XXZ String: &nbsp; &nbsp;XXXXZY String 1: &nbsp; &nbsp;XX Y String 2: &nbsp;XX &nbsp;Z Check whether a given string is an interleaving of two other given strings: <a href="https://www.geeksforgeeks.org/find-if-a-string-is-interleaved-of-two-other-strings-dp-33/">https://www.geeksforgeeks.org/find-if-a-string-is-interleaved-of-two-other-strings-dp-33/</a>

Check whether a given string is an interleaving of two other given strings

Given two strings in lowercase, the task is to make them anagram. The only allowed operation is to remove a character from any string. Find minimum number of characters to be deleted to make both the strings anagram?&nbsp; If two strings contains same data set in any order then strings are called Anagrams.Examples : &nbsp;Input : str1 = "bcadeh" str2 = "hea" Output: 3 We need to remove b, c and d from str1.Remove minimum number of characters so that two strings become anagram: <a href="https://www.geeksforgeeks.org/remove-minimum-number-characters-two-strings-become-anagram/">https://www.geeksforgeeks.org/remove-minimum-number-characters-two-strings-become-anagram/</a>

Remove minimum number of characters so that two strings become anagram

We are given a string. We are also given indexes of first and last characters in string. The task is to reverse the string without using any extra variable.Examples:Input &nbsp;: str = "abc" Output : str = "cba"Input : &nbsp;str = "GeeksforGeeks" Output : str = "skeeGrofskeeG"Reverse string without using any temporary variable: <a href="https://www.geeksforgeeks.org/reverse-string-without-using-any-temporary-variable/">https://www.geeksforgeeks.org/reverse-string-without-using-any-temporary-variable/</a>

Reverse string without using any temporary variable

Given a string s1 and a string s2, write a snippet to say whether s2 is a rotation of s1?&nbsp; (eg given s1 = ABCD and s2 = CDAB, return true, given s1 = ABCD, and s2 = ACBD , return false)Algorithm: areRotations(str1, str2)&nbsp; &nbsp;1. Create a temp string and store concatenation of str1 to &nbsp; &nbsp; &nbsp; str1 in temp. &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;temp = str1.str1 &nbsp; &nbsp;2. If str2 is a substring of temp then str1 and str2 are&nbsp; &nbsp; &nbsp; &nbsp; rotations of each other.&nbsp; &nbsp;Example: &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; str1 = "ABACD" &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; str2 = "CDABA"&nbsp; &nbsp; temp = str1.str1 = "ABACDABACD" &nbsp; &nbsp; Since str2 is a substring of temp, str1 and str2 are&nbsp; &nbsp; &nbsp; rotations of each other.A Program to check if strings are rotations of each other or not: <a href="https://www.geeksforgeeks.org/a-program-to-check-if-strings-are-rotations-of-each-other/">https://www.geeksforgeeks.org/a-program-to-check-if-strings-are-rotations-of-each-other/</a>

A Program to check if strings are rotations of each other or not

Simple solution: First method is to traverse sentence and one by one remove spaces by moving subsequent characters one position back and changing case of first character to capital. It takes O(n*n) time. Efficient solution : We traverse given string, while traversing we copy non space character to result and whenever we encounter space, we ignore it and change next letter to capital. Camel case of a given sentence :<a href=" https://www.geeksforgeeks.org/camel-case-given-sentence/"> https://www.geeksforgeeks.org/camel-case-given-sentence/</a>

Camel case of a given sentence

Given a string S, c1 and c2. Replace character c1 with c2 and c2 with c1. Examples: Input : grrksfoegrrks, c1 = e, c2 = r Output : geeksforgeeks Input : ratul, c1 = t, c2 = h Output : rahul Replace a character c1 with c2 and c2 with c1 in a string S : https://www.geeksforgeeks.org/replace-character-c1-c2-c2-c1-string-s/given a string S, c1 and c2. Replace character c1 with c2 and c2 with c1.&nbsp; Examples:&nbsp; &nbsp;Input : grrksfoegrrks, &nbsp; &nbsp; &nbsp; &nbsp;c1 = e, c2 = r&nbsp; Output : geeksforgeeksInput : ratul, &nbsp; &nbsp; &nbsp; &nbsp;c1 = t, c2 = h&nbsp; Output : rahul Replace a character c1 with c2 and c2 with c1 in a string S &nbsp;: <a href="https://www.geeksforgeeks.org/replace-character-c1-c2-c2-c1-string-s/">https://www.geeksforgeeks.org/replace-character-c1-c2-c2-c1-string-s/</a>

Replace a character c1 with c2 and c2 with c1 in a string S

Given an expression exp of length n consisting of some brackets. The task is to print the bracket numbers when the expression is being parsed. Examples :&nbsp; &nbsp;Input : (a+(b*c))+(d/e) Output : 1 2 2 1 3 3 The highlighted brackets in the given expression (a+(b*c))+(d/e) has been assigned the numbers as: 1 2 2 1 3 3.Input : ((())(())) Output : 1 2 3 3 2 4 5 5 4 1&nbsp;<ol><li>Define a variable left_bnum = 1.</li><li>Create a stack right_bnum.</li><li>Now, for i = 0 to n-1.<ol><li>If exp[i] == ‘(‘, then print left_bnum, push left_bnum on to the stack right_bnum and finally increment left_bnum by 1.</li><li>Else if exp[i] == ‘)’, then print the top element of the stack right_bnum and then pop the top element from the stack.</li></ol></li></ol> Print Bracket Number &nbsp;: <a href="https://www.geeksforgeeks.org/print-bracket-number/">https://www.geeksforgeeks.org/print-bracket-number/</a>

Print Bracket Number

In this video, we will be discussing why C++ is still one of the most used programming languages &amp; what are the top 8 reasons to learn C++ in 2022. Object-oriented, procedural, and generic programming are all supported by the general-purpose, case-sensitive, free-form programming language that is C++.&nbsp; Apart from that C++ has additional features&nbsp;like inheritance, classes, etc. Wherever performance matters the most, C++ is used because of its speed. C++ is used in Embedded system where hardware and software are corelated to eachother for a specific function/task. Top 8 Reasons to Learn C++ in 2022: <a href="https://www.geeksforgeeks.org/top-10-reasons-to-learn-c-plus-plus/">https://www.geeksforgeeks.org/top-10-reasons-to-learn-c-plus-plus/</a>

Top 8 Reasons to Learn C++ in 2022

In this video, we will be covering what are the 5 tips on how to get a job as a Java fresher plus 1 pro tip. Java, being one of the most robust, highly scalable, and versatile languages. It is used in building applications for small-scale as well as large-scale industries.&nbsp; Having these advantages, there’s no doubt that Java developer jobs are popular and very much demanding. But before getting into this field, you must understand some pro tips that you as a developer should follow to get a job.&nbsp; 5 Tips to get a job as a Java fresher: <a href="https://www.geeksforgeeks.org/5-tips-to-get-a-job-as-a-java-fresher/">https://www.geeksforgeeks.org/5-tips-to-get-a-job-as-a-java-fresher/</a>

5 Tips to Get Job as a Java Fresher

In this video we will see previous year Accenture Coding questions with solutions in detail. Accenture plc is an Ireland-based multinational professional services company that specializes in IT services and consulting.

Recently Accenture has upgraded the selection procedure. They included a new section “Coding Section”. Apart from that there are two more sections: 
1) Technical Assessment
2) Cognitive Assessment.

A coding section is a compulsory section in the hiring process. Basically, coding section will have a total number of two or three questions, and the time limit is 45 minutes for completion.

You can create a code in any of the programming languages:
1) C
2) C++
3) Python
4) Java

Candidate can select a language in which they are comfortable to solve and write codes for the assigned problems. The purpose of these coding questions to check a knowledge in a particular programming language.

Accenture Previous Year Coding Questions & Answers

PseudoCode is a flexible representation of an algorithm or code independent of language and they can be related to languages through logic and normal English words. In rounds of pseudocode, you will be given some sort of code that would be relatable and you have to sometimes predict the output or run the code according to the requirements question demands.This contains some questions as an illustration, of what kind of questions are asked in that. And how you should approach those questions as you have to be really crisp in terms of time, where to use that when you are attempting it. By this, you would get an idea regarding what question requires what concept and in what manner we have to attend it so that you should have a clear idea regarding questions and should be able to manage and solve them in the Exam.Infosys has many profiles and those profiles mostly require problem-solving and that would come from understanding and applying concepts regarding Data Structures. There are some topics that are being covered here with explanations and a dry run of each question.Questions include concepts like bitwise and logical operators and questions regarding them including for loops, conditional statements, xor operators in respect or combination with each other. For eg: if you are solving a question of loops, that would be simple and a dry run would make you calculate the output with the involvement of some 3 to 4 variables. There would be a combination like the conditionals with operators and loops that would require a strong dry run technique and how to not get lost while making it.It also contains function calling and some recursion related topics with passing arguments in functions that will be calling themselves and the base case is there. Here we have conditions like if-else where you will understand it if you dry run by yourself.Some basic questions regarding linked list structure and the form in which it exists in data structures are also covered.Related article: <a href="https://www.geeksforgeeks.org/prepare-infosys-complete-guide/">https://www.geeksforgeeks.org/prepare-infosys-complete-guide/</a>

Infosys Pseudo Code Questions | Tips & Tricks to Solve

In this video, we have covered what is the placement process for Accenture is like &amp; how many rounds does an aspirant needs to crack in order to get placed in Accenture.&nbsp;There will be a total of 4 rounds.&nbsp;1) Cognitive and Technical Assessment - 90 minutes In this, you have to answer some MCQs based on basic mathematics reasoning and logical ability like: Numerical Ability - It involves some maths of basic level. Logical Reasoning- It includes reasoning questions like blood relations, directions, etc. English Ability- It includes basic grammar like active and passive voice, tenses, etc. Pseudo Code - Basically in this, you have to find values of variables or output in pseudocode. MS Office - It involves some basic computer-based questions. Networking - It includes network-based questions of basic level like what is LAN, WAN, MAN, etc.&nbsp;2) Coding Round - There will be 2 questions, one would be easy and one would be medium level, you have to pass all the test cases of the easy one at least and above it to get shortlisted. You can choose any language from these i.e. C/C++/Java/Python.&nbsp;3) Communication Test - Here they will assess your skills like listening, speaking, or see if you can covey your thought with someone in front of you. You should practice well if you are not good in terms of communication. The test would contain questions about pronunciation, fluency, sentence completion, and vocabulary. It would be of 20 minutes.&nbsp;4) Interview - In this, they will ask you general questions like tell me something about yourself, what you know about our company, are you aware of what we do, etc.&nbsp;Watch the complete detail to know more details regarding what happens in the Accenture placement rounds &amp; how to prepare for it.Related article:&nbsp; <a href="https://www.geeksforgeeks.org/accenture-recruitment-process/ ">https://www.geeksforgeeks.org/accenture-recruitment-process/&nbsp;</a><a href="https://www.geeksforgeeks.org/tag/accenture/">https://www.geeksforgeeks.org/tag/accenture/</a>

How to Prepare for Accenture Placement Drive

'How to get a paid internship...??' - one of the most common concerns of college students. Undeniably, securing a good Internship opportunity in college definitely boosts your confidence, allows you to showcase &amp; expand your skills in the professional work environment, and paves the way for you towards your professional career goals. With similar concern, in this video, we're going to discuss some of the most effective ways that will surely help you to get a suitable and paid internship during your college tenure.How To Get Paid Internship in College : <a href="https://www.geeksforgeeks.org/how-to-find-an-internship-as-a-college-student/">https://www.geeksforgeeks.org/how-to-find-an-internship-as-a-college-student/</a>