JobsJob TrackerJob alerts

Fiorano ยท 13 questions

All 13Coding 10System Design 1Low-Level Design 1
  • Next Greater ElementCoding
  • Reverse Linked List in groups of KCoding
  • Database Redundancy and StorageLow-Level Design
  • Rotten OrangesCoding
  • Roman Numeral to IntegerCoding
  • Aptitude, DSA, and C/Java MCQs
  • Print string without semicolonCoding
  • Array Manipulation ProblemsCoding
  • Advanced DSA ProblemsCoding
  • Advanced DSA and C ConceptsCoding
  • Design a Library Management SystemSystem Design
  • 100 Doors PuzzleCoding
  • Count ways to reach nth stairCoding
โ† Fiorano questions
  1. Interview questions
  2. Fiorano
  3. Advanced DSA and C Concepts
Coding

Advanced DSA and C Concepts

Filed under Fiorano

The question

Find non-min/max element in <O(n), explain malloc/calloc, mirror node in 3-pointer tree, check palindrome linked list, and bipartite graph.

No write-up yet. Related questions below have one.

Related Fiorano questions

  • Roman Numeral to Integer
  • Print string without semicolon
  • Advanced DSA Problems
โ† Advanced DSA ProblemsDesign a Library Management System โ†’

Collected from public candidate posts and coding forums. Updated Nov 2026.