KO | EN

GitLite

Minimalist Open Source Repository Search Engine

gitlite — search

#dsh #dsh-plugin #typescript #developer-tools #claude-code #ai-agent #codex #deepseek-harness #ai-agents #cli #react #mcp

Programming-with-Java

★ 52 Open GitHub ↗

300+ Coding Questions on All Important Topics (asked by Top Companies) || Complete Java Language.

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

# Complete Java Language with Data Structures & Algorithms

`300+ Coding Questions on All Important Topics (asked by Top Companies)`

> > ALL TOPICS COVERED

- [x] **Variables & Data types**
  > > > `Taking our first step into programming by learning concepts like Input, Output, Variables & Data Types in Java.`
- [x] **Operators**
  > > > `Operators are an integral part of Java and we will be using them in almost all of our codes.`
- [x] **Conditional statements**
  > > > `Not everything in life is unconditional like a mother's love. We only pass an exam after scoring 33, classes only happen during day time. Conditional Statements teach us how to convert this logic into code`
- [x] **Loops**
  > > > `We have to do some things again & again & again & again.. How to repeat work in code with minimum lines of code.`
- [x] **Patterns**
  > > > `This is Patterns. We will build some beautiful patterns using nested loops. In this section we are going to learn about more advanced patterns.`
- [x] **Functions & Methods**
  > > > `Functions are a group of reusable code that can be called from anywhere in the program.`
- [x] **Arrays**
  > > > `We will learn about our first Data Structure - Array.`
- [x] **Sorting Algorithms**
  > > > `Sorting is arranging things in a defined order. Here, we will learn some techniques to do so in Java.`
- [x] **2D Arrays**
  > > > `In this section, we will study about 2D Arrays.`
- [x] **String**
  > > > `In this Section, we will study about Strings.`
- [x] **Bit Manipulation**
  > > > `In this section, we will dive into the world of 0s & 1s.`
- [x] **Object Oriented Programming**
  > > > `In this section, we will learn about Object Orientation. Most of the concepts that we will learn here not only apply to Java but also apply to multiple other languages like C++.`
- [x] **Recursion**
  > > > `Recursion is a method of solving a problem where the solution depends on solutions to smaller instances of the same problem. Sounds complicated? No worries, we have made it simple for you.`
- [x] **Divide & Conquer**
  > > > `Divide a problem into smaller sub-problems. Now, conquer it by assembling the smaller bits. It's as simple as that.`
- [x] **Back Tracking**
  > > > `A technique where you try to find every possible solution to a problem using Recursion.`
- [x] **ArrayLists**
  > > > `ArrayLists are like arrays, but more dynamic.`
- [x] **Linked List**
  > > > `Linked list is a linear collection of data elements whose order is not given by their physical placement in memory. Note - Practice Questions for Linked Lists will be provided at the end of Linked Lists.`
- [x] **Stacks**
  > > > `In this section, we will study about stacks that work on the simple principle of Push & Pop.`
- [x] **Queues**
  > > > `Queues are a collection of elements in a sequence, working on a simple principle First In First Out (FIFO).`
- [x] **Greed Algorithms**
  > > > `The approach of solving a problem by selecting the best available option at the moment.`
- [x] **Binary Trees**
  > > > `A binary tree is a tree data structure in which each node has at most two children. Note - The assignment of Binary Trees will be available in the last part of Binary Trees.`
- [x] **Binary Search Trees**
  > > > `A Binary Search Tree is a rooted binary tree data structure with the key of each internal node being greater than all the keys in the respective node's left subtree and less than the ones in its right subtree.`
- [x] Heaps
  > > > `A Heap is a special tree-based data structure in which the tree is a complete binary tree.`
- [x] Hashing
  > > > `In this section, we are going to cover Hashing, HashSets & HashMaps.`
- [x] Tries
  > > > `In this section, we will study about Tries.`
- [x] Graphs
  > > > `Graphs are easier than they seem. Note - Practice Qs of Graphs will be given with the last part`
- [ ] Dynamic Programming
  > > > `Note - The Practice Qs & Solutions will be provided in the last part.`
- [ ] Segment Trees
  > > > `Segment Tree is a tree data structure used for storing information about intervals, or segments.`

Programming-with-Java

Explore Similar Repositories

Was this content helpful?

Recent Feedback

Download README