Pinned Repositories
-Doubly-Linked-List-Tail-Insert-
Given a doubly linked list of size n, you need to insert an element data after the tail.
-Implement-Dequeue-Using-Linked-List-
You are given a dequeue and q queries. The queries can be of 4 types: ir x: Use insertRear to insert data x in dequeue. if x: Use insertFront to insert data x in dequeue. df: Use deleteFront to delete the front of dequeue. If dequeue is empty then don't do anything. dr: Use deleteRear to delete the rear of dequeue. If dequeue is empty then don't do anything. Example 1: Input: q = 4, queries[] = {(ir, 5), (if, 7), (df), (if, 22)} Output: 22 5 Explanation: Here q = 4. First we insert 5 at the back. Now we insert 7 in the front. The dequeue is now {7, 5}. Now we remove the front, so dequeue is now {5}. Now, we insert 22 in the front. The dequeue is now {22, 5}. So the front is 22 and the rear is 5. Example 2: Input: q = 1, queries[] = {(ir, 8)} Output: 8 Explanation: Insert 8 in back, so front and rear elements are same, which is 8.
abinishae.-github.-io
abinishae.github.io
WEB-DEV BOOTCAMP SHAPEAI
Add-1-to-a-number-represented-as-linked-list
Binary-Heap-Operations-
https://practice.geeksforgeeks.org/problems/operations-on-binary-min-heap/1/?track=DSA-Foundation-Heap&batchId=238#
Binary-Tree-to-CDLL-
https://practice.geeksforgeeks.org/problems/binary-tree-to-cdll/0/?track=P100-Tree&batchId=238#
Binary-Tree-to-DLL
https://practice.geeksforgeeks.org/problems/binary-tree-to-dll/1/?track=P100-Tree&batchId=238#
can-make-a-triangle
Given an array All of N elements, You'd like to know how many triangles can be formed with side lengths equal to adjacent elements from A[]. Construct an array of integers of length N-2 where ith element is equal to 1 if it is possible to form a triangle with side lengths A[i], A[i+1], and A[i+2] otherwise 0 Note: A triangle can be formed with side lengths a, b and c if a+b>c and a+c>b and b+c>a.
Dijkstra-s-algorithm-using-adjacent-matrix-graph
This program is implementation of Dijkstra's algorithm using adjacent matrix graph .
abinishae's Repositories
abinishae/Binary-Heap-Operations-
https://practice.geeksforgeeks.org/problems/operations-on-binary-min-heap/1/?track=DSA-Foundation-Heap&batchId=238#
abinishae/Binary-Tree-to-CDLL-
https://practice.geeksforgeeks.org/problems/binary-tree-to-cdll/0/?track=P100-Tree&batchId=238#
abinishae/Binary-Tree-to-DLL
https://practice.geeksforgeeks.org/problems/binary-tree-to-dll/1/?track=P100-Tree&batchId=238#
abinishae/Dijkstra-s-algorithm-using-adjacent-matrix-graph
This program is implementation of Dijkstra's algorithm using adjacent matrix graph .
abinishae/Ceil-in-BST-
https://practice.geeksforgeeks.org/problems/implementing-ceil-in-bst/0/?track=DSA-Foundation-BST&batchId=238#
abinishae/Check-for-Balanced-Tree-
https://practice.geeksforgeeks.org/problems/check-for-balanced-tree/1/?track=P100-Tree&batchId=238#
abinishae/Check-for-BST-
https://practice.geeksforgeeks.org/problems/check-for-bst/1/?track=P100-Binary%20Search%20Tree&batchId=238#
abinishae/Count-Number-of-SubTrees-having-given-Sum
https://practice.geeksforgeeks.org/problems/count-number-of-subtrees-having-given-sum/1/?track=P100-Tree&batchId=238#
abinishae/Count-Odd-Even---Java
https://practice.geeksforgeeks.org/problems/count-odd-even-java/1/?track=placement100-java&batchId=238
abinishae/Data-Types---Java-
https://practice.geeksforgeeks.org/problems/data-types-java/1/?track=placement100-java&batchId=238#
abinishae/Diameter-of-a-Binary-Tree
https://practice.geeksforgeeks.org/problems/diameter-of-binary-tree/1/?track=P100-Tree&batchId=238#
abinishae/Find-missing-in-second-array
https://practice.geeksforgeeks.org/problems/in-first-but-second5423/1/?page=1&difficulty[]=0&difficulty[]=1&status[]=unsolved&company[]=Zoho&category[]=Arrays&sortBy=submissions#
abinishae/Floor-in-BST-
https://practice.geeksforgeeks.org/problems/implementing-floor-in-bst/1/?track=DSA-Foundation-BST&batchId=238
abinishae/Heap-Sort
https://practice.geeksforgeeks.org/problems/heap-sort/1/?track=P100-Heap&batchId=238#
abinishae/Insert-node-in-BST-
https://practice.geeksforgeeks.org/problems/insert-a-node-in-a-bst/0/?track=DSA-Foundation-BST&batchId=238#
abinishae/K-largest-elements-
https://practice.geeksforgeeks.org/problems/k-largest-elements3736/1/?track=P100-Heap&batchId=238#
abinishae/Learn-to-Comment---Java-
https://practice.geeksforgeeks.org/problems/learn-to-comment-java/1/?track=placement100-java&batchId=238#
abinishae/leetcode-buy-and-sell-stock
You are given an array prices where prices[i] is the price of a given stock on the ith day. You want to maximize your profit by choosing a single day to buy one stock and choosing a different day in the future to sell that stock. Return the maximum profit you can achieve from this transaction. If you cannot achieve any profit, return 0. Example 1: Input: prices = [7,1,5,3,6,4] Output: 5 Explanation: Buy on day 2 (price = 1) and sell on day 5 (price = 6), profit = 6-1 = 5. Note that buying on day 2 and selling on day 1 is not allowed because you must buy before you sell. Example 2: Input: prices = [7,6,4,3,1] Output: 0 Explanation: In this case, no transactions are done and the max profit = 0.
abinishae/Levelorder-in-BST
https://practice.geeksforgeeks.org/problems/levelorder-in-bst/0/?track=DSA-Foundation-BST&batchId=238#
abinishae/Lowest-Common-Ancestor-in-a-BST
https://practice.geeksforgeeks.org/problems/lowest-common-ancestor-in-a-bst/1/?track=P100-Binary%20Search%20Tree&batchId=238#
abinishae/mini-X-O-tik--tak-toe-game
Xs and Os is a paper-and-pencil game for two players who take turns marking the spaces in a three-by-three grid with X or O. The player who succeeds in placing three of their marks in a horizontal, vertical, or diagonal row is the winner.
abinishae/Print-BST-elements-in-given-range-
https://practice.geeksforgeeks.org/problems/print-bst-elements-in-given-range/0/?track=P100-Binary%20Search%20Tree&batchId=238#
abinishae/sample
abinishae/Search-a-node-in-BST-
https://practice.geeksforgeeks.org/problems/search-a-node-in-bst/1/?track=DSA-Foundation-BST&batchId=238#
abinishae/Start-Coding---Java-
https://practice.geeksforgeeks.org/problems/start-coding-java/1/?track=placement100-java&batchId=238
abinishae/Taking-input---Java-
https://practice.geeksforgeeks.org/problems/taking-input-java/1/?track=placement100-java&batchId=238#
abinishae/The-New-Line---Java-
https://practice.geeksforgeeks.org/problems/the-new-line-java/1/?track=placement100-java&batchId=238#
abinishae/Tree-from-Postorder-and-Inorder-
https://practice.geeksforgeeks.org/problems/tree-from-postorder-and-inorder/1/?track=P100-Tree&batchId=238
abinishae/zarray-sort-and-remove-duplicates
In this we are gonna sort the array and remove the dupilicates
abinishae/zstring-is-palindrome-or-not-jumbled-letters-
To find whether the jumbled letter could form a palindrome or not