Questions

• ques1.java

  • Check if an array has duplicates.

• ques2.java

  • Check whether two strings are anagrams of each other.

• ques3.java

  • Solve the Two Sum problem.

• ques4.java

  • Implement a stack that supports push, pop, top, and retrieving the minimum element in constant time.

• ques5.java

  • Compute the product of an array except for the current element.

• ques6.java

  • Check if a binary tree is balanced.

• ques7.java

  • Determine if two binary trees are identical.

• ques8.java

  • Find the maximum depth of a binary tree.

• ques9.java

  • Invert a binary tree.

• ques10.java

  • Solve the Buy and Sell Crypto problem.

• ques11.java

  • Valid Parentheses

• ques12.java

  • Number of One Bits

• ques13.java

  • Reverse Bits

• ques14.java

  • Odd and even positioned linked list nodes

• ques15.java

  • Deleting the particular value from the linkedlist

• ques16.java

  • First and last occurance of a particular element in a String using Recursion

• ques17.java

  • Reverse the String using recursion

• ques18.java

  • Generate Parentheses

• ques19.java

  • Generate Possible ways to reach the end point of a matrix

• ques20.java

  • Tower of Hanoi

• ques21.java

  • is the array sorted in increasing oder (Strictly) using recursion

• ques22.java

  • Move all x at the end of the string using recusrion

• ques23.java

  • Remove duplicates from a string using recursion

• ques24.java

  • Subsequence of a String using recursion

• ques25.java

  • Preorder / Inorder / Postorder traversal of a binary tree

• ques26.java

  • Check if Two Chessboard Squares Have the Same Color

• ques27.java

  • Prefix sum problem