Java: Count the frequency of an element in an Array
00:20:00
This course is designed to provide a comprehensive, practical understanding of Data Structures and Algorithms, foundational pillars of computer science and essential tools for efficient problem-solving and software development. Through hands-on labs, participants will learn to implement, analyze, and optimize various data structures and algorithms, focusing on best practices and real-world applications.
Key Highlights of Getting Started with Data Structure and Algorithms Hands-on Learning
Key Objectives of Getting Started with Data Structure and Algorithms Hands-on Learning
By the end of this course, participants will be able to:
Who should take the Getting Started with Data Structure and Algorithms Hands-on Learning?
Pre-requisites for Getting Started with Data Structure and Algorithms Hands-on Learning
Want to learn a Data Structure and Algorithms? Refer to this link: Data Structure and Algorithms Course
Java: Count the frequency of an element in an Array
00:20:00
Java: Ceiling in a Sorted Array
00:25:00
Java: Construct a linked list from 2D matrix
00:30:00
Java: Reverse a Stack using Recursion
00:25:00
Java: Check whether a Binary Tree is BST or Not
00:30:00
Java: Two Sum
00:30:00
Java: Two Sum
00:30:00
Java: Deletion in a Binary Tree
00:40:00
Java: Find next right node of a given key
00:30:00
Java: Big-O-Binary Search Algorithm
00:15:00
Java: Traversing directory in Java using BFS
00:20:00
Java: Check if two nodes are cousins in a Binary Tree
00:50:00
Java: Contains Duplicate
00:20:00
Java: Merge Sorted Arrays
00:25:00
Java: Check whether the two Binary Search Trees are Identical or Not
00:35:00
Java: Delete consecutive same words in a sequence
00:25:00
Java: Convert given Binary Tree to Doubly Linked List in Linear Time
00:25:00
Java: Count 1’s in a Sorted Binary Array
00:20:00
Java: Find all triplets with zero sum
00:20:00
Java: Leaders in an array
00:20:00
Java: Find a Fixed Point (Value equal to Index) in given Array
00:25:00
Java: Count Nodes in Circular Linked List
00:25:00
Java: Sort a Stack using another stack
00:30:00
Java: Find the Closest Element in Binary Search Tree
00:35:00
Java: Search Insert Position
00:25:00
Java: Longest Substring without Repeating Characters
00:30:00
Java: Convert Binary Tree to Doubly Linked List
00:50:00
Java: Minimum time required to rot all oranges
00:40:00
Java: Height of a Generic Tree from Parent Array
00:50:00
Java: Group Anagrams
00:35:00
Java: First Bad Version
00:30:00
Java: Insertion in a Binary Tree in Level Order
00:35:00
Java: Next Greater Element
00:30:00
Java: Delete all Prime Nodes from a Doubly Linked List
00:35:00
Java: Search an Element in a Sorted and Rotated Array
00:30:00
Java: Meeting Rooms
00:25:00
Java: Merge Two Sorted Arrays
00:20:00
Java: Two Elements whose Sum is Closest to Zero
00:30:00
Java: Deletion from a Circular Linked List
00:35:00
Java: Trapping rain water
00:30:00
Java: Find right Sibling of a binary tree with parent pointers
00:40:00
Java: Find Peak Element
00:30:00
Java: Valid Sudoku
00:40:00
Java: Find Distance between two nodes of a Binary Tree
00:50:00
Java: Binary Tree to Binary Search Tree Conversion
00:40:00
Java: Subarray Sum Equals K
00:25:00
Java: Search in Rotated Sorted Array
00:25:00
Java: Largest rectangle in histogram
00:25:00
Java: Remove Duplicates from a sorted Linked List
00:25:00
Java: Search in an Almost Sorted Array
00:25:00
Java: Minimum Number of Jumps to Reach End in Array
00:25:00
Java: Move all Zeros to the beginning of an array
00:25:00
Java: Median of Two Sorted Arrays of Different Sizes
00:30:00
Java: Reverse a Doubly Linked List
00:20:00
Java: 3 Sum
00:25:00
Java: Minimum Window Substring
00:30:00
Java: Design HashSet
00:25:00
Java: Search a 2D Matrix
00:20:00
Java: Traversal of Circular Linked List
00:25:00
Java: A Pair with a Given Sum in the Rotated Sorted Array
00:25:00
Java: Remove Duplicates from an Array
00:20:00
Java: Rotate a Matrix by 90 degrees
00:25:00
Java: Sort Elements by Frequency
00:30:00
Java: Find Minimum in Rotated Sorted Array
00:25:00
Java: Find Minimum in Rotated Sorted Array II
00:35:00
Java: Sort a Linked List of 0s, 1s and 2s
00:35:00
Java: Rotate an Array to the left
00:20:00
Java: Camel Case of a given Sentence
00:20:00
Java: Find Missing Elements of a Range
00:25:00
Java: Sort a Nearly Sorted (or K sorted) Array
00:20:00
Java: Count ways to increase LCS length of two Strings by one
00:25:00
Java: Minimum rotations required to get the same string
00:15:00
Java: Chocolate Distribution Problem
00:30:00
Java: Minimum Swaps required to convert binary tree to binary search tree
00:30:00
Java: Multiply Large Numbers represented as Strings
00:25:00
Java: Find Itinerary from a given list of tickets
00:25:00
Java: Count Distinct Occurrences as a Subsequence
00:30:00
Java: Sort a Matrix in all way Increasing Order
00:20:00
Java: Find the length of the largest subarray with 0 Sum
00:25:00
Java: Longest Increasing Consecutive Subsequence
00:25:00
Java: Find Whether an Array is a Subset of Another Array
00:20:00
It was one of the best learning experiences I had, at ScholarHat, right from counselling to completion of the course. Counselling: ScholarHat have counsellors with appropriate updated industrial knowledge, which helps to identify the need of professionals. Training: The training provided is completely based on industrial projects and practical ways of finding solutions & code optimization. The classes are very interactive and expand our knowledge. The provisions provided for practising listening exercises are very good and helpful. Environment: Overall the environment in the Academy is very friendly and the best thing about this place is that anytime we can go and clear our doubts. "Overall I am very much happy and recommend others to join for ScholarHat!!
The trainer is approachable, well-experienced, and always interested in explaining things. It was a nice experience learning complex architecture. It is excellent. We even suggested many people in our organization to go for different courses in ScholarHat.The trainer has a good real-time experience. Hence the examples are very practical and interesting.
This is one of the most brilliant institute for people wishing to make a carrier in Microsoft Technologies. I had heard a lot of good reviews from my friends as well. The angular course content is brilliant and you get hands on experience. I would recommend this all people looking for a good carrier in IT.
I love the learning platform offered by Scholarhat. The learning content is well simplified and is very easy to follow, Their 24/7 course availability and chat support help to resolve your technical queries on the fly. I am an existing customer and I have already enrolled. I would recommend this angular course to anyone who wants to hone their technical skills and want to take next big leap in their career. Happy Learning.
Online Self Paced Courses are designed for self-directed training, allowing participants to begin at their convenience with structured training and review exercises to reinforce learning. You'll learn through videos, PPTs, and Assignments designed to enhance learning outcomes, all at times that are most convenient for you.
All our mentors are highly qualified and experience professionals. All have at least 8-10 yrs of development experience in various technologies and are trained by Dot Net Tricks to deliver interactive training to the participants.
As soon as you enroll in the course, you will get access to the course content through LMS (The Learning Management System) in the form of a complete set of Videos, PPTs, PDFs, and Assignments. You can start learning right away.
You can enroll in the course by doing payment. Payment can be made using any of the following options.
Yes, Dot Net Tricks provides student discount to learners who cannot afford the fee. Email us from your student account, or attach your student ID.
In short, no. Check our licensing that you agree to by using Dot Net Tricks LMS. We track this stuff, any abuse of copyright is taken seriously. Thanks for your understanding on this one.
Please drop us an email with a list of user details like name, email you’d like to enroll and have access, we'll create your team accounts.
Yes, we do. As the technology upgrades your content gets updated at no cost.
You can give us a CALL at +91 113 303 4100 OR email us at enquiry@dotnettricks.com
We do. Once you've finished a course, reach out to us.