Shubham-Manjhi's repositories
Java-Homework-Projects
Course Description JAVA HOMEWORK PROJECTS teaches Java programming concepts while providing detailed step-by-step instructions in building many fun and useful projects. JAVA HOMEWORK PROJECTS explains (in simple, easy-to-follow terms) how to build a Java GUI project. Students learn about project design, the Java Swing controls, many elements of the Java, and how to debug and distribute finished projects. The projects built include: • Dual-Mode Stopwatch - Allows you to time tasks you may be doing. • Consumer Loan Assistant - Helps you see just how much those credit cards are costing you. • Flash Card Math Quiz - Lets you practice basic addition, subtraction, multiplication and division skills. • Multiple Choice Exam - Quizzes a user on matching pairs of items, like countries/capitals, words/meanings, books/authors. • Blackjack Card Game - Play the classic casino card game against the computer. • Weight Monitor - Track your weight each day and monitor your progress toward established goals. • Home Inventory Manager - Helps you keep track of all your belongings - even includes photographs. • Snowball Toss Game - Lets you throw snowballs at another player or against the computer - has varying difficulties. The product includes over 850 pages of self-study notes, all Java source code and all needed graphics and sound files.
All-Possible-Permutation-of-String
Question 1. ) Write a program to generate all possible combinations of the word "History". For example, if I give input as CAT then the answer would be CAT, CTA, ACT, ATC, TAC, TCA.
Android-APP-Developer-Basic-Project-s
Making APPs
Coding-Problems
Every Days 5 Challenge to Life Real World Problems With Solution
Data-Structure-And-Algorithms
Data Structure And Algorithms Practice
Heap_Chapter_7
Heap Java Code
Java_Basics_To_Advanced
Tutorials
Jumble-Words-generator
Jumble Words generator : Write a program that takes string as input and generates all possible valid words (min 3 characters) as per dictionary provided.
Programming-The-Permutation_LeetCode_Solution_in_O-N-
By now, you are given a secret signature consisting of character 'D' and 'I'. 'D' represents a decreasing relationship between two numbers, 'I' represents an increasing relationship between two numbers. And our secret signature was constructed by a special integer array, which contains uniquely all the different number from 1 to n (n is the length of the secret signature plus 1). For example, the secret signature "DI" can be constructed by array [2,1,3] or [3,1,2], but won't be constructed by array [3,2,4] or [2,1,3,4], which are both illegal constructing special string that can't represent the "DI" secret signature. On the other hand, now your job is to find the lexicographically smallest permutation of [1, 2, ... n] could refer to the given secret signature in the input.
Python
All Python Tutorials
Resume-Builder-AI
Resume Builder Using ChatGPT 4
Rotate-Image-Array_2D-By-90-Degree-LeetCode-Solution
You are given an n x n 2D matrix representing an image, rotate the image by 90 degrees (clockwise). You have to rotate the image in-place, which means you have to modify the input 2D matrix directly. DO NOT allocate another 2D matrix and do the rotation.
Spirally-traversing-a-matrix-LeetCode-Solution
iven a matrix of size r*c. Traverse the matrix in spiral form. Example 1: Input: r = 4, c = 4 matrix[][] = {{1, 2, 3, 4}, {5, 6, 7, 8}, {9, 10, 11, 12}, {13, 14, 15,16}} Output: 1 2 3 4 8 12 16 15 14 13 9 5 6 7 11 10 Explanation: Example 2: Input: r = 3, c = 4 matrix[][] = {{1, 2, 3, 4}, {5, 6, 7, 8}, {9, 10, 11, 12}} Output: 1 2 3 4 8 12 11 10 9 5 6 7 Explanation: Applying same technique as shown above, output for the 2nd testcase will be 1 2 3 4 8 12 11 10 9 5 6 7. Your Task: You dont need to read input or print anything. Complete the function spirallyTraverse() that takes matrix, r and c as input parameters and returns a list of integers denoting the spiral traversal of matrix. Expected Time Complexity: O(r*c) Expected Auxiliary Space: O(r*c), for returning the answer only. Constraints: 1 <= r, c <= 100 0 <= matrixi <= 100
Spring-Boot-Learning-RoadMap
Learn Spring Boot From Scratch To Advanced
Without-Recursion-PostOrder-Traversal-of-Tree
Question : Write a code to print post-order traversal of a tree without Using recursion.