Skip to content
tejsumeru-logo

Tejsumeru

Thoughts Become Reality
  • Home
  • Tutorials
    • Java
    • C language
    • Python
      • SciPy
    • C++ Language
    • PHP
    • Data Structure
    • Kotlin
    • Go Lang
  • Interview Quetions
  • About Us
tejsumeru-logo

Tejsumeru

Thoughts Become Reality
  • Home
  • Tutorials
    • Java
    • C language
    • Python
      • SciPy
    • C++ Language
    • PHP
    • Data Structure
    • Kotlin
    • Go Lang
  • Interview Quetions
  • About Us

HackerRank Solution – Problem Solving – Game of Two Stacks

  • tejsumeru.12@gmail.com tejsumeru.12@gmail.com
  • Java, Tutorials

Alexa has two stacks of non-negative integers, stack a[n] and stack b[m] where index 0 denotes the top of the stack. Alexa challenges Nick to play the following game: In each move, Nick can remove one integer from the top of either stack a or stack b. Nick keeps a running sum of the… Read More »HackerRank Solution – Problem Solving – Game of Two Stacks

HackerRank Solution – Problem Solving – Equal Stacks

  • tejsumeru.12@gmail.com tejsumeru.12@gmail.com
  • Java, Tutorials

You have three stacks of cylinders where each cylinder has the same diameter, but they may vary in height. You can change the height of a stack by removing and discarding its topmost cylinder any number of times. This problem is given by Hacker Rank… Read More »HackerRank Solution – Problem Solving – Equal Stacks

HackerRank Solution – Problem Solving – Balanced Brackets

  • tejsumeru.12@gmail.com tejsumeru.12@gmail.com
  • Java, Tutorials

A bracket is considered to be any one of the following characters: (, ), {, }, [, or ]. The coding problem is defined in Hacker Rank platform. The problem can expand your Data Structure knowledge, as well as can helps you to crack Interviews. Two brackets are considered to be… Read More »HackerRank Solution – Problem Solving – Balanced Brackets

HackerRank Solution – Problem Solving – Maximum Element

  • tejsumeru.12@gmail.com tejsumeru.12@gmail.com
  • Java, Tutorials

In this post we will solve the Maximum Element Problem give by Hacker Rank. It will give you insight to solve any Data Structure Problem. You have an empty sequence, and you will be given N queries. Each query is one of these three types: Function Description… Read More »HackerRank Solution – Problem Solving – Maximum Element

Recent Post

  • Step-by-Step Guide to Installing and Configuring Java SpringBoot
  • Setting up SpringBoot for Java Development: Tips, Tricks, and Best Practices
  • Integrating ChatGPT API into Your Android App: A Guide to Building Cutting-Edge Chatbots
  • What is Android Jetpack Compose: An Introduction to Google’s UI Toolkit
  • Efficient Java Microservices with Quarkus: A Guide to Setting Up the Framework




Copyright © 2018 Tejsumeru