• Skip to primary navigation
  • Skip to content
  • Skip to primary sidebar
  • Skip to secondary sidebar

GoHired

Interview Questions asked in Google, Microsoft, Amazon

Join WeekEnd Online Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

  • Home
  • Best Java Books
  • Algorithm
  • Internship
  • Certificates
  • About Us
  • Contact Us
  • Privacy Policy
  • Array
  • Stack
  • Queue
  • LinkedList
  • DP
  • Strings
  • Tree
  • Mathametical
  • Puzzles
  • Graph

Given a float number convert it into the string WITHOUT using any inbuilt Function

March 25, 2014 by Dhaval Dave

Convert a floating point number to string

Given a float number convert it into the string WITHOUT using any inbuilt Function

Method 1:

class Float2String 
{ 
   public static void main(String[] args) 
   { 
      float f=7.64f; 
      String result; 
      result=""+f; 
      System.out.println(result); 
   } 
}


-by karthik dheeraj

Method 2:

#include<stdio.h>
#include<math.h>
 
// reverses a string 'str' of length 'len'
void reverse(char *str, int len)
{
    int i=0, j=len-1, temp;
    while (i<j)
    {
        temp = str[i];
        str[i] = str[j];
        str[j] = temp;
        i++; j--;
    }
}
 
 // Converts a given integer x to string str[]. 
int intToStr(int x, char str[], int d)
{
    int i = 0;
    while (x)
    {
        str[i++] = (x%10) + '0';
        x = x/10;
    }
 
    while (i < d)
        str[i++] = '0';
 
    reverse(str, i);
    str[i] = '\0';
    return i;
}
 
// Converts a floating point number to string.
void ftoa(float n, char *res, int afterpoint)
{
    int ipart = (int)n;
 
    float fpart = n - (float)ipart;
 
    int i = intToStr(ipart, res, 0);
 
    if (afterpoint != 0)
    {
        res[i] = '.';  // add dot
 
        // Get the value of fraction part upto given no.
        fpart = fpart * pow(10, afterpoint);
 
        intToStr((int)fpart, res + i + 1, afterpoint);
    }
}
 
int main()
{
    char res[20];
    float n = 233.007;
    ftoa(n, res, 4);
    printf("\n\"%s\"\n", res);
    return 0;
}

Similar Articles

Filed Under: Amazon Interview Question, problem Tagged With: string

Reader Interactions

Primary Sidebar

Join WeekEnd Online/Offline Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

Join WeekEnd Online/Offline Batch from 4-April-2020

WhatsApp us

Secondary Sidebar

Custom Search

  • How I cracked AMAZON
  • LeetCode
  • Adobe
  • Amazon
  • Facebook
  • Microsoft
  • Hacker Earth
  • CSE Interview

Top Rated Questions

Find an index i such that Arr [i] = i in array of n distinct integers sorted in ascending order.

Reliance Jio Software Developer Interview Experience

Find loop in Singly linked list

Find the smallest window in a string containing all characters of another string

Maximum size of square sub matrix with all 1’s in a binary matrix

Flipkart Set 1 On Campus with Answers

The Magic HackerEarth Nirvana solutions Hiring Challenge

Closed Parentheses checker

SAP Off Campus Hiring_ March 2015 Verbal Skills

Printing each word reverse in string

Mirror of Tree

Python List

Maximum occurred Smallest integer in n ranges

Convert Decimal to Roman numbers / Romanizer HackerEarth Code

SAP Off Campus Hiring_ March 2015 Computer Skills

Linked List V/S Binary Search Tree

Minimum insertions to form a palindrome

BlueStone E-commerce Interview Experience

There are N nuts and N bolts, u have to find all the pairs of nuts and bolts in minimum no. of iteration

Add Sub Multiply very large number stored as string

Find if a binary tree is height balanced ?

Maximum difference between two elements s.t larger element appears after the smaller number

Coin Collection Dynamic Programming

Daughter’s Age VeryGood Puzzle

N Petrol bunks or City arranged in circle. You have Fuel and distance between petrol bunks. Is it possible to find starting point so that we can travel all Petrol Bunks

Naurki.com Security Breach

System Design: Designing a LLD for Hotel Booking

Level order traversal in Spiral form

BFS (Breath First Search)

Maximum path sum between two leaves

Copyright © 2026 · Genesis Framework · WordPress · Log in